generalized Hölder inequality


Theorem Let 1≤r<∞ and 1≤pj<∞, where ∑j=1n1pj=1r. If fj∈Lpj for 1≤j≤n, then

∏j=1nfj∈Lr and

||∏j=1nfj||r≤∏j=1n||fj||pj.

The usual Hölder inequalityMathworldPlanetmath has n=2 and r=1.

Let X be a finite set, say X={x1,…,xm} and μ is the counting measure on X, so that μ⁢({xi})=1 for all i. Let fj⁢(xi)=ai⁢j≥0 for j=1,…,n and take r=1. Then the inequality becomes:

∑i=1m∏j=1nai⁢j≤∏j=1n(∑i=1mai⁢jpj)1pj .

.

Now let αj=1pj, and bi⁢j=ai⁢jpj. Then the inequality becomes:

∑i=1m∏j=1nbi⁢jαj≤∏j=1n(∑i=1mbi⁢j)αj.
Title generalized Hölder inequality
Canonical name GeneralizedHolderInequality
Date of creation 2013-03-22 16:54:35
Last modified on 2013-03-22 16:54:35
Owner Mathprof (13753)
Last modified by Mathprof (13753)
Numerical id 8
Author Mathprof (13753)
Entry type Theorem
Classification msc 46E30