nLab
Lebesgue space

Context

Functional analysis

Integration theory

Contents

Idea

The term ‘Lebesgue space’ can stand for two distinct notions: one is the general notion of measure space (compare the Springer Encyclopaedia of Mathematics) and another is the notion of L p space (or L p space). Here we discuss the latter.

Sometimes ‘L p’ is used as a synonym for L p; sometimes it is used to mean L 1/p.

Definitions

If 1p< is a real number and (Ω,μ) is a measure space, one considers the L p space L p(Ω) of (equivalence classes of) measurable (complex- or real-valued) functions f:Ω𝕂 whose (absolute values of) pth powers are integrable; i.e. whose norm

f p=( Ωf pdμ) 1/p{\|f\|_p} = \left(\int_\Omega {|f|^p} \,d\mu\right)^{1/p}

is finite.

The L p spaces are examples of Banach spaces; they are continuous analogues of l p spaces of p-summable series. (Indeed, l p(S), for S a set, is simply L p(S) if S is equipped with counting measure?.)

For fixed f, the norm f p is continuous in p. Accordingly, for p=, one may take the limit of f p as p. However, this turns out to be the same as the essential supremum norm f . Therefore, L (Ω) makes sense as long as Ω is a measurable space equipped with a family of null sets (or full sets); the measure μ is otherwise irrelevant.

For 0<p<1, we can define the L p space using the same formula; however, it is no longer a Banach space (but still an F-space?). For p=0, we can again take the limit, or equivalently use the essential infimum; every measurable function on Ω belongs to L 0 (which is no longer even an F-space).

Minkowski’s inequality

We offer here a proof that f p defines a norm in the case 1<p<; the cases p=1 and p= follow by continuity and are easy to check from first principles. The most usual textbook proofs involve a clever application of Hölder's inequality?; the following proof is more straightforwardly geometric. All functions f may be assumed to be real- or complex-valued.

Theorem

Suppose 1p, and suppose Ω is a measure space with measure μ. Then the function () p:L p(Ω,μ) defined by

f p( Ωf pdμ) 1/p{\|f\|_p} \coloneqq (\int_\Omega {|f|^p} \,d\mu)^{1/p}

defines a norm.

One must verify three things:

  1. Separation axiom: f p=0 implies f=0.

  2. Scaling axiom: tf p=tf p.

  3. Triangle inequality: f+g pf p+g p.

The first two properties are obvious, so it remains to prove the last, which is also called Minkowski’s inequality.

Our proof of Minkowski’s inequality is broken down into a series of simple lemmas. The plan is to boil it down to two things: the scaling axiom, and convexity of the function xx p (as a function from real or complex numbers to nonnegative real numbers).

First, some generalities. Let V be a (real or complex) vector space equipped with a function ():V[0,] that satisfies the scaling axiom: tv=tv for all scalars t, and the separation axiom: v=0 implies v=0. As usual, we define the unit ball? in V to be {vVv1}.

Lemma

Given that the scaling and separation axioms hold, the following conditions are equivalent:

  1. The triangle inequality is satisfied.
  2. The unit ball is convex.
  3. If u=v=1, then tu+(1t)v1 for all t[0,1].
Proof

Condition 1. implies condition 2. easily: if u and v are in the unit ball and 0t1, we have

tu+(1t)v tu+(1t)v = tu+(1t)v t+(1t)=1.\array{ {\|t u + (1-t)v\|} & \leq & {\|t u\|} + {\|(1-t)v\|} \\ & = & t {\|u\|} + (1-t) {\|v\|} \\ & \leq & t + (1-t) = 1.}

Now 2. implies 3. trivially, so it remains to prove that 3. implies 1. Suppose v,v(0,). Let u=vv and u=vv be the associated unit vectors. Then

v+vv+v = (vv+v)vv+(vv+v)vv = tu+(1t)u\array{ \frac{v + v'}{{\|v\|}+{\|v'\|}} & = & (\frac{{\|v\|}}{{\|v\|}+{\|v'\|}})\frac{v}{{\|v\|}} + (\frac{{\|v'\|}}{{\|v\|}+{\|v'\|}})\frac{v'}{{\|v'\|}} \\ & = & t u + (1-t)u'}

where t=vv+v. If condition 3. holds, then

tu+(1t)u1{\|t u + (1-t)u'\|} \leq 1

but by the scaling axiom, this is the same as saying

v+vv+v1,\frac{{\|v + v'\|}}{{\|v\|} + {\|v'\|}} \leq 1,

which is the triangle inequality.

Consider now L p with its p-norm f=f p. By Lemma 1, this inequality is equivalent to

  • Condition 4: If u p p=1 and v p p=1, then tu+(1t)v p p1 whenever 0t1.

This allows us to remove the cumbersome exponent 1/p in the definition of the p-norm.

The next two lemmas may be proven by elementary calculus; we omit the proofs. (But you can also see the full details.)

Lemma

Let α,β be two complex numbers, and define

γ(t)=α+βt p\gamma(t) = {|\alpha + \beta t|^p}

for real t. Then γ(t) is nonnegative.

Lemma

Define ϕ: by ϕ(x)=x p. Then ϕ is convex, i.e., for all x,y,

tx+(1t)y ptx p+(1t)y p{|t x + (1-t)y|^p} \leq t{|x|^p} + (1-t){|y|^p}

for all t[0,1].

Proof of Minkowski’s inequality

Let u and v be unit vectors in L p. By condition 4, it suffices to show that tu+(1t)v p1 for all t[0,1]. But

Ωtu+(1t)v pdμ Ωtu p+(1t)v pdμ\int_\Omega {|t u + (1-t)v|^p} \,d\mu \leq \int_\Omega t{|u|}^p + (1-t){|v|}^p \,d\mu

by Lemma 3. Using u p=1=v p, we are done.

References

  • W. Rudin, Functional analysis, McGraw Hill 1991.

  • L. C. Evans, Partial differential equations, Amer. Math. Soc. 1998.

  • Wikipedia (English): Lp space

category: analysis

Revised on April 1, 2013 20:34:08 by Urs Schreiber (82.113.121.112)