To apply functional analytic techniques to PDE problems, we need an appropriate Hilbert space of functions. The right notion is that of a Sobolev space.
Definition
Let U⊆Rn be an open set, s∈R (possibly negative) and f,g∈Cc∞(U). We define
We define Hs(U) to be the Hilbert space completion of Cc∞(U) under ∥⋅∥s.
If no confusion arises, we will omit the (U) in Hs(U).
This space is actually usually called H0s(U) instead, with Hs(U) reserved for the same definition but without the compactly supported requirement. We will only need the compactly supported version, and will not write the 0.
Basic properties of Fourier transforms imply that for s∈Z>0, we have the following more intuitive definition:
Lemma
If s is a non-negative integer, and f∈Cc∞(U), then ∥⋅∥s is equivalent to the norm
∥f∥s′=∣α∣≤s∑∥Dαf∥L2.
Lemma
For any s, Dα extends to a continuous map Hs→Hs−∣α∣.
A priori, the above definition does not let us think of elements of Hs as genuine functions. Thankfully, we have the following result:
Lemma
The natural map Cc∞(U)↪L2 induces an isomorphism H0≅L2.
If s≥t and f∈Cc∞, then ∥f∥t≤∥f∥s. Hence there is a continuous map Hs→Ht.
The map is injective.
Proof
□
Only (3) requires proof. We have to show that if fn∈Cc∞ is ∥⋅∥s-Cauchy and ∥fn∥t→0, then ∥fn∥s→0. By assumption, we know f^n2(1+∣ξ∣2)t→0 in L1. So it converges to 0 almost everywhere. So f^n2(1+∣ξ∣2)s→0 almost everywhere. But we know it is Cauchy in L1. So it converges to 0 in L1.
Proof
□
This lets us view the Hs as nested subspaces of L2. In fact, we get something better.
Theorem(Sobolev embedding theorem)
Let k an integer such that s>k+2n. Then there exists a constant A such that for any u∈C∞(U), we have
∥u∥Ck≤A∥u∥s.
Thus, there is a continuous inclusion Hs↪Ck.
Proof
□
Let ∣α∣=ℓ<k. For x∈U and u∈Cc∞(U), we have
∣Dαu(x)∣∝∣∣∫eixξξαu^(ξ)dξ∣∣≤∫∣ξα∣∣u^(ξ)∣dξ≤∫∣ξ∣ℓ∣u^(ξ)∣dξ≤(∫∣ξ∣2(1+∣ξ∣2)−sdξ)1/2(∫∣u^(ξ)∣2(1+∣ξ∣2)sdξ)1/2.
The second term is exactly ∥u∥s, and the first term is a constant, which by elementary calculus, is finite iff s>ℓ+2n.
Proof
□
Admittedly, the proof above does not make much sense. The following more direct proof of a special case shows why we should expect a result along these lines to be true:
Proof
□
[Proof of special case] We consider the case r=1, U=(0,1) and k=0. Then we want to show that
∥u∥C0≤A∥u∥1
for some constant A. In other words, if u∈H1, we want to be able to make sense of u as a continuous function. The trick is to notice we can make sense of dxdu as an L2 function, and hence we can write
u(t)=∫0tdxdudx+C
for some integration constant C. This can be determined by
C=∫01u(x)dx−∫01∫0tdxdudxdt.
This lets us control supu in terms of integrals of u and dxdu.
Proof
□
One can in fact come up with a similar proof as long as s is an integer.
Another crucial theorem is the following:
Theorem(Rellich compactness theorem)
If U⊆Rn is precompact and s>t, then the natural map Hs→Ht is compact.
Proof
□
Let uk∈Cc∞(U) be such that ∥uk∥s≤1. We have to produce a subsequence that converges in Ht. The key claim is
Claim
u^k that equicontinuous and uniformly bounded on compact sets.
Assuming this claim, Arzelá–Ascoli implies there is a subsequence of u^k that is uniformly convergent on compact subsets. Thus, we write
∥uk−uℓ∥t2=(∫∣ξ∣≤R+∫∣ξ∣>R)∣u^k−u^ℓ∣2(1+∣ξ∣2)tdξ.
For any fixed R, the first term vanishes in the limit k,ℓ→∞ by uniform convergence. For the second term, we bound
by Cauchy–Schwarz. Since a^ is a Schwarz function, the first factor is finite and depends continuously on ξ. So u^k is uniformly bounded on compact subsets. Equicontinuity follows from similar bounds on Dju^k=(Dja^)∗u^k.
Proof
□
If we are lazy, we will often restrict to the case where s∈Z. If further s≥0, then the definition of the Sobolev norm in terms of derivatives can be very useful. For s<0, we will exploit the following duality:
Lemma
The pairing
Cc∞×Cc∞(f,g)→C↦∫f(x)g(x)dx.
satisfies
∣(f,g)∣≤∥f∥s∥g∥−s.
Thus, it extends to a map Hs×H−s→C. Moreover,
∥f∥s=g=0sup∥g∥−s∣(f,g)∣.(†)
Thus, this pairing exhibits Hs and H−s as duals of each other.
Note that this duality pairing is “canonical”, and doesn't really depend on the Hilbert space structure on Hs (while the canonical isomorphism between Hs and (Hs)∗ does). Later, we will see that in the global case, the Hilbert space structure is not quite canonical, but the duality pairing here will still be canonical.
Proof
□
The first inequality follows from Plancherel and Cauchy–Schwarz
(f,g)=(f^,g^)=∫f^(ξ)(1+∣ξ∣2)s/2g^(ξ)(1+∣ξ∣2)−s/2dξ.
To show (†), one direction of the inequality is clear. For the other, if f∈C∞, take g^=f^(1+∣ξ∣2)s. For general f, approximate.
Proof
□
A sample application of this is to show that differential operators induce maps between Sobolev spaces. We already said that Dα tautologically induces a map Hs→Hs−∣α∣. In a general differential operator, we differentiate, then multiply by a smooth function. Thus, we want to show that multiplication by a smooth function is a bounded linear operator. This is easy to show for s∈Z≥0, and duality implies the result for negative s∈Z.
Lemma
Let s∈Z, a∈Cc∞(R) and u∈Hs(U). Then
∥au∥s≤C∥a∥C∣s∣∥u∥s.
for some constant C independent of a. Thus, if L is a differential operator of compact support of order k, then it extends to a map L:Hs+k→Hs.
Proof
□
We only have to check this for u∈Cc∞(U). For s≥0, this is straightforward, since ∥au∥s2 is a sum of terms of the form ∥Dα(au)∥02 for ∣α∣≤k, and the product rule together with the bound ∥au∥0≤∥a∥C0∥u∥0 implies the result.
When proving elliptic regularity, we will need a slight refinement of the above result.
Lemma
Let s∈Z, a∈Cc∞(R) and u∈Hs(U). Then
∥au∥s≤∥a∥C0∥u∥s+C∥a∥C∣s∣+1∥u∥s−1
for some constant C independent of a.
Proof
□
Again the case s>0 is straightforward. If we look at a term ∥Dα(au)∥0, the terms in the product rule where ∣α∣=k and the derivatives all hit u contribute to the firs term, and the remainder go into the second.
For s<0, we proceed by downward induction on s, using the isometry Hs+2→Hs given by extending 1+Δ. This is an isomorphism, because in the Fourier world, this is just multiplication by (1+∣ξ∣2). Thus, we check the claim for u of the form Lv. We have