Hölder's inequality

In mathematical analysis, Hölder's inequality, named after German mathematician Otto Hölder, is a fundamental inequality between integrals and an indispensable tool for the study of Lp spaces.

Hölder's inequality—Let (S,Σ,μ) be a measure space and let p,q∈[1,∞] with 1/p + 1/q = 1. Then for all measurable real- or complex-valued functions f and g on S,

‖fg‖1≤‖f‖p‖g‖q.

If, in addition, p,q∈(1,∞) and f∈Lp(μ) and g∈Lq(μ), then 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 real numbers α,β≥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 a form of the Cauchy–Schwarz inequality. Hölder's inequality holds even if ‖fg‖1 is infinite, the right-hand side also being infinite in that case. Conversely, if f is in Lp(μ) and g is in Lq(μ), then the pointwise product fg is in L1(μ).

Hölder's inequality is used to prove the Minkowski inequality, which is the triangle inequality in the space Lp(μ), and also to establish that Lq(μ) is the dual space of Lp(μ) for p∈[1,∞).

Hölder's inequality (in a slightly different form) was first found by Leonard James Rogers (1888). Inspired by Rogers' work, Hölder (1889) gave another proof as part of a work developing the concept of convex and concave functions and introducing Jensen's inequality, which was in turn named for work of Johan Jensen building on Hölder's work.

Remarks

Conventions

The brief statement of Hölder's inequality uses some conventions.

  • In the definition of Hölder conjugates, 1/∞ means zero.
  • If p, q ∈ [1, ∞), then ‖f ‖p and ‖g‖q stand for the (possibly infinite) expressions
(∫S|f|pdμ)1p(∫S|g|qdμ)1q
  • 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 × ∞ as well as ∞ × 0 means 0. Multiplying a > 0 with ∞ gives ∞.

Estimates for integrable products

As above, let f and g denote measurable real- or complex-valued functions defined on S. If ‖fg‖1 is finite, then the pointwise products of f with g and its complex conjugate function are μ-integrable, the estimate

|∫Sfg¯dμ|≤∫S|fg|dμ=‖fg‖1

and the similar one for fg hold, and Hölder's inequality can be applied to the right-hand side. In particular, if f and g are in the Hilbert space L2(μ), then Hölder's inequality for p = q = 2 implies

|⟨f,g⟩|≤‖f‖2‖g‖2,

where the angle brackets refer to the inner product of L2(μ). This is also called Cauchy–Schwarz inequality, but requires for its statement that ‖f ‖2 and ‖g‖2 are finite to make sure that the inner product of f and g is well defined. We may recover the original inequality (for the case p = 2) by using the functions |f | and |g| in place of f and g.

Generalization for probability measures

If (S, Σ, μ) is a probability space, then p, q ∈ [1, ∞] just need to satisfy 1/p + 1/q ≤ 1, rather than being Hölder conjugates. A combination of Hölder's inequality and Jensen's inequality implies that

‖fg‖1≤‖f‖p‖g‖q

for all measurable real- or complex-valued functions f and g on S.

Notable special cases

For the following cases assume that p and q are in the open interval (1,∞) with 1/p + 1/q = 1.

Counting measure

For the n-dimensional Euclidean space, when the set S is {1,…,n} with the counting measure, we have

∑k=1n|xkyk|≤(∑k=1n|xk|p)1p(∑k=1n|yk|q)1q for all (x1,…,xn),(y1,…,yn)∈ℝn or ℂn.

Often the following practical form of this is used, for any (r,s)∈ℝ+:

(∑k=1n|xk|r|yk|s)r+s≤(∑k=1n|xk|r+s)r(∑k=1n|yk|r+s)s.

For more than two sums, the following generalisation (Lohwater (1982), Chen (2014)) holds, with real positive exponents λi and λa+λb+⋯+λz=1:

∑k=1n|ak|λa|bk|λb⋯|zk|λz≤(∑k=1n|ak|)λa(∑k=1n|bk|)λb⋯(∑k=1n|zk|)λz.

Equality holds iff |a1|:|a2|:⋯:|an|=|b1|:|b2|:⋯:|bn|=⋯=|z1|:|z2|:⋯:|zn|.

If S=ℕ with the counting measure, then we get Hölder's inequality for sequence spaces:

∑k=1∞|xkyk|≤(∑k=1∞|xk|p)1p(∑k=1∞|yk|q)1q for all (xk)k∈ℕ,(yk)k∈ℕ∈ℝℕ or ℂℕ.

Lebesgue measure

If S is a measurable subset of ℝn with the Lebesgue measure, and f and g are measurable real- or complex-valued functions on S, then Hölder's inequality is

∫S|f(x)g(x)|dx≤(∫S|f(x)|pdx)1p(∫S|g(x)|qdx)1q.

Probability measure

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

𝔼[|XY|]⩽(𝔼[|X|p])1p(𝔼[|Y|q])1q.

Let 1<r<s<∞ and define p=sr. Then q=pp−1 is the Hölder conjugate of p. Applying Hölder's inequality to the random variables |X|r and 1Ω we obtain

𝔼[|X|r]⩽(𝔼[|X|s])rs.

In particular, if the sth absolute moment is finite, then the r th absolute moment is finite, too. (This also follows from Jensen's inequality.)

Product measure

For two σ-finite measure spaces (S1, Σ1, μ1) and (S2, Σ2, μ2) define the product measure space by

S=S1×S2,Σ=Σ1⊗Σ2,μ=μ1⊗μ2,

where S is the Cartesian product of S1 and S2, the σ-algebra Σ arises as product σ-algebra of Σ1 and Σ2, and μ denotes the product measure of μ1 and μ2. Then Tonelli's theorem allows us to rewrite Hölder's inequality using iterated integrals: If f and g are Σ-measurable real- or complex-valued functions on the Cartesian product S, then

∫S1∫S2|f(x,y)g(x,y)|μ2(dy)μ1(dx)≤(∫S1∫S2|f(x,y)|pμ2(dy)μ1(dx))1p(∫S1∫S2|g(x,y)|qμ2(dy)μ1(dx))1q.

This can be generalized to more than two σ-finite measure spaces.

Vector-valued functions

Let (S, Σ, μ) denote a σ-finite measure space and suppose that f = (f1, ..., fn) and g = (g1, ..., gn) are Σ-measurable functions on S, taking values in the n-dimensional real- or complex Euclidean space. By taking the product with the counting measure on {1, ..., n}, we can rewrite the above product measure version of Hölder's inequality in the form

∫S∑k=1n|fk(x)gk(x)|μ(dx)≤(∫S∑k=1n|fk(x)|pμ(dx))1p(∫S∑k=1n|gk(x)|qμ(dx))1q.

If the two integrals on the right-hand side are finite, then equality holds if and only if there exist real numbers α, β ≥ 0, not both of them zero, such that

α(|f1(x)|p,…,|fn(x)|p)=β(|g1(x)|q,…,|gn(x)|q),

for μ-almost all x in S.

This finite-dimensional version generalizes to functions f and g taking values in a normed space which could be for example a sequence space or an inner product space.

Proof of Hölder's inequality

There are several proofs of Hölder's inequality; the main idea in the following is Young's inequality for products.

Proof

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ölder's inequality follows from the monotonicity of the Lebesgue integral. Similarly for p = 1 and q = ∞. Therefore, we may assume p, q ∈ (1,∞).

We now use Young's inequality for products, which states that whenever p,q are in (1,∞) with 1p+1q=1

ab≤app+bqq

for all nonnegative a and b, where equality is achieved if and only if ap = bq. Hence

|f(s)|‖f‖p|g(s)|‖g‖q≤|f(s)|pp‖f‖pp+|g(s)|qq‖g‖qq,s∈S.

Integrating both sides gives

‖fg‖1||f||p||g||q≤‖f‖ppp‖f‖pp+‖g‖qqq‖g‖qq=1p+1q=1,

which proves the claim.

Under the assumptions p ∈ (1, ∞) and ‖f ‖p = ‖g‖q, 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 real numbers α, β > 0, namely

α=‖g‖qq,β=‖f‖pp,

such that

α|f|p=β|g|q   μ-almost everywhere   (*).

The case ‖f ‖p = 0 corresponds to β = 0 in (*). The case ‖g‖q = 0 corresponds to α = 0 in (*).

Alternative proof using Jensen's inequality:

Proof

The function x↦xp on (0,∞) is convex because p≥1, so by Jensen's inequality,

∫hdν≤(∫hpdν)1p

where ν is any probability distribution and h any ν-measurable function. Let μ be any measure, and ν the distribution whose density w.r.t. μ is proportional to gq, i.e.

dν=gq∫gqdμdμ

Hence we have, using 1p+1q=1, hence p(1−q)+q=0, and letting h=fg1−q,

∫fgdμ=(∫gqdμ)∫fg1−q⏟hgq∫gqdμdμ⏟dν≤(∫gqdμ)(∫fpgp(1−q)⏟hpgq∫gqdμdμ⏟dν)1p=(∫gqdμ)(∫fp∫gqdμdμ)1p.

Finally, we get

∫fgdμ≤(∫fpdμ)1p(∫gqdμ)1q

This assumes that f, g are real and non-negative, but the extension to complex functions is straightforward (use the modulus of f, g). It also assumes that ‖f‖p,‖g‖q are neither null nor infinity, and that p,q>1: all these assumptions can also be lifted as in the proof above.

We could also bypass use of both Young's and Jensen's inequalities. The proof below also explains why and where the Hölder exponent comes in naturally.

Proof

As in the previous proof, it suffices to prove

∫X|h|dν≤(∫X|h|pdν)1p=‖h‖p

where ν(X)=1 and h is ν-measurable (real or complex) function on X. To prove this, we must bound |h| by |h|p. Obviously, there cannot exist a constant C that would imply |h(x)| ≤ C|h(x)|p for all x. The issue is for the values of |h| near zero. Hence, we might hope to find an inequality of the form

|h(x)| ≤ a′|h(x)|p+b′,for allx

for suitable choices of a′ and b′.

Next, we must remove possible dependence of a′ and b′ on h. Observe that we need to obtain A:=‖h‖p on the right-hand side after integrating the inequality above. By trial and error, we see that the inequality that we want should have the form

|h(x)| ≤ aA1−p|h(x)|p+bA,for allx,

where a,b are non-negative and a+b=1. Indeed, then the integral of the right-hand side will be precisely A. Thus, it remains to prove that such an inequality does hold with the right choice of universal constants a,b, which are in particular independent of h and the measure.

The inequality we seek would follow from:

yA ≤ a(yA)p+b,for ally>0,

which, in turn, is equivalent to

(∗)z ≤ azp+b,for allz>0.

It turns out that there is one and only one choice of a,b, subject to a+b=1, that makes the last inequality true: a=1p and b=1−1p. (This is where Hölder conjugate exponent is born!) This validates the inequality at the first paragraph of this proof. Proof of Hölder's inequality follows from this, as in the previous proof.

Alternatively, we can deduce Young's inequality and then resort to the first proof given above. Young's inequality follows from the inequality (*) above by choosing z=abq−1 and multiplying both sides by bq.

Extremal equality

Statement

Assume that 1 ≤ p < ∞ and let q denote the Hölder conjugate. Then for every f ∈ Lp(μ),

‖f‖p=max⁡{|∫Sfgdμ|:g∈Lq(μ),‖g‖q≤1},

where max indicates that there actually is a g maximizing the right-hand side. When p = ∞ and if each set A in the σ-field Σ with μ(A) = ∞ contains a subset B ∈ Σ with 0 < μ(B) < ∞ (which is true in particular when μ is σ-finite), then

‖f‖∞=sup⁡{|∫Sfgdμ|:g∈L1(μ),‖g‖1≤1}.

Proof of the extremal equality:

Proof

By Hölder's inequality, the integrals are well defined and, for 1 ≤ p ≤ ∞,

|∫Sfgdμ|≤∫S|fg|dμ≤‖f‖p,

hence the left-hand side is always bounded above by the right-hand side.

Conversely, for 1 ≤ p ≤ ∞, observe first that the statement is obvious when ‖f ‖p = 0. Therefore, we assume ‖f ‖p > 0 in the following.

If 1 ≤ p < ∞, define g on S by

g(x)={‖f‖p1−p|f(x)|p/f(x)if f(x)≠0,0otherwise.

By checking the cases p = 1 and 1 < p < ∞ separately, we see that ‖g‖q = 1 and

∫Sfgdμ=‖f‖p.

It remains to consider the case p = ∞. For ε ∈ (0, 1) define

A={x∈S:|f(x)|>(1−ε)‖f‖∞}.

Since f is measurable, A ∈ Σ. By the definition of ‖f ‖∞ as the essential supremum of f and the assumption ‖f ‖∞ > 0, we have μ(A) > 0. Using the additional assumption on the σ-field Σ if necessary, there exists a subset B ∈ Σ of A with 0 < μ(B) < ∞. Define g on S by

g(x)={1−εμ(B)‖f‖∞f(x)if x∈B,0otherwise.

Then g is well-defined, measurable and |g(x)| ≤ 1/μ(B) for x ∈ B, hence ‖g‖1 ≤ 1. Furthermore,

|∫Sfgdμ|=∫B1−εμ(B)‖f‖∞dμ=(1−ε)‖f‖∞.

Remarks and examples

  • The equality for p=∞ fails whenever there exists a set A of infinite measure in the σ-field Σ with that has no subset B∈Σ that satisfies: 0<μ(B)<∞. (the simplest example is the σ-field Σ containing just the empty set and S, and the measure μ with μ(S)=∞.) Then the indicator function 1A satisfies ‖1A‖∞=1, but every g∈L1(μ) has to be μ-almost everywhere constant on A, because it is Σ-measurable, and this constant has to be zero, because g is μ-integrable. Therefore, the above supremum for the indicator function 1A is zero and the extremal equality fails.
  • The extremal inequality for p∈[1,∞) is an example of a more general result about Banach spaces which follows from the Hahn-Banach theorem: if V is a Banach space and V∗is its dual space, then ∀x∈V,‖x‖V=sup‖f‖V∗=1|f(x)|.
  • For p=∞, the supremum is in general not attained. As an example, let S=ℕ,Σ=𝒫(ℕ) and μ the counting measure. Define:
{f:ℕ→ℝf(n)=n−1n
Then ‖f‖∞=1. For g∈L1(μ,ℕ) with 0<‖g‖1⩽1, let m denote the smallest natural number with g(m)≠0. Then
|∫Sfgdμ|⩽m−1m|g(m)|+∑n=m+1∞|g(n)|=‖g‖1−|g(m)|m<1.

Applications

  • The extremal equality is one of the ways for proving the triangle inequality ‖f1 + f2‖p ≤ ‖f1‖p + ‖f2‖p for all f1 and f2 in Lp(μ), see Minkowski inequality.
  • Hölder's inequality implies that every f ∈ Lp(μ) defines a bounded (or continuous) linear functional κf on Lq(μ) by the formula
κf(g)=∫Sfgdμ,g∈Lq(μ).
The extremal equality (when true) shows that the norm of this functional κf as element of the continuous dual space Lq(μ)* coincides with the norm of f in Lp(μ) (see also the Lp-space article).

Generalization with more than two functions

Statement

Assume that r ∈ (0, ∞] and p1, ..., pn ∈ (0, ∞] such that

∑k=1n1pk=1r

where 1/∞ is interpreted as 0 in this equation, and r=∞ implies p1, ..., pn ∈ (0, ∞] are all equal to ∞. Then, for all measurable real or complex-valued functions f1, ..., fn defined on S,

‖∏k=1nfk‖r≤∏k=1n‖fk‖pk

where we interpret any product with a factor of ∞ as ∞ if all factors are positive, but the product is 0 if any factor is 0.

In particular, if fk∈Lpk(μ) for all k∈{1,…,n} then ∏k=1nfk∈Lr(μ).

Note: For r∈(0,1), contrary to the notation, ‖.‖r is in general not a norm because it doesn't satisfy the triangle inequality.

Proof of the generalization:

Proof

We use Hölder's inequality and mathematical induction. If n=1 then the result is immediate. Let us now pass from n−1 to n. Without loss of generality assume that p1≤⋯≤pn.

Case 1: If pn=∞ then

∑k=1n−11pk=1r.

Pulling out the essential supremum of |fn| and using the induction hypothesis, we get

‖f1⋯fn‖r≤‖f1⋯fn−1‖r‖fn‖∞≤‖f1‖p1⋯‖fn−1‖pn−1‖fn‖∞.

Case 2: If pn<∞ then necessarily r<∞ as well, and then

p:=pnpn−r,q:=pnr

are Hölder conjugates in (1, ∞). Application of Hölder's inequality gives

‖|f1⋯fn−1|r|fn|r‖1≤‖|f1⋯fn−1|r‖p‖|fn|r‖q.

Raising to the power 1/r and rewriting,

‖f1⋯fn‖r≤‖f1⋯fn−1‖pr‖fn‖qr.

Since qr=pn and

∑k=1n−11pk=1r−1pn=pn−rrpn=1pr,

the claimed inequality now follows by using the induction hypothesis.

Interpolation

Let p1, ..., pn ∈ (0, ∞] and let θ1, ..., θn ∈ (0, 1) denote weights with θ1 + ... + θn = 1. Define p as the weighted harmonic mean, that is,

1p=∑k=1nθkpk.

Given measurable real- or complex-valued functions fk on S, then the above generalization of Hölder's inequality gives

‖|f1|θ1⋯|fn|θn‖p≤‖|f1|θ1‖p1θ1⋯‖|fn|θn‖pnθn=‖f1‖p1θ1⋯‖fn‖pnθn.

In particular, taking f1=⋯=fn=:f gives

‖f‖p⩽∏k=1n‖f‖pkθk.

Specifying further θ1 = θ and θ2 = 1-θ, in the case n=2, we obtain the interpolation result

Littlewood's inequality—For θ∈(0,1) and 1pθ=θp1+1−θp0,

‖f‖pθ⩽‖f‖p1θ⋅‖f‖p01−θ,

An application of Hölder gives

Lyapunov's inequality—If p=(1−θ)p0+θp1,θ∈(0,1), then

‖|f0|p0(1−θ)p⋅|f1|p1θp‖pp≤‖f0‖p0p0(1−θ)‖f1‖p1p1θ

and in particular

‖f‖pp⩽‖f‖p0p0(1−θ)⋅‖f‖p1p1θ.

Both Littlewood and Lyapunov imply that if f∈Lp0∩Lp1 then f∈Lp for all p0<p<p1.

Reverse Hölder inequalities

Two functions

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,

‖fg‖1⩾‖f‖1p‖g‖−1p−1.

If

‖fg‖1<∞and‖g‖−1p−1>0,

then the reverse Hölder inequality is an equality if and only if

∃α⩾0|f|=α|g|−pp−1μ-almost everywhere.

Note: The expressions:

‖f‖1p and ‖g‖−1p−1,

are not norms, they are just compact notations for

(∫S|f|1pdμ)pand(∫S|g|−1p−1dμ)−(p−1).
Proof of the reverse Hölder inequality (hidden, click show to reveal.)

Note that p and

q:=pp−1∈(1,∞)

are Hölder conjugates. Application of Hölder's inequality gives

‖|f|1p‖1=‖|fg|1p|g|−1p‖1⩽‖|fg|1p‖p‖|g|−1p‖q=‖fg‖11p‖|g|−1p−1‖1p−1p

Raising to the power p gives us:

‖|f|1p‖1p⩽‖fg‖1‖|g|−1p−1‖1p−1.

Therefore:

‖|f|1p‖1p‖|g|−1p−1‖1−(p−1)⩽‖fg‖1.

Now we just need to recall our notation.

Since g is not almost everywhere equal to the zero function, we can have equality if and only if there exists a constant α ≥ 0 such that |fg| = α |g|−q/p almost everywhere. Solving for the absolute value of f gives the claim.

Multiple functions

The Reverse Hölder inequality (above) can be generalized to the case of multiple functions if all but one conjugate is negative. That is,

Let p1,...,pm−1<0 and pm∈ℝ be such that ∑k=1m1pk=1 (hence 0<pm<1). Let fk be measurable functions for k=1,...,m. Then
‖∏k=1mfk‖1≥∏k=1m‖fk‖pk.

This follows from the symmetric form of the Hölder inequality (see below).

Symmetric forms of Hölder inequality

It was observed by Aczél and Beckenbach that Hölder's inequality can be put in a more symmetric form, at the price of introducing an extra vector (or function):

Let f=(f(1),…,f(m)),g=(g(1),…,g(m)),h=(h(1),…,h(m)) be vectors with positive entries and such that f(i)g(i)h(i)=1 for all i. If p,q,r are nonzero real numbers such that 1p+1q+1r=0, then:

The standard Hölder inequality follows immediately from this symmetric form (and in fact is easily seen to be equivalent to it). The symmetric statement also implies the reverse Hölder inequality (see above).

The result can be extended to multiple vectors:

Let f1,…,fn be n vectors in ℝm with positive entries and such that f1(i)…fn(i)=1 for all i. If p1,…,pn are nonzero real numbers such that 1p1+⋯+1pn=0, then:

As in the standard Hölder inequalities, there are corresponding statements for infinite sums and integrals.

Conditional Hölder inequality

Let (Ω, F, ℙ) be a probability space, G ⊂ F 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 Ω,

𝔼[|XY||𝒢]≤(𝔼[|X|p|𝒢])1p(𝔼[|Y|q|𝒢])1qℙ-almost surely.

Remarks:

𝔼[Z|𝒢]=supn∈ℕ𝔼[min⁡{Z,n}|𝒢]a.s.

Proof of the conditional Hölder inequality:

Proof

Define the random variables

U=(𝔼[|X|p|𝒢])1p,V=(𝔼[|Y|q|𝒢])1q

and note that they are measurable with respect to the sub-σ-algebra. Since

𝔼[|X|p1{U=0}]=𝔼[1{U=0}𝔼[|X|p|𝒢]⏟=Up]=0,

it follows that |X| = 0 a.s. on the set {U = 0}. Similarly, |Y| = 0 a.s. on the set {V = 0}, hence

𝔼[|XY||𝒢]=0a.s. on {U=0}∪{V=0}

and the conditional Hölder inequality holds on this set. On the set

{U=∞,V>0}∪{U>0,V=∞}

the right-hand side is infinite and the conditional Hölder inequality holds, too. Dividing by the right-hand side, it therefore remains to show that

𝔼[|XY||𝒢]UV≤1a.s. on the set H:={0<U<∞,0<V<∞}.

This is done by verifying that the inequality holds after integration over an arbitrary

G∈𝒢,G⊂H.

Using the measurability of U, V, 1G with respect to the sub-σ-algebra, the rules for conditional expectations, Hölder's inequality and 1/p + 1/q = 1, we see that

𝔼[𝔼[|XY||𝒢]UV1G]=𝔼[𝔼[|XY|UV1G|𝒢]]=𝔼[|X|U1G⋅|Y|V1G]≤(𝔼[|X|pUp1G])1p(𝔼[|Y|qVq1G])1q=(𝔼[𝔼[|X|p|𝒢]Up⏟=1 a.s. on G1G])1p(𝔼[𝔼[|Y|q|𝒢]Vp⏟=1 a.s. on G1G])1q=𝔼[1G].

Hölder's inequality for increasing seminorms

Let S be a set and let F(S,ℂ) be the space of all complex-valued functions on S. Let N be an increasing seminorm on F(S,ℂ), meaning that, for all real-valued functions f,g∈F(S,ℂ) we have the following implication (the seminorm is also allowed to attain the value ∞):

∀s∈Sf(s)⩾g(s)⩾0⇒N(f)⩾N(g).

Then:

∀f,g∈F(S,ℂ)N(|fg|)⩽(N(|f|p))1p(N(|g|q))1q,

where the numbers p and q are Hölder conjugates.

Remark: If (S, Σ, μ) is a measure space and N(f) is the upper Lebesgue integral of |f| then the restriction of N to all Σ-measurable functions gives the usual version of Hölder's inequality.


Distances based on Hölder inequality

Hölder inequality can be used to define statistical dissimilarity measures between probability distributions. Those Hölder divergences are projective: They do not depend on the normalization factor of densities.

See also