In mathematical analysis, the Minkowski inequality establishes that the  spaces satisfy the triangle inequality in the definition of normed vector spaces. The inequality is named after the German mathematician Hermann Minkowski.
 spaces satisfy the triangle inequality in the definition of normed vector spaces. The inequality is named after the German mathematician Hermann Minkowski. 
Let  be a measure space, let
 be a measure space, let  and let
 and let  and
 and  be elements of
 be elements of  Then
 Then  is in
 is in  and we have the triangle inequality
 and we have the triangle inequality 
 
 
with equality for  if and only if
 if and only if  and
 and  are positively linearly dependent; that is,
 are positively linearly dependent; that is,  for some
 for some  or
 or  Here, the norm is given by:
 Here, the norm is given by: 
 
 
if  or in the case
 or in the case  by the essential supremum
 by the essential supremum 
 
 
The Minkowski inequality is the triangle inequality in  In fact, it is a special case of the more general fact
 In fact, it is a special case of the more general fact 
 
 
where it is easy to see that the right-hand side satisfies the triangular inequality. 
Like Hölder's inequality, the Minkowski inequality can be specialized to sequences and vectors by using the counting measure: 
 
 
for all real (or complex) numbers  and where
 and where  is the cardinality of
 is the cardinality of  (the number of elements in
 (the number of elements in  ).
). 
In probabilistic terms, given the probability space  and
 and  denote the expectation operator for every real- or complex-valued random variables
 denote the expectation operator for every real- or complex-valued random variables  and
 and  on
 on  Minkowski's inequality reads
 Minkowski's inequality reads 
 ![{\displaystyle \left(\mathbb {E} [|X+Y|^{p}]\right)^{\frac {1}{p}}\leqslant \left(\mathbb {E} [|X|^{p}]\right)^{\frac {1}{p}}+\left(\mathbb {E} [|Y|^{p}]\right)^{\frac {1}{p}}.}](./_assets_/d5cf48177bbce10cb6a31fd118c2436cab6765f1.svg) 
Proof
 Proof by Hölder's inequality
 First, we prove that  has finite
 has finite  -norm if
-norm if  and
 and  both do, which follows by
 both do, which follows by 
 
 
Indeed, here we use the fact that  is convex over
 is convex over  (for
 (for  ) and so, by the definition of convexity,
) and so, by the definition of convexity, 
 
 
This means that 
 
 
Now, we can legitimately talk about  . If it is zero, then Minkowski's inequality holds. We now assume that
. If it is zero, then Minkowski's inequality holds. We now assume that  is not zero. Using the triangle inequality and then Hölder's inequality, we find that
 is not zero. Using the triangle inequality and then Hölder's inequality, we find that 
 
 
We obtain Minkowski's inequality by multiplying both sides by 
 
 
 Proof by a direct convexity argument
 Given  , one has, by convexity (Jensen's inequality), for every
, one has, by convexity (Jensen's inequality), for every  
 
  
By integration this leads to  
  
One takes then  
  
to reach the conclusion. 
 Minkowski's integral inequality
 Suppose that  and
 and  are two 𝜎-finite measure spaces and
 are two 𝜎-finite measure spaces and  is measurable.  Then Minkowski's integral inequality is:
 is measurable.  Then Minkowski's integral inequality is: 
![{\displaystyle \left[\int _{S_{2}}\left|\int _{S_{1}}F(x,y)\,\mu _{1}(\mathrm {d} x)\right|^{p}\mu _{2}(\mathrm {d} y)\right]^{\frac {1}{p}}~\leq ~\int _{S_{1}}\left(\int _{S_{2}}|F(x,y)|^{p}\,\mu _{2}(\mathrm {d} y)\right)^{\frac {1}{p}}\mu _{1}(\mathrm {d} x),\quad p\in [1,\infty )}](./_assets_/64328c73ed7f4f2144bbb15925432792594de978.svg) 
 
with obvious modifications in the case  If
  If  and both sides are finite, then equality holds only if
 and both sides are finite, then equality holds only if  a.e. for some non-negative measurable functions
 a.e. for some non-negative measurable functions  and
 and  .
. 
If  is the counting measure on a two-point set
 is the counting measure on a two-point set  then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting
 then Minkowski's integral inequality gives the usual Minkowski inequality as a special case: for putting  for
 for  the integral inequality gives
 the integral inequality gives 
 
 
If the measurable function  is non-negative then for all
 is non-negative then for all  
 
 
 
This notation has been generalized to 
![{\displaystyle \|f\|_{p,q}=\left(\int _{\mathbb {R} ^{m}}\left[\int _{\mathbb {R} ^{n}}|f(x,y)|^{q}\mathrm {d} y\right]^{\frac {p}{q}}\mathrm {d} x\right)^{\frac {1}{p}}}](./_assets_/378fb353fca1c3274d623037524f0b25d84d29f4.svg) 
 
for  with
 with  Using this notation, manipulation of the exponents reveals that, if
  Using this notation, manipulation of the exponents reveals that, if  then
 then  .
. 
 Reverse inequality
 When  the reverse inequality holds:
 the reverse inequality holds: 
 
 
We further need the restriction that both   and
 and  are non-negative, as we can see from the example
 are non-negative, as we can see from the example  and
 and  
  
  
The reverse inequality follows from the same argument as the standard Minkowski, but uses that Holder's inequality is also reversed in this range. 
Using the Reverse Minkowski, we may prove that power means with  such as the harmonic mean and the geometric mean are concave.
 such as the harmonic mean and the geometric mean are concave. 
 Generalizations to other functions
 The Minkowski inequality can be generalized to other functions  beyond the power function
 beyond the power function  . The generalized inequality has the form
. The generalized inequality has the form 
 
 
Various sufficient conditions on  have been found by Mulholland[4] and others. For example, for
 have been found by Mulholland[4] and others. For example, for  one set of sufficient conditions from Mulholland is
 one set of sufficient conditions from Mulholland is  
  is continuous and strictly increasing with is continuous and strictly increasing with 
 is a convex function of is a convex function of 
 is a convex function of is a convex function of 
See also
  References
      - ^ Mulholland, H. P. (1949). "On Generalizations of Minkowski's Inequality in the Form of a Triangle Inequality". Proceedings of the London Mathematical Society. s2-51 (1): 294–307. doi:10.1112/plms/s2-51.4.294. 
  - Bahouri, Hajer; Chemin, Jean-Yves; Danchin, Raphaël (2011). Fourier Analysis and Nonlinear Partial Differential Equations. Grundlehren der mathematischen Wissenschaften. Vol. 343. Berlin, Heidelberg: Springer. ISBN 978-3-642-16830-7. OCLC 704397128.
- Hardy, G. H.; Littlewood, J. E.; Pólya, G. (1988). Inequalities. Cambridge Mathematical Library (second ed.). Cambridge: Cambridge University Press. ISBN 0-521-35880-9.
- Minkowski, H. (1953). Geometrie der Zahlen. Chelsea..
- Stein, Elias (1970). Singular integrals and differentiability properties of functions. Princeton University Press..
- M.I. Voitsekhovskii (2001) [1994], "Minkowski inequality", Encyclopedia of Mathematics, EMS Press
- Lohwater, Arthur J. (1982). "Introduction to Inequalities".
Further reading
   |  | 
|---|
| Basic concepts |  | 
|---|
| Sets |  | 
|---|
| Types of measures |  | 
|---|
| Particular measures |  | 
|---|
| Maps |  | 
|---|
| Main results |  | 
|---|
| Other results |  | 
|---|
| Applications & related |  | 
|---|