Test functions, distributions, and Sobolev’s lemma

Jordan Bell
May 22, 2014

1 Introduction

If X is a topological vector space, we denote by X* the set of continuous linear functionals on X. With the weak-* topology, X* is a locally convex space, whether or not X is a locally convex space. (But in this note, we only talk about locally convex spaces.)

The purpose of this note is to collect the material given in Walter Rudin, Functional Analysis, second ed., chapters 6 and 7, involved in stating and proving Sobolev’s lemma.

2 Test functions

Suppose that Ω is an open subset of ℝn. We denote by 𝒟⁢(Ω) the set of all ϕ∈C∞⁢(Ω) such that supp⁢ϕ is a compact subset of Ω. Elements of 𝒟⁢(Ω) are called test functions. For N=0,1,… and ϕ∈𝒟⁢(Ω), write

∥ϕ∥N=sup{|(Dαϕ)(x)|:x∈Ω,|α|≤N},

where

Dα=D1α1⁢⋯⁢Dnαn,|α|=α1+⋯+αn.

For each compact subset K of Ω, we define

𝒟K={ϕ∈𝒟⁢(Ω):supp⁢ϕ⊆K},

and define τK to be the locally convex topology on 𝒟K determined by the family of seminorms {∥⋅∥N:N≥0}. One proves that 𝒟K with the topology τK is a Fréchet space. As sets,

𝒟⁢(Ω)=⋃K𝒟K.

Define β to be the collection of all convex balanced subsets W of 𝒟⁢(Ω) such that for every compact subset K of Ω we have W∩𝒟K∈τK; to say that W is balanced means that if c is a complex number with |c|≤1 then c⁢W⊆W. One proves that {ϕ+W:ϕ∈𝒟⁢(Ω),W∈β} is a basis for a topology τ on 𝒟⁢(Ω), that β is a local basis at 0 for this topology, and that with the topology τ, 𝒟⁢(Ω) is a locally convex space.11 1 Walter Rudin, Functional Analysis, second ed., p. 152, Theorem 6.4; cf. Helmut H. Schaefer, Topological Vector Spaces, p. 57. For each compact subset K of Ω, one proves that the topology τK is equal to the subspace topology on 𝒟K inherited from 𝒟⁢(Ω).22 2 Walter Rudin, Functional Analysis, second ed., p. 153, Theorem 6.5.

We write 𝒟′⁢(Ω)=(𝒟⁢(Ω))*, and elements of 𝒟′⁢(Ω) are called distributions. With the weak-* topology, 𝒟′⁢(Ω) is a locally convex space.

It is a fact that a linear functional Λ on 𝒟⁢(Ω) is continuous if and only if for every compact subset K of Ω there is a nonnegative integer N and a constant C such that |Λ⁢ϕ|≤C⁢∥ϕ∥N for all ϕ∈𝒟K.33 3 Walter Rudin, Functional Analysis, second ed., p. 156, Theorem 6.8.

For Λ∈𝒟′⁢(Ω) and α a multi-index, we define

(Dα⁢Λ)⁢(ϕ)=(-1)|α|⁢Λ⁢(Dα⁢ϕ),ϕ∈𝒟⁢(Ω).

Let K be a compact subset of Ω. As Λ is continuous, there is a nonnegative integer N and a constant C such that |Λ⁢ϕ|≤C⁢∥ϕ∥N for all ϕ∈𝒟K. Then

|(Dα⁢Λ)⁢(ϕ)|=|Λ⁢(Dα⁢ϕ)|≤C⁢∥Dα⁢ϕ∥N≤C⁢∥ϕ∥N+|α|,

which shows that Dα⁢Λ∈𝒟′⁢(Ω).

The Leibniz formula is the statement that for all f,g∈C∞⁢(ℝn),

Dα⁢(f⁢g)=∑β≤α(αβ)⁢(Dα-β⁢f)⁢(Dβ⁢g),

where (αβ) are multinomial coefficients.

For Λ∈𝒟′⁢(Ω) and f∈C∞⁢(Ω), we define

(f⁢Λ)⁢(ϕ)=Λ⁢(f⁢ϕ),ϕ∈𝒟⁢(Ω);

this makes sense because f⁢ϕ∈𝒟⁢(Ω) when ϕ∈𝒟⁢(Ω). It is apparent that f⁢Λ is linear, and in the following lemma we prove that f⁢Λ is continuous.44 4 Walter Rudin, Functional Analysis, second ed., p. 159, §6.15.

Lemma 1.

If Λ∈D′⁢(Ω) and f∈C∞⁢(Ω), then f⁢Λ∈D′⁢(Ω).

Proof.

Suppose that K is a compact subset of Ω. Because Λ is continuous, there is some nonnegative integer N and some constant C such that

|Λ⁢ϕ|≤C⁢∥ϕ∥N,ϕ∈𝒟K.

For |α|≤N, by the Leibniz formula, for all ϕ∈𝒟K,

Dα⁢(f⁢ϕ)=∑β≤α(αβ)⁢(Dα-β⁢f)⁢(Dβ⁢ϕ).

Because f∈C∞⁢(Ω), there is some Cα such that |(Dα-β⁢f)⁢(x)|≤Cα for β≤α and for x∈K. Using ϕ⁢(x)=0 for x∉K, the above statement of the Leibniz formula, and the inequality just obtained, it follows that there is some Cα′ such that |(Dα⁢(f⁢ϕ))⁢(x)|≤Cα′⁢∥ϕ∥N for all x∈Ω. This gives

∥f⁢ϕ∥N=sup|α|≤N⁡supx∈Ω⁡|(Dα⁢(f⁢ϕ))⁢(x)|≤sup|α|≤N⁡Cα′⁢∥ϕ∥N=C′⁢∥ϕ∥N;

the last equality is how we define C′, which is a maximum of finitely many Cα′ and so finite. Then,

|(f⁢Λ)⁢(ϕ)|=|Λ⁢(f⁢ϕ)|≤C⁢∥f⁢ϕ∥N≤C⁢C′⁢∥ϕ∥N,ϕ∈𝒟K.

This bound shows that f⁢Λ is continuous. ∎

The above lemma shows that f⁢Λ∈𝒟′⁢(Ω) when f∈C∞⁢(Ω) and Λ∈𝒟′⁢(Ω). Therefore Dα⁢(f⁢Λ)∈𝒟⁢(Ω), and the following lemma, proved in Rudin, states that the Leibniz formula can be used with f⁢Λ.55 5 Walter Rudin, Functional Analysis, second ed., p. 160, §6.15.

Lemma 2.

If f∈C∞⁢(Ω) and Λ∈D′⁢(Ω), then

Dα⁢(f⁢Λ)=∑β≤α(αβ)⁢(Dα-β⁢f)⁢(Dβ⁢Λ).

If f:Ω→ℂ is locally integrable, define

Λ⁢ϕ=∫Ωϕ⁢(x)⁢f⁢(x)⁢𝑑x,ϕ∈𝒟⁢(Ω).

For ϕ∈𝒟K,

|Λ⁢ϕ|≤∥ϕ∥0⁢∫K|f|⁢𝑑x,

from which it follows that Λ is continuous. If μ is a complex Borel measure on ℝn or a positive Borel measure on ℝn that assigns finite measure to compact sets, define

Λ⁢ϕ=∫Ωϕ⁢𝑑μ,ϕ∈𝒟⁢(Ω).

For ϕ∈𝒟K,

|Λ⁢ϕ|≤∥ϕ∥0⁢|μ|⁢(K),

from which it follows that Λ is continuous. Thus, we can encode certain functions and measures as distributions. I will dare to say that we can encode most functions and measures that we care about as distributions.

If Λ1,Λ2∈𝒟′⁢(Ω) and ω is an open subset of Ω, we say that Λ1=Λ2 in ω if Λ1⁢ϕ=Λ2⁢ϕ for all ϕ∈𝒟⁢(ω).

Let Λ∈𝒟′⁢(Ω) and let ω be an open subset of Ω. We say that Λ vanishes on ω if Λ⁢ϕ=0 for all ϕ∈𝒟⁢(ω). Taking W to be the union of all open subsets ω of Ω on which Λ vanishes, we define the support of Λ to be the set Ω∖W.

3 The Fourier transform

Let C0⁢(ℝn) be the set of those continuous functions f:ℝn→ℂ such that for every ϵ>0, there is some compact set K such that |f⁢(x)|<ϵ for x∉K. With the supremum norm ∥⋅∥∞, C0⁢(ℝn) is a Banach space.

Let mn be normalized Lebesgue measure on Rn:

d⁢mn⁢(x)=(2⁢π)-n/2⁢d⁢x.

Using mn, we define

∥f∥Lp=(∫ℝn|f|p⁢𝑑mn)1/p,1≤p<∞

and

(f*g)⁢(x)=∫ℝnf⁢(x-y)⁢g⁢(y)⁢𝑑mn⁢(y).

For t∈ℝn, define et:ℝn→ℂ by

et⁢(x)=exp⁡(i⁢t⋅x),x∈ℝn.

The Fourier transform of f∈L1⁢(ℝn) is the function f^:ℝn→ℂ defined by

(ℱ⁢f)⁢(t)=f^⁢(t)=∫ℝnf⁢e-t⁢𝑑mn,t∈ℝn.

Using the dominated convergence theorem, one shows that f^ is continuous.

For f∈C∞⁢(ℝn) and N a nonnegative integer, write

pN⁢(f)=sup|α|≤N⁡supx∈ℝn⁡(1+|x|2)N⁢|(Dα⁢f)⁢(x)|,

and let 𝒮n be the set of those f∈C∞⁢(ℝn) such that for every nonnegative integer N, pN⁢(f)<∞. 𝒮n is a vector space, and with the locally convex topology determined by the family of seminorms {pN:N≥0} it is a Fréchet space.66 6 Walter Rudin, Functional Analysis, second ed., p. 184, Theorem 7.4. Further, one proves that ℱ:𝒮n→𝒮n is a continuous linear map.77 7 Walter Rudin, Functional Analysis, second ed., p. 184, Theorem 7.4.

The Riemann-Lebesgue lemma is the statement that if f∈L1⁢(ℝn), then f^∈C0⁢(ℝn).88 8 Walter Rudin, Functional Analysis, second ed., p. 185, Theorem 7.5.

The inversion theorem99 9 Walter Rudin, Functional Analysis, second ed., p. 186, Theorem 7.7. is the statement that if g∈𝒮n then

g⁢(x)=∫ℝng^⁢ex⁢𝑑mn,x∈ℝn,

and that if f∈L1⁢(ℝn) and f^∈L1⁢(ℝn), and we define f0∈C0⁢(ℝn) by

f0⁢(x)=∫ℝnf^⁢ex⁢𝑑mn,x∈ℝn,

then f⁢(x)=f0⁢(x) for almost all x∈ℝn. For g∈𝒮n, as g^∈𝒮n, the function f⁢(t)=g^⁢(-t) belongs to 𝒮n. The inversion theorem tells us that for all x∈ℝn,

g⁢(x)=∫ℝng^⁢(t)⁢ex⁢(t)⁢𝑑mn⁢(t)=∫ℝng^⁢(-t)⁢ex⁢(-t)⁢𝑑mn⁢(t)=∫ℝnf⁢(t)⁢e-x⁢(t)⁢𝑑mn⁢(t),

and hence that g=f^. This shows that ℱ:𝒮n→𝒮n is onto. Using the inversion theorem, one checks that

∫ℝnf⁢g¯⁢𝑑mn=∫ℝnf^⁢g^¯⁢𝑑mn,f,g∈𝒮n,

and so ∥f∥L2=∥ℱ⁢f∥L2 for f∈𝒮n. It is a fact that 𝒮n is a dense subset of the Hilbert space L2⁢(ℝn), and it follows that there is a unique bounded linear operator L2⁢(ℝn)→L2⁢(ℝn), that is equal to ℱ on 𝒮n, and that is unitary. We denote this ℱ:L2⁢(ℝn)→L2⁢(ℝn).

It is a fact that 𝒟⁢(ℝn) is a dense subset of 𝒮n and that the identity map i:𝒟⁢(ℝn)→𝒮n is continuous.1010 10 Walter Rudin, Functional Analysis, second ed., p. 189, Theorem 7.10. If L1,L2∈(𝒮n)* are distinct, then there is some f∈𝒮n such that L1⁢f≠L2⁢f, and as 𝒟⁢(ℝn) is dense in 𝒮n, there is a sequence fj∈𝒟⁢(ℝn) with fj→f in 𝒮n. As

(L1∘i)⁢(fj)-(L2∘i)⁢(fj)=L1⁢fj-L2⁢fj→L1⁢fj-L2⁢fj≠0,

there is some fj with (L1∘i)⁢(fj)≠(L2∘i)⁢(fj), and hence L1∘i≠L2∘i. This shows that L↦L∘i is a one-to-one linear map (𝒮n)*→𝒟′⁢(ℝn). Elements of 𝒟′⁢(ℝn) of the form L∘i for L∈(𝒮n)* are called tempered distributions, and we denote the set of tempered distributions by 𝒮n′. It is a fact that every distribution with compact support is tempered.1111 11 Walter Rudin, Functional Analysis, second ed., p. 190, Example 7.12 (a).

4 Sobolev’s lemma

Suppose that Ω is an open subset of ℝn. We say that a measurable function f:Ω→ℂ is locally L2 if ∫K|f|2⁢𝑑mn<∞ for every compact subset K of Ω. We say that Λ∈𝒟′⁢(Ω) is locally L2 if there is a function g that is locally L2 in Ω such that Λ⁢ϕ=∫Ωϕ⁢g⁢𝑑mn for every ϕ∈𝒟⁢(Ω).

The following proof of Sobolev’s lemma follows Rudin.1212 12 Walter Rudin, Functional Analysis, second ed., p. 202, Theorem 7.25.

Theorem 3 (Sobolev’s lemma).

Suppose that n,p,r are integers, n>0, p≥0, and

r>p+n2.

Suppose that Ω is an open subset of Rn, that f:Ω→C is locally L2, and that the distribution derivatives Djk⁢f are locally L2 for 1≤j≤n, 1≤k≤r. Then there is some f0∈Cp⁢(Ω) such that f0⁢(x)=f⁢(x) for almost all x∈Ω.

Proof.

To say that the distribution derivative Djk⁢f is locally L2 means that there is some gj,k:Ω→ℂ that is locally L2 such that

Djk⁢Λf=Λgj,k.

Suppose that ω is an open subset of Ω whose closure K is a compact subset of Ω. There is some ψ∈𝒟⁢(Ω) with ψ⁢(x)=1 for x∈K, and we define F:ℝn→ℂ by

F⁢(x)={ψ⁢(x)⁢f⁢(x)x∈Ω,0x∉Ω;

in particular, for x∈K we have F⁢(x)=f⁢(x), and for x∉supp⁢ψ we have F⁢(x)=0. Because supp⁢ψ⊂Ω is compact and f is locally L2,

∥F∥L2=(∫supp⁢ψ|ψ⁢f|2⁢𝑑mn)1/2≤∥ψ∥0⁢(∫supp⁢ψ|f|2⁢𝑑mn)1/2<∞,

and using the Cauchy-Schwarz inequality, ∥F∥L1≤∥F∥L2⁢mn⁢(supp⁢ψ)1/2<∞, so

F∈L2⁢(ℝn)∩L1⁢(ℝn).

Then,

∫ℝn|F^|2⁢𝑑mn<∞. (1)

Because ΛF=ψ⁢Λf in Ω, the Leibniz formula tells us that in Ω,

Djr⁢ΛF=Djr⁢(ψ⁢Λf)=∑s=0r(rs)⁢(Djr-s⁢ψ)⁢(Djs⁢Λf)=∑s=0r(rs)⁢(Djr-s⁢ψ)⁢(Λgj,s),

hence, defining Hj:ℝn→ℂ by

Hj⁢(x)={∑s=0r(rs)⁢(Djr-s⁢ψ)⁢(x)⁢gj,s⁢(x)x∈Ω,0x∉Ω,

we have Djr⁢ΛF=ΛHj in Ω. It is apparent that Hj∈L2⁢(ℝn)∩L1⁢(ℝn).

Let ϕ∈𝒟⁢(ℝn). There are ϕ1,ϕ2∈𝒟⁢(ℝn) with ϕ=ϕ1+ϕ2 and supp⁢ϕ1⊂Ω, supp⁢ϕ2⊂ℝn∖supp⁢ψ.1313 13 ϕ1 and ϕ2 are constructed using a partition of unity. See Walter Rudin, Functional Analysis, second ed., p. 162, Theorem 6.20. We have just established that (Djr⁢ΛF)⁢ϕ1=ΛHj⁢ϕ1. For ϕ2, it is apparent that

(Djr⁢ΛF)⁢ϕ2=ΛF⁢(Djr⁢ϕ2)=∫ℝn(Djr⁢ϕ2)⁢(x)⁢F⁢(x)⁢𝑑mn⁢(x)=0

and

ΛHj⁢ϕ2=∫ℝnϕ2⁢(x)⁢Hj⁢(x)⁢𝑑mn⁢(x)=0.

Hence (Djr⁢ΛF)⁢(ϕ)=ΛHj⁢ϕ. It is apparent that ΛHj has compact support, so Djr⁢ΛF=ΛHj are tempered distributions. Let ξ∈𝒮n, and take ϕ∈𝒮n with ξ=ϕ^. Then,

(Djr⁢ΛF)⁢ϕ = ΛF⁢Djr⁢ϕ
= ∫ℝn(Djr⁢ϕ)⁢(x)⁢F⁢(x)⁢𝑑mn⁢(x)
= ∫ℝnℱ⁢(Djr⁢ϕ)⁢(y)⁢F^⁢(y)⁢𝑑mn⁢(y)
= ∫ℝn(i⁢yj)r⁢ξ⁢(y)⁢F^⁢(y)⁢𝑑mn⁢(y),

and

ΛHj⁢ϕ=∫ℝnϕ⁢(x)⁢Hj⁢(x)⁢𝑑mn⁢(x)=∫ℝnξ⁢(y)⁢Hj^⁢(y)⁢𝑑mn⁢(y).

It follows that (i⁢yj)r⁢F^⁢(y)=Hj^⁢(y) for all y∈ℝn. But Hj^∈L2⁢(ℝn), so

∫ℝnyi2⁢r⁢|F^⁢(y)|2⁢𝑑mn⁢(y)<∞,1≤i≤n. (2)

Using (1), (2), and the inequality

(1+|y|)2⁢r<(2⁢n+2)r⁢(1+y12⁢r+⋯+yn2⁢r),y∈ℝn,

we get

J=∫ℝn(1+|y|)2⁢r⁢|F^⁢(y)|2⁢𝑑mn⁢(y)<∞.

Let σn-1 be surface measure on Sn-1, with σn-1⁢(Sn-1)=2⁢πn/2Γ⁢(n/2). Using the Cauchy-Schwarz inequality and the change of variable y=t⁢u, u∈Sn-1, t≥0,

(∫ℝn(1+|y|)p⁢|F^⁢(y)|⁢𝑑mn⁢(y))2 = (∫ℝn(1+|y|)r⁢|F^⁢(y)|⁢(1+|y|)p-r⁢𝑑mn⁢(y))2
≤ J⁢∫ℝn(1+|y|)2⁢p-2⁢r⁢𝑑mn⁢(y)
= J⁢(2⁢π)-n/2⁢∫0∞∫Sn-1(1+t)2⁢p-2⁢r⁢tn-1⁢𝑑σn-1⁢(u)⁢𝑑t
= 2⁢JΓ⁢(n/2)⁢∫0∞(1+t)2⁢p-2⁢r⁢tn-1⁢𝑑t.

This integral is finite if and only if 2⁢p-2⁢r+n-1<-1, and we have assumed that r>p+n2. Therefore,

∫ℝn(1+|y|)p⁢|F^⁢(y)|⁢𝑑mn⁢(y)<∞,

from which we get that yα⁢F^⁢(y) is in L1⁢(ℝn) for |α|≤p.

Define

Fω⁢(x)=∫ℝnF^⁢ex⁢𝑑mn,x∈ℝn.

(Note that F depends on ω.) F,F^∈L1⁢(ℝn) so by the inversion theorem we have F⁢(x)=Fω⁢(x) for almost all x∈ℝn. Fω∈C0⁢(ℝn). If p≥1, then we shall show that Fω∈Cp⁢(Ω). Take ek to be the standard basis for ℝn. For 1≤k1≤n and ϵ≠0,

Fω⁢(x+ϵ⁢ek1)-Fω⁢(x)ϵ = 1ϵ⁢∫ℝnF^⁢(y)⁢(exp⁡(i⁢ϵ⁢ek1⋅y)-1)⁢exp⁡(i⁢x⋅y)⁢𝑑mn⁢(y)
= ∫ℝni⁢yk1⁢F^⁢(y)⁢ei⁢ϵ⁢yk1-1i⁢ϵ⁢yk⁢ex⁢(y)⁢𝑑mn⁢(y).

But |i⁢yk1⁢F^⁢(y)⁢ei⁢ϵ⁢yk1-1i⁢ϵ⁢yk1⁢ex⁢(y)|≤|yk1⁢F^⁢(y)| and yk1⁢F^⁢(y) belongs to L1⁢(ℝn) (supposing p≥1) so we can apply the dominated convergence theorem, which gives us

(Dk1⁢Fω)⁢(x)=limϵ→0⁡Fω⁢(x+ϵ⁢ek1)-Fω⁢(x)ϵ=∫ℝni⁢yk1⁢F^⁢(y)⁢ex⁢(y)⁢𝑑mn⁢(y).

From the above expression, it is apparent that Dk1⁢Fω is continuous. This is true for all 1≤k1≤n, so Fω∈C1⁢(ℝn). If p≥2, then yk1⁢yk2⁢F^⁢(y) is in L1⁢(ℝn) for any 1≤k2≤n, and repeating the above argument we get Fω∈C2⁢(ℝn). In this way, Fω∈Cp⁢(ℝn).

For all x∈ω, f⁢(x)=F⁢(x), so f⁢(x)=Fω⁢(x) for almost all x∈ω. If ω′ is an open subset of Ω whose closure is a compact subset of Ω and ω∩ω′≠∅, then Fω,Fω′∈Cp⁢(ℝn) satisfy f⁢(x)=Fω⁢(x) for almost all x∈ω and f⁢(x)=Fω′⁢(x) for almost all x∈ω′, so Fω⁢(x)=Fω′⁢(x) for almost all x∈ω∩ω′. Since Fω,Fω′ are continuous, this implies that Fω⁢(x)=Fω′⁢(x) for all x∈ω∩ω′. Thus, it makes sense to define f0⁢(x)=Fω⁢(x) for x∈ω. Because every point in Ω has an open neighborhood of the kind ω and the restriction of f0 to each ω belongs to Cp⁢(ω), it follows that f0∈Cp⁢(Ω). ∎