Measure Theory/L^p spaces
Recall that an
space is defined as 
Contents |
[edit] Jensen's inequality
Let (X,Σ,μ) be a probability measure space.
Let
,
be such that there exist
with a < f(x) < b
If ϕ is a convex function on (a,b) then,

Proof
Let
. As μ is a probability measure, a < t < b
Let 
Let t < u < b; then 
Thus,
, that is 
Put s = f(x)
, which completes the proof.
[edit] Corollary
- Putting ϕ(x) = ex,

- If X is finite, μ is a counting measure, and if f(xi) = pi, then

For every
, define 
[edit] Holder's inequality
Let
such that
. Let
and
.
Then,
and

Proof
We know that log is a concave function
Let
, 0 < a < b. Then 
That is, 
Let
,
, 

Then,
,
which proves the result
[edit] Corollary
If
,
then 
Proof
Let
,
, 
Then,
, and hence 
We say that if
, f = g almost everywhere on X if
. Observe that this is an equivalence relation on 
If (X,Σ,μ) is a measure space, define the space Lp to be the set of all equivalence classes of functions in 
[edit] Theorem
The Lp space with the
norm is a normed linear space, that is,
for every
, further, 

. . . (Minkowski's inequality)
Proof
1. and 2. are clear, so we prove only 3. The cases p = 1 and
(see below) are obvious, so assume that
and let
be given. Hölder's inequality yields the following, where q is chosen such that 1 / q + 1 / p = 1 so that p / q = p − 1:


Moreover, as
is convex for p > 1,

This shows that
so that we may divide by it in the previous calculation to obtain
.
Define the space
. Further, for
define 


for every
, further, 
