Measure Theory/L^p spaces

From testwiki
Jump to navigation Jump to search

Recall that an p space is defined as p(X)={f:X:f is measurable,X|f|pdμ<}

Jensen's inequality

Let (X,Σ,μ) be a probability measure space.

Let f:X, f1 be such that there exist a,b with a<f(x)<b

If ϕ is a convex function on (a,b) then,

ϕ(Xfdμ)Xϕfdμ

Proof

Let t=Xfdμ. As μ is a probability measure, a<t<b

Let β=sup{ϕ(t)ϕ(s)ts:a<s<t<b}

Let t<u<b; then βϕ(u)ϕ(t)ut


Thus, ϕ(t)ϕ(s)tsϕ(u)ϕ(t)ut, that is ϕ(t)ϕ(s)β(ts)


Put s=f(x)


ϕ(Xfdμ)ϕf(x)β(f(x)Xfdμ), which completes the proof.

Corollary

  1. Putting ϕ(x)=ex,
    e(Xfdμ)Xefdμ
  1. If X is finite, μ is a counting measure, and if f(xi)=pi, then
    e(p1++pnn)1n(ep1+ep2++epn)

For every fp, define fp=(X|f|pdμ)1p

Holder's inequality

Let 1<p,q< such that 1p+1q=1. Let fp and gq.

Then, fg1 and

fgfpgq

Proof

We know that log is a concave function

Let 0t1, 0<a<b. Then tloga+(1t)logblog(at+b(1t))


That is, atb1tta+(1t)b

Let t=1p, a=(|f|fp)p, b=(|f|fq)q


|f|fp|g|gq1p|f|pfpp+1q|g|qgqq


Then, 1fpgqX|f||g|dμ1pfppX|f|pdμ+1pgqqX|g|qdμ=1,

which proves the result

Corollary

If μ(X)<, 1<s<r< then rs

Proof

Let ϕs, p=rs1, g1

Then, f=|ϕ|s1, and hence X|ϕ|sdμ(X(|ϕ|s)rsdμ)srμ(X)1sr


We say that if f,g:X, f=g almost everywhere on X if μ({x|f(x)g(x)})=0. Observe that this is an equivalence relation on p


If (X,Σ,μ) is a measure space, define the space Lp to be the set of all equivalence classes of functions in p

Theorem

The Lp space with the p norm is a normed linear space, that is,

  1. fp0 for every fLp, further, fp=0f=0
  2. λp=|λ|fp
  3. f+gpfp+gp . . . (Minkowski's inequality)

Proof

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

X|f+g|pdμ=X|f+g|p1|f+g|dμX|f+g|p1(|f|+|g|)dμ

(X|f+g|(p1)qdμ)1qfp+(X|f+g|(p1)qdμ)1qgp=f+gppqfp+f+gppqgp.

Moreover, as ttp is convex for p>1,

|f+g|p2p=|f2+g2|p(|f|2+|g|2)p12|f|p+12|g|p.

This shows that f+gp< so that we may divide by it in the previous calculation to obtain f+gpfp+gp.


Define the space L={f|X,f is bounded almost everywhere}. Further, for fL define f=sup{|f(x)|:xE}


Template:BookCat