Hölder's inequality
From Wikipedia, the free encyclopedia
In mathematical analysis Hölder's inequality, named after Otto Hölder, is a fundamental inequality between integrals and an indispensable tool for the study of Lp spaces.
Let (S,Σ,μ) be a measure space and let 1 ≤ p, q ≤ ∞ with 1/p + 1/q = 1. Then, for all measurable real- or complex-valued functions f and g on S,
This inequality holds even if ||fg||1 is infinite, the right hand side also being infinite in that case. In particular, if f is in Lp(μ) and g is in Lq(μ), then fg is in L1(μ).
For 1 < p, q < ∞ and f ∈ Lp(μ) and g ∈ Lq(μ), Hölder's inequality becomes an equality if and only if |f|p and |g|q are linearly dependent in L1(μ), meaning that there exist α, β ≥ 0, not both of them zero, such that α|f|p = β|g|q μ-almost everywhere.
The numbers p and q above are said to be Hölder conjugates of each other. The special case p = q = 2 gives the Cauchy-Schwarz inequality.
Hölder's inequality is used to prove the triangle inequality in the space Lp(μ) and the Minkowski inequality, and also to establish that Lp(μ) is dual to Lq(μ) for 1 ≤ q < ∞.
Hölder's inequality was first found by L. J. Rogers (1888), and discovered independently by Hölder (1889).
Contents |
[edit] Remarks
The brief statement of Hölder's inequality uses some conventions.
- In the definition of Hölder conjugates, 1/∞ means zero.
- If 1 ≤ p, q < ∞, then ||f||p and ||g||q stand for the (possibly infinite) expressions
-
and 
- If p = ∞, then ||f||∞ stands for the essential supremum of |f|, similarly for ||g||∞.
- The notation ||f||p with 1 ≤ p ≤ ∞ is a slight abuse, because in general it is only a norm of f if ||f||p is finite and f is considered as equivalence class of μ-almost everywhere equal functions. If f ∈ Lp(μ) and g ∈ Lq(μ), then the notation is adequate.
- On the right-hand side of Hölder's inequality, 0 times ∞ as well as ∞ times 0 means 0. Multiplying a > 0 with ∞ gives ∞.
[edit] Notable special cases
For the following cases assume that p and q are in the open interval (1,∞).
- In the case of n-dimensional Euclidean space, when the set S is {1, …, n} with the counting measure, we have
- If S = N with the counting measure, then we get Hölder's inequality for sequence spaces:
- If S is a measurable subset of Rn with the Lebesgue measure, and f and g are measurable real- or complex-valued functions on S, then Hölder inequality is
- For the probability space
, let
denote the expectation operator. For real- or complex-valued random variables X and Y on Ω, Hölder's inequality reads
- Let 0 < r < s and define p = s/r. Then q = p/(p−1) is the Hölder conjugate of p. Applying Hölder's inequality to the random variables |X|r and 1Ω, we obtain
- In particular, if the sth absolute moment is finite, then the rth absolute moment is finite, too. (This also follows from Jensen's inequality.)
[edit] Proof of Hölder's inequality
There exist several proofs of Hölder's inequality, we use Young's inequality for the main part.
If ||f||p = 0, then f is zero μ-almost everywhere, and the product fg is zero μ-almost everywhere, hence the left-hand side of Hölder's inequality is zero. The same is true if ||g||q = 0. Therefore, we may assume ||f||p > 0 and ||g||q > 0 in the following.
If ||f||p = ∞ or ||g||q = ∞, then the right-hand side of Hölder's inequality is infinite. Therefore, we may assume that ||f||p and ||g||q are in (0,∞).
If p = ∞ and q = 1, then |fg| ≤ ||f||∞ |g| almost everywhere and Hölders inequality follows from the monotonicity of the Lebesgue integral. Similarly for p = 1 and q = ∞. Therefore, we may also assume p, q ∈ (1,∞).
Dividing f and g by ||f||p and ||g||q, respectively, we can assume that
We now use Young's inequality, which states that
for all nonnegative a and b, where equality is achieved if and only if ap = bq. Hence
Integrating both sides gives
which proves the claim.
Under the assumptions p ∈ (1,∞) and ||f||p = ||g||q = 1, equality holds if and only if |f|p = |g|q almost everywhere. More generally, if ||f||p and ||g||q are in (0,∞), then Hölder's inequality becomes an equality if and only if there exist α, β > 0 (namely α = ||g||q and β = ||f||p) such that
μ-almost everywhere (*)
The case ||f||p = 0 corresponds to β = 0 in (*). The case ||g||q = 0 corresponds to α = 0 in (*).
[edit] Generalization
Assume that r ∈ (0,∞) and p1, …, pn ∈ (0,∞] such that
Then, for all measurable real- or complex valued functions f1, …, fn defined on S,
In particular,
Note: For r ∈ (0,1), contrary to the notation, ||.||r is in general not a norm, because it doesn't satisfy the triangle inequality.
[edit] Reverse Hölder inequality
Assume that p ∈ (1,∞) and that the measure space (S,Σ,μ) satisfies μ(S) > 0. Then, for all measurable real- or complex valued functions f and g on S such that g(s) ≠ 0 for μ-almost all s ∈ S,
If ||fg||1 < ∞ and ||g||−1/(p−1) > 0, then the reverse Hölder inequality is an equality if and only if there exists an α ≥ 0 such that
μ-almost everywhere.
Note: ||f||1/p and ||g||−1/(p−1) are not norms, these expressions are just compact notation for
and 
[edit] Conditional Hölder inequality
Let
be a probability space,
a sub-σ-algebra, and p, q ∈ (1,∞) Hölder conjugates, meaning that 1/p + 1/q = 1. Then, for all real- or complex-valued random variables X and Y on Ω,
Remarks:
- If a non-negative random variable Z has infinite expected value, then its conditional expectation is defined by
- On the right-hand side of the conditional Hölder inequality, 0 times ∞ as well as ∞ times 0 means 0. Multiplying a > 0 with ∞ gives ∞.
[edit] References
- Hardy, G.H.; Littlewood, J.E. & Pólya, G. (1934), Inequalities, Cambridge Univ. Press, ISBN 0521358809
- Hölder, O. (1889), “Ueber einen Mittelwerthsatz”, Nachr. Ges. Wiss. Göttingen: 38–47
- Kuptsov, L.P. (2001), “Hölder inequality”, in Hazewinkel, Michiel, Encyclopaedia of Mathematics, Kluwer Academic Publishers, ISBN 978-1556080104
- Rogers, L J. (1888), “An extension of a certain theorem in inequalities”, Messenger of math 17: 145–150
- Kuttler, Kenneth (2007), An introduction to linear algebra, Online e-book in PDF format, Brigham Young University, <http://www.math.byu.edu/~klkuttle/Linearalgebra.pdf>















and 






![\operatorname{E}\bigl[|XY|\big|\,\mathcal{G}\bigr]
\le
\bigl(\operatorname{E}\bigl[|X|^p\big|\,\mathcal{G}\bigr]\bigr)^{1/p}
\,\bigl(\operatorname{E}\bigl[|Y|^q\big|\,\mathcal{G}\bigr]\bigr)^{1/q}
\qquad\mathbb{P}\text{-almost surely.}](../../../../math/d/6/4/d6432ea5219c41a7d34c730bd42a6104.png)
![\operatorname{E}[Z|\mathcal{G}]=\sup_{n\in\mathbb{N}}\,\operatorname{E}[\min\{Z,n\}|\mathcal{G}]\quad\text{a.s.}](../../../../math/c/a/a/caaf2457b240e5ea033fb4ab5568e310.png)
![U=\bigl(\operatorname{E}\bigl[|X|^p\big|\,\mathcal{G}\bigr]\bigr)^{1/p},\qquad V=\bigl(\operatorname{E}\bigl[|Y|^q\big|\,\mathcal{G}\bigr]\bigr)^{1/q}](../../../../math/4/1/8/418578d0b3d4e9c88e7b5e2ae58fc198.png)
![\operatorname{E}\bigl[|X|^p1_{\{U=0\}}\bigr]
= \operatorname{E}\bigl[1_{\{U=0\}}\underbrace{\operatorname{E}\bigl[|X|^p\big|\,\mathcal{G}\bigr]}_{=\,U^p}\bigr]=0,](../../../../math/6/1/1/611c4824729f1a96e34059a422d45d5b.png)
![\operatorname{E}\bigl[|XY|\big|\,\mathcal{G}\bigr]=0\qquad\text{a.s. on }\{U=0\}\cup\{V=0\}](../../../../math/7/2/e/72e8a197a330219f6bf699dd5aee46e5.png)

![\frac{\operatorname{E}\bigl[|XY|\big|\,\mathcal{G}\bigr]}{UV}\le1
\qquad\text{a.s. on the set }H:=\{0<U<\infty,\,0<V<\infty\}.](../../../../math/2/6/6/2664842380ee085efb533112b497f36a.png)

![\begin{align}
\operatorname{E}\biggl[\frac{\operatorname{E}\bigl[|XY|\big|\,\mathcal{G}\bigr]}{UV}1_G\biggr]
&=\operatorname{E}\biggl[\operatorname{E}\biggl[\frac{|XY|}{UV}1_G\bigg|\,\mathcal{G}\biggr]\biggr]\\
&=\operatorname{E}\biggl[\frac{|X|}{U}1_G\cdot\frac{|Y|}{V}1_G\biggr]\\
&\le\biggl(\operatorname{E}\biggl[\frac{|X|^p}{U^p}1_G\biggr]\biggr)^{\!1/p\;}
\biggl(\operatorname{E}\biggl[\frac{|Y|^q}{V^q}1_G\biggr]\biggr)^{\!1/q}\\
&=\biggl(\operatorname{E}\biggl[\underbrace{\frac{\operatorname{E}\bigl[|X|^p\big|\,\mathcal{G}\bigr]}{U^p}}_{=\,1\text{ a.s. on }G}1_G\biggr]\biggr)^{\!1/p\;}
\biggl(\operatorname{E}\biggl[\underbrace{\frac{\operatorname{E}\bigl[|Y|^q\big|\,\mathcal{G}\bigr]}{V^p}}_{=\,1\text{ a.s. on }G}1_G\biggr]\biggr)^{\!1/q}\\
&=\operatorname{E}\bigl[1_G\bigr].
\end{align}](../../../../math/2/e/1/2e1af17f8a209aec21ce8ee66e750df0.png)

