Partial Differential Equations/Fundamental solutions, Green's functions and Green's kernels

From testwiki
Jump to navigation Jump to search

Template:Navigation

In the last two chapters, we have studied test function spaces and distributions. In this chapter we will demonstrate a method to obtain solutions to linear partial differential equations which uses test function spaces and distributions.

Distributional and fundamental solutions

In the last chapter, we had defined multiplication of a distribution with a smooth function and derivatives of distributions. Therefore, for a distribution 𝒯, we are able to calculate such expressions as

aα𝒯

for a smooth function a:ℝdℝ and a d-dimensional multiindex αβ„•0d. We therefore observe that in a linear partial differential equation of the form

xO:αβ„•0daα(x)αu(x)=f(x)

we could insert any distribution 𝒯 instead of u in the left hand side. However, equality would not hold in this case, because on the right hand side we have a function, but the left hand side would give us a distribution (as finite sums of distributions are distributions again due to exercise 4.1; remember that only finitely many aα are allowed to be nonzero, see definition 1.2). If we however replace the right hand side by 𝒯f (the regular distribution corresponding to f), then there might be distributions 𝒯 which satisfy the equation. In this case, we speak of a distributional solution. Let's summarise this definition in a box.

Template:TextBox

Template:TextBox

For the definition of δx see exercise 4.5.

Template:TextBox

Proof:

Let Cℝd be the support of f. For φπ’Ÿ(O), let us denote the supremum norm of the function Cℝ,x𝒯x(φ) by

𝒯(φ).

For fL1=0 or 𝒯(φ)=0, 𝒯 is identically zero and hence a distribution. Hence, we only need to treat the case where both fL10 and 𝒯(φ)0.

For each nβ„•, Bn(0) is a compact set since it is bounded and closed. Therefore, we may cover Bn(0)S by finitely many pairwise disjoint sets Qn,1,,Qn,kn with diameter at most 1/n (for convenience, we choose these sets to be subsets of Bn(0)S). Furthermore, we choose xn,1Qn,1,,xn,knQn,kn.

For each nβ„•, we define

𝒯n(φ):=j=1knQn,jf(x)𝒯xn,j(φ)dx

, which is a finite linear combination of distributions and therefore a distribution (see exercise 4.1).

Let now ϑπ’Ÿ(O) and ϵ>0 be arbitrary. We choose N1β„• such that for all nN1

xBRn(0)S:yB1/n(x)|𝒯x(φ)𝒯y(φ)|<ϵ2fL1.

This we may do because continuous functions are uniformly continuous on compact sets. Further, we choose N2β„• such that

SBn(0)|f(x)|dx<ϵ2𝒯(φ).

This we may do due to dominated convergence. Since for nN:=max{N1,N2}

|𝒯n(φ)𝒯(φ)|<j=1knQn,j|f(x)||𝒯λxn,j(φ)𝒯x(φ)|dx+ϵ𝒯(φ)2T(φ)<ϵ,

φπ’Ÿ(O):𝒯l(φ)𝒯(φ). Thus, the claim follows from theorem AI.33.

Template:TextBox

Proof: Since by the definition of fundamental solutions the function xF(x)(φ) is continuous for all φπ’Ÿ(O), lemma 5.3 implies that 𝒯 is a distribution.

Further, by definitions 4.16,

αβ„•0daαα𝒯(φ)=𝒯(αβ„•0dα(aαφ))=ℝdf(x)F(x)(αβ„•0dα(aαφ))dx=ℝdf(x)αβ„•0daααF(x)(φ)dx=ℝdf(x)δx(φ)dx=ℝdf(x)φ(x)dx=𝒯f(φ).

Lemma 5.5:

Let φπ’Ÿ(ℝd), fπ’ž(ℝd), αβ„•0d and π’―π’Ÿ(ℝd)*. Then

fα(𝒯*φ)=(fα𝒯)*φ.

Proof:

By theorem 4.21 2., for all xℝd

fα(𝒯*φ)(x)=f𝒯*(αφ)(x)=f𝒯((αφ)(x))=f𝒯((1)|α|α(φ(x)))=f(α𝒯)(φ(x))=(α𝒯)(fφ(x))=(fα𝒯)(φ(x))=(fα𝒯)*φ(x).

Template:TextBox

Proof:

By lemma 5.5, we have

αβ„•0daααu(x)=αβ„•0daαα(𝒯*ϑ)(x)=αβ„•0daα(α𝒯)*ϑ(x)=αβ„•0daαα𝒯(ϑ(x))=δ0(ϑ(x))=ϑ(x).

Partitions of unity

In this section you will get to know a very important tool in mathematics, namely partitions of unity. We will use it in this chapter and also later in the book. In order to prove the existence of partitions of unity (we will soon define what this is), we need a few definitions first.

Template:TextBox

We also need definition 3.13 in the proof, which is why we restate it now:

Template:TextBox

Template:TextBox

Proof: We will prove this by explicitly constructing such a sequence of functions.

1. First, we construct a sequence of open balls (Bl)lβ„• with the properties

  • nβ„•:υΥ:BnUυ
  • xO:|{nβ„•|xBn}|<
  • jβ„•Bj=O.

In order to do this, we first start with the definition of a sequence compact sets; for each nβ„•, we define

Kn:={xO|dist(O,x)1n,xn}.

This sequence has the properties

  • jβ„•Kj=O
  • nβ„•:KnKn+1.

We now construct (Bl)lβ„• such that

  • K11jk1BjK2 and
  • nβ„•:Kn+1Knkn<jkn+1BjKn+2Kn1

for some k1,k2,β„•. We do this in the following way: To meet the first condition, we first cover K1 with balls by choosing for every xK1 a ball Bx such that BxUυK2 for an υΥ. Since these balls cover K1, and K1 is compact, we may choose a finite subcover B1,Bk1.

To meet the second condition, we proceed analogously, noting that for all nβ„•2 Kn+1Kn is compact and Kn+2Kn1 is open.

This sequence of open balls has the properties which we wished for.

2. We choose the respective functions. Since each Bn, nβ„• is an open ball, it has the form

Bn=BRn(xn)

where Rnℝ and xnℝd.

It is easy to prove that the function defined by

η~n(x):=ηRn(xxn)

satisfies η~n(x)=0 if and only if xBn. Hence, also supp η~n=Bn. We define

η(x):=j=1η~j(x)

and, for each nβ„•,

ηn:=η~nη.

Then, since η is never zero, the sequence (ηl)lβ„• is a sequence of π’Ÿ(ℝd) functions and further, it has the properties 1. - 4., as can be easily checked.

Green's functions and Green's kernels

Template:TextBox

Template:TextBox

Template:TextBox

Proof:

We choose (ηl)lβ„• to be a partition of unity of O, where the open cover of O shall consist only of the set O. Then by definition of partitions of unity

f=jβ„•ηjf.

For each nβ„•, we define

fn:=ηnf

and

un:=fn*K.

By Fubini's theorem, for all φπ’Ÿ(ℝd) and nβ„•

ℝdTK(y)(φ)fn(y)dy=ℝdℝdK(xy)φ(x)dxfn(y)dy=ℝdℝdfn(y)K(xy)φ(x)dydx=ℝd(fn*K)(x)φ(x)dx=𝒯un(φ).

Hence, 𝒯un as given in theorem 4.11 is a well-defined distribution.

Theorem 5.4 implies that 𝒯un is a distributional solution to the PDE

xO:αβ„•0daα(x)αun(x)=fn(x).

Thus, for all φπ’Ÿ(ℝd) we have, using theorem 4.19,

ℝd(αβ„•0daααun)(x)φ(x)dx=𝒯αβ„•0daααun(φ)=αβ„•0daαα𝒯un(φ)=Tfn(φ)=ℝdfn(x)φ(x)dx.

Since αβ„•0daααun and fn are both continuous, they must be equal due to theorem 3.17. Summing both sides of the equation over n yields the theorem.

Template:TextBox

Proof:

If xlx,l, then

𝒯K(xl)(φ)𝒯K(x)(φ)=ℝdK(yxl)φ(y)dyℝdK(yx)ϕ(y)dy=ℝdK(y)(φ(y+xl)φ(y+x))dymaxyℝd|φ(y+xl)φ(y+x)|supp φ+B1(x)K(y)dyconstant

for sufficiently large l, where the maximum in the last expression converges to 0 as l, since the support of φ is compact and therefore φ is uniformly continuous by the Heine–Cantor theorem.

The last theorem shows that if we have found a locally integrable function K such that

xℝd:αβ„•0daαα𝒯K(x)=δx,

we have found a Green's kernel K for the respective PDEs. We will rely on this theorem in our procedure to get solutions to the heat equation and Poisson's equation.

Exercises

Sources

Template:Navigation