Partial Differential Equations/Distributions

From testwiki
Revision as of 23:48, 3 April 2021 by imported>ShakespeareFan00 (Resolve misnesting)
(diff) โ† Older revision | Latest revision (diff) | Newer revision โ†’ (diff)
Jump to navigation Jump to search

Template:Navigation

Distributions and tempered distributions

Template:TextBox

Template:TextBox

Template:TextBox

Proof:

Let ๐’ฏ be a tempered distribution, and let Oโ„d be open.

1.

We show that ๐’ฏ(φ) has a well-defined value for φ๐’Ÿ(O).

Due to theorem 3.9, every bump function is a Schwartz function, which is why the expression

๐’ฏ(φ)

makes sense for every φ๐’Ÿ(O).

2.

We show that the restriction is linear.

Let a,bโ„ and φ,ϑ๐’Ÿ(O). Since due to theorem 3.9 φ and ϑ are Schwartz functions as well, we have

a,bโ„,φ,ϑ๐’Ÿ(O):๐’ฏ(aφ+bϑ)=a๐’ฏ(φ)+b๐’ฏ(ϑ)

due to the linearity of ๐’ฏ for all Schwartz functions. Thus ๐’ฏ is also linear for bump functions.

3.

We show that the restriction of ๐’ฏ to ๐’Ÿ(O) is sequentially continuous. Let φlφ in the notion of convergence of bump functions. Due to theorem 3.11, φlφ in the notion of convergence of Schwartz functions. Since ๐’ฏ as a tempered distribution is sequentially continuous, ๐’ฏ(φl)๐’ฏ(φ).

The convolution

Template:TextBox

The convolution of two functions may not always exist, but there are sufficient conditions for it to exist:

Theorem 4.5:

Let p,q[1,] such that 1p+1q=1 and let fLp(โ„d) and gLq(โ„d). Then for all yO, the integral

โ„df(x)g(yx)dx

has a well-defined real value.

Proof:

Due to Hรถlder's inequality,

โ„d|f(x)g(yx)|dx(โ„d|f(x)|pdx)1/p(โ„d|g(yx)|qdx)1/q<.

We shall now prove that the convolution is commutative, i. e. f*g=g*f.

Template:TextBox

Proof:

We apply multi-dimensional integration by substitution using the diffeomorphism xyx to obtain

(f*g)(y)=โ„df(x)g(yx)dx=โ„df(yx)g(x)dx=(g*f)(y).

Template:TextBox

Proof:

Let αโ„•0d be arbitrary. Then, since for all yโ„d

โ„d|f(x)αηδ(yx)|dxαηδโ„d|f(x)|dx

and further

|f(x)αηδ(yx)||f(x)|,

Leibniz' integral rule (theorem 2.2) is applicable, and by repeated application of Leibniz' integral rule we obtain

αf*ηδ=f*αηδ.

Regular distributions

In this section, we shortly study a class of distributions which we call regular distributions. In particular, we will see that for certain kinds of functions there exist corresponding distributions.

Template:TextBox

Template:TextBox

Two questions related to this definition could be asked: Given a function f:โ„dโ„, is ๐’ฏf:๐’Ÿ(O)โ„ for Oโ„d open given by

๐’ฏf(φ):=Of(x)φ(x)dx

well-defined and a distribution? Or is ๐’ฏf:๐’ฎ(โ„d)โ„ given by

๐’ฏf(ϕ):=โ„df(x)ϕ(x)dx

well-defined and a tempered distribution? In general, the answer to these two questions is no, but both questions can be answered with yes if the respective function f has the respectively right properties, as the following two theorems show. But before we state the first theorem, we have to define what local integrability means, because in the case of bump functions, local integrability will be exactly the property which f needs in order to define a corresponding regular distribution:

Template:TextBox

Now we are ready to give some sufficient conditions on f to define a corresponding regular distribution or regular tempered distribution by the way of

๐’ฏf:๐’Ÿ(O)โ„,๐’ฏf(φ):=Of(x)φ(x)dx

or

๐’ฏf:๐’ฎ(โ„d)โ„,๐’ฏf(ϕ):=โ„df(x)ϕ(x)dx:

Template:TextBox

Proof:

1.

We show that if fLloc1(O), then ๐’ฏf:๐’Ÿ(O)โ„ is a distribution.

Well-definedness follows from the triangle inequality of the integral and the monotony of the integral:

|Uφ(x)f(x)dx|U|φ(x)f(x)|dx=supp φ|φ(x)f(x)|dxsupp φφ|f(x)|dx=φsupp φ|f(x)|dx<

In order to have an absolute value strictly less than infinity, the first integral must have a well-defined value in the first place. Therefore, ๐’ฏf really maps to โ„ and well-definedness is proven.

Continuity follows similarly due to

|TfφlTfφ|=|K(φlφ)(x)f(x)dx|φlφK|f(x)|dxindependent of l0,l

, where K is the compact set in which all the supports of φl,lโ„• and φ are contained (remember: The existence of a compact set such that all the supports of φl,lโ„• are contained in it is a part of the definition of convergence in ๐’Ÿ(O), see the last chapter. As in the proof of theorem 3.11, we also conclude that the support of φ is also contained in K).

Linearity follows due to the linearity of the integral.

2.

We show that ๐’ฏf is a distribution, then fLloc1(O) (in fact, we even show that if ๐’ฏf(φ) has a well-defined real value for every φ๐’Ÿ(O), then fLloc1(O). Therefore, by part 1 of this proof, which showed that if fLloc1(O) it follows that ๐’ฏf is a distribution in ๐’Ÿ*(O), we have that if ๐’ฏf(φ) is a well-defined real number for every φ๐’Ÿ(O), ๐’ฏf is a distribution in ๐’Ÿ(O).

Let KU be an arbitrary compact set. We define

μ:Kโ„,μ(ξ):=infxโ„dOξx

μ is continuous, even Lipschitz continuous with Lipschitz constant 1: Let ξ,ιโ„d. Due to the triangle inequality, both

(x,y)โ„2:ξxξι+ιy+yx(*)

and

(x,y)โ„2:ιyιξ+ξx+xy(**)

, which can be seen by applying the triangle inequality twice.

We choose sequences (xl)lโ„• and (ym)mโ„• in โ„dO such that limlξxl=μ(ξ) and limmιym=μ(ι) and consider two cases. First, we consider what happens if μ(ξ)μ(ι). Then we have

|μ(ξ)μ(ι)|=μ(ξ)μ(ι)=infxโ„dOξxinfyโ„dOιy=infxโ„dOξxlimmιym=limminfxโ„dO(ξxιym)limminfxโ„dO(ξι+xym)(*) with y=ym=ξι.

Second, we consider what happens if μ(ξ)μ(ι):

|μ(ξ)μ(ι)|=μ(ι)μ(ξ)=infyโ„dOιyinfxโ„dOξx=infyโ„dOιylimlξxl=limlinfyโ„dO(ιyξxl)limlinfyโ„dO(ξι+yxl)(**) with x=xl=ξι

Since always either μ(ξ)μ(ι) or μ(ξ)μ(ι), we have proven Lipschitz continuity and thus continuity. By the extreme value theorem, μ therefore has a minimum κโ„d. Since μ(κ)=0 would mean that ξxl0,l for a sequence (xl)lโ„• in โ„dO which is a contradiction as โ„dO is closed and κKO, we have μ(κ)>0.

Hence, if we define δ:=μ(κ), then δ>0. Further, the function

ϑ:โ„dโ„,ϑ(x):=(χK+Bδ/4(0)*ηδ/4)(x)=โ„dηδ/4(y)χK+Bδ/4(0)(xy)dy=Bδ/4(0)ηδ/4(y)χK+Bδ/4(0)(xy)dy

has support contained in O, is equal to 1 within K and further is contained in ๐’ž(โ„d) due to lemma 4.7. Hence, it is also contained in ๐’Ÿ(O). Since therefore, by the monotonicity of the integral

K|f(x)|dx=O|f(x)|χK(x)dxโ„d|f(x)|ϑ(x)dx

, f is indeed locally integrable.

Template:TextBox

Proof:

From Hรถlder's inequality we obtain

โ„d|ϕ(x)||f(x)|dxϕL2fL2<.

Hence, ๐’ฏf is well-defined.

Due to the triangle inequality for integrals and Hรถlder's inequality, we have

|Tf(ϕl)Tf(ϕ)|โ„d|(ϕlϕ)(x)||f(x)|dxϕlϕL2fL2

Furthermore

ϕlϕL22ϕlϕโ„d|(ϕlϕ)(x)|dx=ϕlϕโ„dj=1d(1+xj2)|(ϕlϕ)(x)|1j=1d(1+xj2)dxϕlϕj=1d(1+xj2)(ϕlϕ)โ„d1j=1d(1+xj2)dx=πd.

If ϕlϕ in the notion of convergence of the Schwartz function space, then this expression goes to zero. Therefore, continuity is verified.

Linearity follows from the linearity of the integral.

Equicontinuity

We now introduce the concept of equicontinuity.

Template:TextBox

So equicontinuity is in fact defined for sets of continuous functions mapping from X (a set in a metric space) to the real numbers โ„.

Template:TextBox

Proof:

In order to prove uniform convergence, by definition we must prove that for all ϵ>0, there exists an Nโ„• such that for all lN:xQ:|fl(x)f(x)|<ϵ.

So let's assume the contrary, which equals by negating the logical statement

ϵ>0:Nโ„•:lN:xQ:|fl(x)f(x)|ϵ.

We choose a sequence (xm)mโ„• in Q. We take x1 in Q such that |fl1(x1)f(x1)|ϵ for an arbitrarily chosen l1โ„• and if we have already chosen xk and lk for all k{1,,m}, we choose xm+1 such that |flm+1(xm+1)f(xm+1)|ϵ, where lm+1 is greater than lm.

As Q is sequentially compact, there is a convergent subsequence (xmj)jโ„• of (xm)mโ„•. Let us call the limit of that subsequence sequence x.

As ๐’ฌ is equicontinuous, we can choose δโ„>0 such that

xy<δf๐’ฌ:|f(x)f(y)|<ϵ4.

Further, since xmjx (if j of course), we may choose Jโ„• such that

jJ:xmjx<δ.

But then follows for jJ and the reverse triangle inequality:

|flmj(x)f(x)|||flmj(x)f(xmj)||f(xmj)f(x)||

Since we had |f(xmj)f(x)|<ϵ4, the reverse triangle inequality and the definition of t

|flmj(x)f(xmj)|||flmj(xmj)f(xmj)||flmj(x)flmj(xmj)||ϵϵ4

, we obtain:

|flmj(x)f(x)|||flmj(x)f(xmj)||f(xmj)f(x)||=|flmj(x)f(xmj)||f(xmj)f(x)|ϵϵ4ϵ4ϵ2

Thus we have a contradiction to fl(x)f(x).

Template:TextBox

Proof: We have to prove equicontinuity, so we have to prove

xX:δโ„>0:yX:xy<δf๐’ฌ:|f(x)f(y)|<ϵ.

Let xX be arbitrary.

We choose δ:=ϵb.

Let yX such that xy<δ, and let f๐’ฌ be arbitrary. By the mean-value theorem in multiple dimensions, we obtain that there exists a λ[0,1] such that:

f(x)f(y)=f(λx+(1λ)y)(xy)

The element λx+(1λ)y is inside X, because X is convex. From the Cauchy-Schwarz inequality then follows:

|f(x)f(y)|=|f(λx+(1λ)y)(xy)|f(λx+(1λ)y)xy<bδ=bbϵ=ϵ

The generalised product rule

Template:TextBox

We also define less or equal relation on the set of multi-indices.

Template:TextBox

For d2, there are vectors α,βโ„•0d such that neither αβ nor βα. For d=2, the following two vectors are examples for this:

α=(1,0),β=(0,1)

This example can be generalised to higher dimensions (see exercise 6).

With these multiindex definitions, we are able to write down a more general version of the product rule. But in order to prove it, we need another lemma.

Template:TextBox

Proof:

For the ordinary binomial coefficients for natural numbers, we had the formula

(n1k1)+(n1k)=(nk).

Therefore,

(αenβen)+(αenβ)=(α1β1)(αn1βn1)(αdβd)+(α1β1)(αn1βn)(αdβd)=(α1β1)((αn1βn1)+(αn1βn))(αdβd)=(α1β1)(αnβn)(αdβd)=(αβ)

This is the general product rule:

Template:TextBox


Proof:

We prove the claim by induction over |α|.

1.

We start with the induction base |α|=0. Then the formula just reads

f(x)g(x)=f(x)g(x)

, and this is true. Therefore, we have completed the induction base.

2.

Next, we do the induction step. Let's assume the claim is true for all αโ„•0d such that |α|=n. Let now αโ„•0d such that |α|=n+1. Let's choose k{1,,d} such that αk>0 (we may do this because |α|=k+1>0). We define again ek=(0,,0,1,0,,0), where the 1 is at the k-th place. Due to Schwarz' theorem and the ordinary product rule, we have

αfg=αek(xkfg)=αek(xkfg+fxkg).

By linearity of derivatives and induction hypothesis, we have

αek(xkfg+fxkg)=αek(xkfg)+αek(fxkg)=ςαek(αekς)ςxkfαekςg+ςαek(αekς)ςfαekςxkg.

Since

αekς=α(ς+ek)

and

{ςโ„•0d|0ςαek}={ςekโ„•0d|ekςα},

we are allowed to shift indices in the first of the two above sums, and furthermore we have by definition

ςxk=ς+ek.

With this, we obtain

ςαek(αekς)ςxkfαekςg+ςαek(αekς)ςfαekςxkg=ekςα(αekςek)ςfαςg+ςαek(αekς)ςfαςg

Due to lemma 4.18,

(αekβei)+(αekβ)=(αβ).

Further, we have

(αei0)=(α0)=1 where 0=(0,,0) in โ„•0d,

and

(αekαek)=(αα)=1

(these two rules may be checked from the definition of (αβ)). It follows

α(fg)=ekςα(αekςek)ςfαςg+ςαek(αekς)ςfαςg=(αek0)fαg+ekςαek[(αekςek)+(αekς)]ςfαςg+(αekαek)fαg=ςα(ας)ςfας.

Operations on Distributions

For φ,ϑ๐’Ÿ(โ„d) there are operations such as the differentiation of φ, the convolution of φ and ϑ and the multiplication of φ and ϑ. In the following section, we want to define these three operations (differentiation, convolution with ϑ and multiplication with ϑ) for a distribution ๐’ฏ instead of φ.

Template:TextBox

Proof:

We have to prove two claims: First, that the function φ๐’ฏ(โ„’(φ)) is a distribution, and second that Λ as defined above has the property

φ๐’Ÿ(O):Λ(๐’ฏφ)=๐’ฏL(φ)

1.

We show that the function φ๐’ฏ(โ„’(φ)) is a distribution.

๐’ฏ(โ„’(φ)) has a well-defined value in โ„ as โ„’ maps to ๐’Ÿ(O), which is exactly the preimage of ๐’ฏ. The function φ๐’ฏ(โ„’(φ)) is continuous since it is the composition of two continuous functions, and it is linear for the same reason (see exercise 2).

2.

We show that Λ has the property

φ๐’Ÿ(O):Λ(๐’ฏφ)=๐’ฏL(φ)

For every ϑ๐’Ÿ(U), we have

Λ(๐’ฏφ)(ϑ):=(๐’ฏφโ„’)(ϑ):=Oφ(x)โ„’(ϑ)(x)dx=by assumptionUL(φ)(x)ϑ(x)dx=:๐’ฏL(φ)(ϑ)

Since equality of two functions is equivalent to equality of these two functions evaluated at every point, this shows the desired property.

We also have a similar lemma for Schwartz distributions:

Template:TextBox

The proof is exactly word-for-word the same as the one for lemma 4.20.

Noting that multiplication, differentiation and convolution are linear, we will define these operations for distributions by taking L in the two above lemmas as the respective of these three operations.

Template:TextBox

Proof:

The product of two ๐’ž functions is again ๐’ž, and further, if φ(x)=0, then also (fφ)(x)=f(x)φ(x)=0. Hence, fφ๐’Ÿ(O).

Also, if φlφ in the sense of bump functions, then, if Kโ„d is a compact set such that supp φnK for all nโ„•,

α(f(φlφ))=ςα(ας)ςfας(φlφ)ςαςfας(φlφ)ςαmaxxK|ςf|ας(φlφ)0,l.

Hence, fφlfφ in the sense of bump functions.

Further, also fϕ๐’ž(โ„d). Let α,βโ„•0d be arbitrary. Then

βfϕ=ςβ(βς)ςfβςϕ.

Since all the derivatives of f are bounded by polynomials, by the definition of that we obtain

xโ„d:|ςf(x)||pς(x)|

, where pς,ςโ„•0d are polynomials. Hence,

xαβfϕςβxαpςβςϕ<.

Similarly, if ϕlϕ in the sense of Schwartz functions, then by exercise 3.6

xαβf(ϕϕl)ςβxαpςβς(ϕϕl)0,l

and hence fϕlfϕ in the sense of Schwartz functions.

If we define L(φ):=โ„’(φ):=fφ, from lemmas 4.20 and 4.21 follow the other claims.

Template:TextBox

Proof:

We want to apply lemmas 4.20 and 4.21. Hence, we prove that the requirements of these lemmas are met.

Since the derivatives of bump functions are again bump functions, the derivatives of Schwartz functions are again Schwartz functions (see exercise 3.3 for both), and because of theorem 4.22, we have that L and โ„’ map ๐’Ÿ(O) to ๐’Ÿ(O), and if further all aα and all their derivatives are bounded by polynomials, then L and โ„’ map ๐’ฎ(โ„d) to ๐’ฎ(โ„d).

The sequential continuity of โ„’ follows from theorem 4.22.

Further, for all ϕ,θ๐’ฎ(โ„d),

โ„dϕ(x)โ„’(θ)(x)dx=αโ„•0d(1)|α|โ„dϕ(x)α(aαθ)(x)dx.

Further, if we single out an αโ„•0d, by Fubini's theorem and integration by parts we obtain

โ„dϕ(x)α(aαθ)(x)dx=โ„d1โ„ϕ(x)α(aαθ)(x)dx1d(x2,,xd)=โ„d1โ„ϕ(x)α(aαθ)(x)dx1d(x2,,xd)=โ„d1(1)α1โ„(α1,0,,0)ϕ(x)α(α1,0,,0)(aαθ)(x)dx1d(x2,,xd)==(1)|α|โ„dαϕ(x)aα(x)θ(x)dx.

Hence,

โ„dϕ(x)โ„’(θ)(x)dx=โ„dL(ϕ)(x)θ(x)dx

and the lemmas are applicable.

Template:TextBox

Template:TextBox

Proof:

1.

Let xโ„d be arbitrary, and let (xl)lโ„• be a sequence converging to x and let Nโ„• such that nN:xnx1. Then

K:=nNsupp φ(xn)n<Nsupp φ(xn)

is compact. Hence, if βโ„•0d is arbitrary, then βφ(xl)|Kβφ(x)|K uniformly. But outside K, βφ(xl)βφ(x)=0. Hence, βφ(xl)βφ(x) uniformly. Further, for all nโ„• supp φ(xn)K. Hence, φ(xl)φ,l in the sense of bump functions. Thus, by continuity of ๐’ฏ,

(๐’ฏ*φ)(xl)=๐’ฏ(φ(xl))๐’ฏ(φ(x))=(๐’ฏ*φ)(x),l.

2.

We proceed by induction on |α|.

The induction base |α|=0 is obvious, since (0,,0)f=f for all functions f:โ„dโ„ by definition.

Let the statement be true for all αโ„•0d such that |α|=n. Let βโ„•0d such that |β|=n+1. We choose k{1,,d} such that βk>0 (this is possible since otherwise β=๐ŸŽ). Further, we define

ek:=(0,,0,1kth place,0,,0).

Then |βek|=n, and hence βek(๐’ฏ*φ)=๐’ฏ*(βekφ).

Furthermore, for all ϑ๐’Ÿ(โ„d),

limλ0๐’ฏ*ϑ(x+λek)๐’ฏ*ϑ(x)λ=limλ0๐’ฏ(ϑ(x+λek)ϑ(x)λ).

But due to Schwarz' theorem, ϑ(x+λek)ϑ(x)λxkϑ,λ0 in the sense of bump functions, and thus

limλ0๐’ฏ(ϑ(x+λek)ϑ(x)λ)=๐’ฏ(ϑ(x)).

Hence, β(๐’ฏ*φ)=ek๐’ฏ*(βekφ)=๐’ฏ*(βφ), since βekφ is a bump function (see exercise 3.3).

3.

This follows from 1. and 2., since βφ is a bump function for all βโ„•0d (see exercise 3.3).

Exercises

  1. Let ๐’ฏ1,,๐’ฏn be (tempered) distributions and let c1,,cnโ„. Prove that also j=1ncj๐’ฏj is a (tempered) distribution.
  2. Let f:โ„dโ„ be essentially bounded. Prove that ๐’ฏf is a tempered distribution.
  3. Prove that if ๐’ฌ is a set of differentiable functions which go from [0,1]d to โ„, such that there exists a cโ„>0 such that for all g๐’ฌ it holds xโ„d:g(x)<c, and if (fl)lโ„• is a sequence in ๐’ฌ for which the pointwise limit limlfl(x) exists for all xโ„d, then fl converges to a function uniformly on [0,1]d (hint: [0,1]d is sequentially compact; this follows from the Bolzanoโ€“Weierstrass theorem).
  4. Let f:โ„dโ„ such that ๐’ฏf is a distribution. Prove that for all φ๐’Ÿ(O) ๐’ฏf*φ=f*φ.
  5. Prove that for xโ„d the function δx:๐’ฎ(โ„d)โ„,δ(ϕ):=ϕ(x) is a tempered distribution (this function is called the Dirac delta distribution after Paul Dirac).
  6. For each dโ„•, find αd,βdโ„•0d such that neither αdβd nor βdαd.

Sources

Template:Navigation