• 沒有找到結果。

速度平均引理及其在波茲曼方程的應用

N/A
N/A
Protected

Academic year: 2022

Share "速度平均引理及其在波茲曼方程的應用"

Copied!
38
0
0

加載中.... (立即查看全文)

全文

(1)

國立臺灣大學理學院數學系 碩士論文

Department of Mathematics College of Science

National Taiwan University Master Thesis

速度平均引理及其在波茲曼方程的應用 Velocity Averaging Lemmas and Their Application to Boltzmann Equation

莊秉翰 Ping-Han Chuang

指導教授﹕陳逸昆 博士 Advisor: I-Kun Chen, Ph. D.

中華民國 108 年 7 月 July, 2019

(2)
(3)

誌謝

時光飛逝,畢業在即,轉眼間兩年研究所生涯將邁入尾聲,回首這兩年日常 一點一滴,雖免不了惆悵失落,但也為我生命寫下一首清雅的詩。台大校園蓊蓊 鬱鬱的景色,湖畔邊鴨鵝鳥獸無憂無慮覓食,師生行政人員們的幽默風趣,在我 埋頭苦思研究數學時添了不少愜意。感謝陳逸昆指導老師,協助指導我完成這篇 論文,並提供論文研究方向,感謝口試委員夏俊雄老師和沈俊嚴老師,口試期間 出現重感冒症狀,表現不如預期,仍包容我的疏失,感謝助教王雅真和幹事趙怡 茹,提醒我重要修業程序,感謝 408 研究室同學,無拘無束分享各自研究數學心 得,最後感謝我父母,給予我支持和鼓勵。

莊秉翰 誌於 國立台灣大學數學系 民國 108 年 7 月

(4)

doi:10.6342/NTU201901751

中文摘要

1988 年時,Golse、Lions、Perthame 和 Sentis 證明了速度平均會增加函數正 則性,這個現象後來被稱作「速度平均引理」,速度平均引理在DiPerna 和 Lions 的波茲曼方程之柯西問題整體解存在性理論有重要的應用,而其自身也有許多富 有意義的延伸,在此論文中,我們首先回顧經典的速度平均引理,再透過速度平 均效應導出我們關於穩態線性化波茲曼方程正則性的新結果。

關鍵詞:速度平均,正則化效應,索博列夫空間、傳遞方程、波茲曼方程

(5)

Abstract

In 1988, Golse, Lions, Perthame and Sentis jointly proved that velocity averaging has regularizing effects. This phenomenon was later called “Velocity Averaging

Lemmas.” The Velocity Averaging Lemmas have significant applications in the global existence theory of the Cauchy problem for Boltzmann equations by DiPerna and Lions and also have many meaningful extensions themselves. In this thesis, we first review classical Velocity Averaging Lemmas, and then we present our new regularity results for the stationary linearized Boltzmann equation by velocity averaging effects.

Keywords: velocity average, regularizing effect, Sobolev space, transport equation, Boltzmann equation.

(6)

doi:10.6342/NTU201901751

目 錄

誌謝 ... i

中文摘要 ... ii

Abstract ... iii

目錄 ... iv

1 Introduction ... 1

2 Preliminaries ... 3

3 Velocity Averaging Lemmas ... 5

4 Regularity of the Stationary Linearized Boltzmann Equation ... 22

References ... 30

(7)

1 Introduction

In this thesis, we first review famous Velocity Averaging Lemmas by Golse, Lions, Perthame and Sentis [16] and then we introduce our new regularity results on the stationary linearized Boltzmann equation. Velocity Averaging Lemmas play impor- tant roles in the study of regularity of solutions to nonlinear transport equations and in the celebrated theory of global existence on Boltzmann equation [12] by Diperna and Lions. Many of their extensions are also studied and can be found in the works of [9, 10, 13, 18, 19].

The mechanism of Velocity Averaging Lemmas is described as follows. Let u(x, v) be a real-valued function defined on RNx × RNv and ψ(v) a bounded function with compact support on RNv . The average of u with respect to the velocity is

¯ u(x) =

Z

RN

u(x, v)ψ(v)dv.

Suppose u and its weak directional derivative (along v) v · ∂xu(x, v) both belong to some Lp(dxdv) (1 < p < ∞) space, then, generally speaking, the velocity average of u is more regular than u(·, v) for almost every fixed v. Note that v · ∂xu(x, v) only gives information about the smoothness of u(·, v) in the direction v.

Now we turn to the stationary linearized boltzmann equation with a source term v · ∇xf (x, v) = L(f )(x, v) + φ(x, v) (1) for (x, v) ∈ R3× R3. Here L denotes the linearization of the collision operator. The collision operator Q is defined by

Q(F, G) = Z

R3

Z 0

Z π2

0

(F (v0)G(v0) − F (v)G(v)) B(|v− v|, θ)dθdεdv, where v, v denote the velocities before the collision of two particles, v0, v0 their ve- locities after the collision and B is the cross section, depending on the intermolecular force or potential. If we linearize Q around the standard Maxwellian

M (v) = π32e−|v|2 in the form F = M + M12f , then L reads

L(f ) = M12 h

Q(M12f, M ) + Q(M, M12f ) i

. Under a suitable cutoff assumption by Grad [17] by assuming

0 ≤ B ≤ C|v − v|γcos θ sin θ, (2) where γ ∈ [0, 1] is a fixed number (hard sphere model, cutoff hard potential, and cutoff Maxwellian molecular gases). L can be decomposed into

L(f ) = −ν(v)f + K(f ), where ν is a function of v and K is an integral operator

K(f )(x, v) = Z

3

f (x, v)k(v, v)dv.

(8)

doi:10.6342/NTU201901751 We may consider Picard-type iterations for (1) and then consider the following

system of differential equations consequently ν(v)f0+ v · ∇xf0 = φ,

ν(v)fm+ v · ∇xfm = K(fm−1), for m ≥ 1.

Therefore f = Σm=0fm is a solution to (1) formally. Observe the left hand side is a transport operator consisting of ν(v)fm and v · ∇xfm and the right hand side K(fm−1) is a velocity average. It is reasonable to anticipate fm has regularity in x by an iterative application of velocity averaging theory. The precise statement of our result is Theorem 4.3. Liu and Yu have proved a theorem regarding this aspect, also known as Mixture Lemma, for the evolutionary (with time t) Boltzmann equation in [21]. However Mixture Lemma requires regularity in v of initial data.

By comparison, our result doesn’t need any regularity.

For the bounded domain case, although we do not have the same result, the velocity averaging effect still works in this case. Consider the stationary linearized Boltzmann equation in C1 bounded convex domain X with incoming boundary data g

ν(v)f (x, v) + v · ∇xf (x, v) = K(f )(x, v), for (x, v) ∈ X × R3, f |Γ(q, v) = g(q, v), for (q, v) ∈ Γ,

where we have used the fact L(f ) = −ν(v)f + K(f ). It can be shown that, if f and g belong to L2, the above boundary value problem can be formulated as

f (x, v) = e−ν(v)τx,vg(x − τx,v, v) + Z τx,v

0

e−ν(v)sK(f )(x − sv, v)ds, where τx,v := inf{t > 0 : x − tv /∈ X}. If we denote

SX(f )(x, v) :=

Z τx,v

0

e−ν(v)sf (x − sv, v)ds,

our other new result (Theorem 4.10) shows that the mixed operator KSXK has reg- ularizing effect in space variable x. This result has more uses than the previous one, since we more often consider stationary linearized Boltzmann equation in bounded domain. We also illustrate how it applies to the study of regularity of Boltzmann equation. In the same spirit for pointwise estimates, Chen proved that solutions to the stationary linearized Boltzmann equation in a bounded convex domain are H¨older continuous in [7] by observing velocity averaging effects via change of vari- ables method. Along the same lines, Chen, Hsia and Kawagoe improved on the result and showed that solutions are indeed differentiable in [8].

The velocity averaging phenomenon was first discussed in [2] and [15, 16]. The classical results are reviewed in this thesis. We provide two proofs for the case p = 2. The first proof was originally given in [16] and it relies on Fourier analysis.

The second proof is similar to the first one, but its technique can be used to prove the main theorems in Section 4. As for the case p 6= 2, [16] proved that the velocity average ¯u belongs to each Sobolev space Ws,p, where 0 < s < min(1/p, 1/p0) and p0 is the H¨older conjugate exponent of p, by interpolation method. In 2000, Devore and Petrova [10] improved on this result. They finally settled the borderline case

(9)

¯

u ∈ Ws,p for s = min(1/p, 1/p0) and they also proved the sharpness of their result in terms of Besov spaces. The discussion for evolutionary (with time t) transport oper- ators is parallel to the stationary case, so [16] only mentioned the evolutionary case briefly without explicit statements and proofs. However, we state the corresponding theorems for completeness and provide a new proof for the case p = 2.

The above Velocity Averaging Lemmas fail when p = 1 or p = ∞. A counterex- ample is also provided. In order to yield a regularity result for p = 1, we need to make some further assumptions. In this case, we consider a set of functions such that their directional derivatives and themselves are bounded and uniformly inte- grable, then the set of their velocity averages is precompact. This fact is skillfully applied in [12].

After considering the case for whole space, the case for bounded domain X ⊂ RNx is discussed. The key of its proof is Extension Lemma, which says if a function u, its trace and directional derivative belong to Lp, then u can be extended to the whole space RN without loss of regularity. Therefore Velocity Averaging Lemmas can be established in bounded domains by Extension Lemma.

An outline of this thesis is as follows. In Section 2, we recall some basic notions, definitions and theorems of real analysis. In Section 3, we review Velocity Averag- ing Lemmas. Section 4 is devoted to our new regularity results on the stationary linearized Boltzmann equation. To our knowledge, no research exists addressing Theorem 4.3 and Theorem 4.10.

2 Preliminaries

In this section, we recall some basic notions and theorems in real analysis. First of all, we define f ractional Sobolev spaces. Fractional Sobolev spaces are often used to measure the regularity of a function. Assume readers are familiar with the classical Sobolev spaces of integer order. For those not familiar, see [14].

Definition 2.1. Let Ω be an open subset of RN. For 1 ≤ p ≤ ∞, θ ∈ (0, 1) and f ∈ Lp(Ω), the Slobodeckij seminorm is defined by

[f ]θ,p :=

Z

Z

|f (x) − f (y)|p

|x − y|θp+N dxdy

1/p

, for 1 ≤ p < ∞, [f ]θ,∞:= ess sup

Ω×Ω

|f (x) − f (y)|

|x − y|θ , for p = ∞.

Let s > 0 be not an integer and θ = s − bsc ∈ (0, 1). The fractional Sobolev space is defined as

Ws,p(Ω) :=f ∈ Wbsc,p : [Dαf ]θ,p < ∞ for each |α| = bsc with the norm

kf kWs,p = kf kWbsc,p+ Σ|α|=bsc[Dαf ]θ,p.

For p = 2, let us denote Ws,p by Hs. Sometimes, we only interested in the regularity in one variable, so the concept of M ixed spaces arises.

(10)

doi:10.6342/NTU201901751 Definition 2.2. Let Ω ⊂ RNx be an open subset.

L2vHxs(Ω × RNv ) := {f ∈ L2(Ω × RNv ) : kf kL2

vHxs(Ω×RNv) < ∞}, with the norm

kf kL2vHxs(Ω×RNv) :=

Z

RN

kf (·, v)k2Hs(Ω)dv

1/2

.

In this thesis, we also denote the Fourier transform of f in x variable byF f and the corresponding Fourier variable by ξ. Bessel potential spaces are another class of Sobolev-type spaces of noninteger order. They are defined as follows.

Definition 2.3. For 1 < p < ∞,

Hes,p :=f ∈ Lp(RN) :F−1(1 + |ξ|2)s/2F f ∈ Lp(RN) equipped with the norm

kf kHes,p :=

F−1(1 + |ξ|2)s/2F f

Lp(RN).

It turns out that, for p = 2, the Sobolev space and the Bessel potential space are the same for any integer and noninteger order s > 0. The following theorem is well-known. We refer the interested readers to [11] for its proof and details.

Theorem 2.4. For any s > 0, eHs(RN) = Hs(RN) and the norm of eHs(RN) and Hs(RN) are equivalent.

Therefore, to verify whether a function f ∈ L2 belongs to Hs or not, it is equivalent to verifying

Z

RN

(1 + |ξ|2s)|F f(ξ)|2dξ < ∞.

Now we can define the following mixed spaces without using Slobodeckij seminorm.

Definition 2.5. For s ≥ 0, we define

L2vHxs := {f ∈ L2(RNx × RNv ) : kf kL2vHxs < ∞}, with the norm

kf kL2vHsx :=

Z

RN

Z

RN

(1 + |ξ|2s)|F f(ξ, v)|2dξdv

1/2

.

The concept of uniform integrability is important in real analysis. We will use the following definition in L1 Velocity Averaging Lemma.

Definition 2.6. A set K ⊂ L1(RNy ) is called uniformly integrable if, for each ε > 0, there exists δ > 0 such that

sup

f ∈K

Z

A

|f (y)|dy < ε whenever |A| < δ.

(11)

The following criterion is useful in the proof of L1 Velocity Averaging Lemma.

Theorem 2.7. Let 1 ≤ p < ∞. A bounded subset K ⊂ Lp(Ω) (Ω is an open subset of RN) is precompact in Lp(Ω) if and only if for each ε > 0 there exists a number δ > 0 and a subset G b Ω such that for every u ∈ K and h ∈ RN with |h| < δ both of the following inequalities hold:

Z

|u(x + h) − u(x)|pdx < ε (let u = 0 outside Ω). (3) Z

Ω− ¯G

|u(x)|p < ε. (4)

A proof for the above theorem can be found in [1]. Sobolev spaces have compact embedding property. This property allows us to utilize compactness in Sobolev spaces.

Theorem 2.8. Let s ∈ (0, 1), 1 ≤ p < ∞, 1 ≤ q ≤ p and Ω ⊂ RN be a C1 bounded open set. Then,

Ws,p(Ω) ⊂⊂ Lq(Ω).

In other words, if K is a bounded subset in Lp(Ω) and sup

f ∈K

Z

Z

|f (x) − f (y)|p

|x − y|N +sp dxdy < ∞, then K is precompact in Lq(Ω).

A proof for the above theorem can be found in [11].

3 Velocity Averaging Lemmas

We revisit the classical Velocity Averaging Lemmas in this section. Throughout the section, ψ ∈ Lc (RN) is any fixed bounded function with compact support. We denote by C various positive constants which may depend on ψ and we use the notation

¯ u =

Z

RN

u(v)ψ(v)dv.

Before we introduce Velocity Averaging Lemmas, we first prove a basic fact regarding transport equation., which is fundamental in velocity averaging theory.

Proposition 3.1. Let 1 ≤ p ≤ ∞. For any f ∈ Lp(RNx × RNv ), the transport equation

u + v · ∂xu = f in RNx × RNv (5) has a unique solution uf in Lp(RNx × RNv ). The linear operator T : Lp(RNx × RNv ) → Lp(RNx) defined by

T (f ) = ¯uf = Z

RN

u(·, v)ψ(v)dv is continuous.

(12)

doi:10.6342/NTU201901751 Proof. Given f ∈ Lp(RNx × RNv ). We claim

uf(x, v) = Z

0

e−sf (x − sv, v)ds

is the unique solution in Lp(RNx × RNv ). Given φ ∈ Cc(RN × RN). We have Z

RN

Z

RN

uf(φ − v · ∂xφ)dxdv

= Z

RN

Z

RN

Z 0

e−sf (x − sv, v) (φ(x, v) − v · ∂xφ(x, v)) dsdxdv.

Change of variables (s, x, v) → (s, x + sv, v) gives Z

RN

Z

RN

Z 0

e−sf (x − sv, v) (φ(x, v) − v · ∂xφ(x, v)) dsdxdv

= Z

RN

Z

RN

Z 0

e−sf (x, v) (φ(x + sv, v) − v · ∂xφ(x + sv, v)) dsdxdv

= − Z

RN

Z

RN

f (x, v) Z

0

∂s e−sφ(x + sv, v) dsdxdv

= Z

RN

Z

RN

f (x, v)φ(x, v)dxdv.

Hence uf is a weak solution to (5). By H¨older’s inequality, kufkpLp(RNx×RNv)

= Z Z

Z 0

e−sf (x − sv, v)ds

p

dxdv

Z Z Z 0

ep0s2 ds

p0p Z 0

eps2 |f (x − sv, v)|pds

 dxdv

≤C Z

RN

Z

RN

Z 0

eps2 |f (x − sv, v)|pdsdxdv

=C Z

RN

Z

RN

Z 0

eps2 |f (x, v)|pdsdxdv

≤Ckf kpLp(RNx×RNv).

We also have, by H¨older’s inequality again, k ¯ufkpLp(RNx) =

Z Z

uf(x, v)ψ(v)dv

p

dx

≤ Z Z

|ψ(v)|p0dv

p0p Z

|uf(x, v)|pdv

 dx

≤ CkufkpLp(RNx×RNv)

≤ Ckf kpLp(RNx×RNv).

Now it only remains to prove the uniqueness. Suppose u1 ∈ Lp(RNx × RNv ) and u2 ∈ Lp(RNx × RNv ) are two solutions to (5). Let w = u1− u2. Thus

w + v · ∂xw = 0.

(13)

Pick a φ ∈ Cc(RN × RN). Then e−sφ(x + sv, v) ∈ Cc(RN × RN) for each s > 0.

Therefore, Z

RN

Z

RN

w(x, v) e−sφ(x + sv, v) − v · ∂xe−sφ(x + sv, v) dxdv = 0.

We have

∂s

 e−s

Z

RN

Z

RN

w(x, v)φ(x + sv, v)dxdv



= 0, which implies

e−s Z

RN

Z

RN

w(x, v)φ(x + sv, v)dxdv = C. (6) By H¨older’s inequality,

Z

RN

Z

RN

w(x, v)φ(x + sv, v)dxdv ≤ kwkLpkφkLp0. Hence letting s → ∞ in (6) implies C = 0. In particular,

Z

RN

Z

RN

w(x, v)φ(x, v)dxdv = 0.

Since φ is arbitrary, we conclude w(x, v) = 0 almost everywhere. In other words, u1 = u2.

Remark. The transport equation

u + v · ∂xu = 0 has nontrivial solutions in the space L1loc(RNx × RNv ).

Next, we consider L2 Stationary Velocity Averaging Lemma, the main theorem in [16]. We provide two proofs here. Both proofs rely on Fourier analysis.

Theorem 3.2. Let u = u(x, v) be such that u and v · ∂xu (= ∂su(x + sv, v) s=0

in the weak sense) both belong to L2(RNx × RNv ). Then ¯u(x) = R

RNu(x, v)ψ(v)dv belongs to H12(RN) and

k¯uk

H12(RN)≤ C(kukL2(RNx×RNv)+ kv · ∂xukL2(RNx×RNv)). (7) Proof 1 of Theorem 3.2. The assumption on u may be formulated as F u and (v · ξ)F u belong to L2(RNξ × RNv ). Notice that

Z

RN

|ξ|

Z

RN

F u(ξ, v)ψ(v)dv

2

= Z

|ξ|

Z

|v·ξ|<1

F u(ξ, v)ψ(v)dv +Z

|v·ξ|≥1

F u(ξ, v)ψ(v)dv

2

≤2 Z

|ξ|

Z

|v·ξ|<1

F u(ξ, v)ψ(v)dv

2

+ 2 Z

|ξ|

Z

|v·ξ|≥1

F u(ξ, v)ψ(v)dv

2

=:I + J. (8)

(14)

doi:10.6342/NTU201901751 By Cauchy-Schwarz inequality, we obtain

Z

|v·ξ|<1

F u(ξ, v)ψ(v)dv

2

Z

|v·ξ|<1

|ψ(v)|2dv

 Z

RN

|F u(ξ, v)|2dv

 . Note that

Z

|v·ξ|<1

|ψ(v)|2dv = Z

|v·|ξ|ξ|<|ξ|1

|ψ(v)|2dvdv⊥ξ, where v = (v ·|ξ|ξ)|ξ|ξ and dv⊥ξ = v − v. Therefore,

Z

|v·|ξ|ξ|<|ξ|1

|ψ(v)|2dvdv⊥ξ = Z

RN −1

Z

|v|<|ξ|1

|ψ(v)|2dvdv⊥ξ

≤C 1

|ξ|. Hence,

I ≤ C Z

RN

Z

RN

|F u(ξ, v)|2dvdξ. (9)

By Cauchy-Schwarz inequality again, we have

Z

|v·ξ|≥1

F u(ξ, v)ψ(v)dv

2

Z

|v·ξ|≥1

1

|v · ξ|2|ψ(v)|2dv

 Z

RN

|v · ξ|2|F u(ξ, v)|2dv

 . Note that

Z

|v·ξ|≥1

1

|v · ξ|2|ψ(v)|2dv = 1

|ξ|2 Z

|v·|ξ|ξ|≥|ξ|1

1 v · |ξ|ξ

2|ψ(v)|2dvdv⊥ξ

= 1

|ξ|2 Z

RN −1

Z

|v|≥|ξ|1

1

|v|2|ψ(v)|2dvdv⊥ξ

≤C 1

|ξ|2 · 1

|ξ|

−1

=C 1

|ξ|. Therefore,

J ≤ C Z

RN

Z

RN

|v · ξ|2|F u(ξ, v)|2dvdξ. (10) By Plancherel’s identity,

Z Z

|u(x, v)|2dxdv = Z Z

|F u(ξ, v)|2dξdv, Z Z

|v · ∂xu(x, v)|2dxdv = Z Z

|v · ξ|2|F u(ξ, v)|2dξdv.

From this, (8), (9) and (10), we conclude k¯uk

H12(RN) =

Z

RN

(1 + |ξ|)|F ¯u(ξ)|2

1/2

≤C(k¯ukL2(RN)+ I12 + J12)

≤C(kukL2(RNx×RNv)+ kv · ∂xukL2(RNx×RNv)).

(15)

Proof 2 of Theorem 3.2. Since u ∈ L2(RNx × RNv ) and v · ∂xu ∈ L2(RNx × RNv ), we have

u + v · ∂xu = f ∈ L2(RNx × RNv ).

By Proposition 3.1, we have

u(x, v) = Z

0

e−sf (x − sv, v)ds and

¯ u(x) =

Z

RN

Z 0

e−sf (x − sv, v)ψ(v)dsdv ∈ L2(RNx).

Considering the Fourier transform of ¯u, we have F ¯u(ξ) =Z

RN

Z 0

e−sF f(· − sv, v)(ξ)ψ(v)dsdv

= Z

RN

Z 0

e−se−i(v·ξ)sF f(ξ, v)ψ(v)dsdv

= Z

RN

F f(ξ, v)

1 + i(v · ξ)ψ(v)dv.

Thus, Z

RN

|ξ||F ¯u(ξ)|2dξ = Z

|ξ|

Z

RN

F f(ξ, v)

1 + i(v · ξ)ψ(v)dv

2

≤ Z

|ξ|

Z

RN

|F f(ξ, v)|2dv

 Z

RN

|ψ(v)|2 1 + (v · ξ)2dv



dξ (11) by Cauchy-Schwarz inequality. Notice that

Z

RN

|ψ(v)|2

1 + (v · ξ)2dv = Z

−∞

Z

RN −1

|ψ(v)|2

1 + |ξ|2(v · |ξ|ξ )2dv⊥ξdv

≤Ckψk2L

Z

−∞

1

1 + |ξ|2(v)2dv. Change of the variable s = |ξ|v gives

Z

−∞

1

1 + |ξ|2(v)2dv = 1

|ξ|

Z

−∞

1 1 + s2ds

≤C 1

|ξ|. Substituting this into (11) gives

Z

RN

|ξ||F ¯u(ξ)|2dξ ≤C Z Z

|F f(ξ, v)|2dvdξ

=C Z Z

|f (x, v)|2dxdv

(16)

doi:10.6342/NTU201901751 by Plancherel’s identity. Consequently,

k¯uk

H12(RN)=

Z

RN

(1 + |ξ|)|F ¯u(ξ)|2

1/2

≤C k¯ukL2(RN)+

Z

RN

|ξ||F ¯u(ξ)|2

1/2!

≤C(kukL2 + kf kL2)

=C(kukL2 + ku + v · ∂xukL2)

≤C(kukL2 + kv · ∂xukL2).

Notice that L2 Velocity Averaging Lemma can be formulated as follows.

Corollary 3.3. Under the hypotheses of Proposition 3.1, T : L2(RNx × RNv ) → H12(RN) is continuous.

Proof. If f ∈ L2(RNx × RNv ), then uf ∈ L2(RNx × RNv ) and v · ∂xuf = f − uf ∈ L2(RNx × RNv ).

Furthermore,

kv · ∂xufkL2 =kf − ufkL2

≤kf kL2 + kufkL2 ≤ Ckf kL2. According to Theorem 3.2, ¯uf ∈ H12(RN) and

k ¯ufk

H12 ≤ C(kufkL2 + kv · ∂xufkL2) ≤ Ckf kL2.

With the above corollary, we are able to generalize Theorem 3.2 to any Lp space with 1 < p < ∞ via the real method of interpolation.

Theorem 3.4. Let u = u(x, v) be such that u and v · ∂xu both belong to Lp(RNx × RNv ) with 1 < p < ∞. Then ¯u belongs to Ws,p(RN) with s = min(1p,p10) and

k¯ukWs,p(RN)≤ C(kukLp+ kv · ∂xukLp). (12) Proof. The proof is based on the following real interpolation theorem in [10].

Theorem 3.5. We have the following relations between interpolation spaces and Sobolev spaces.



L1(RN), H12(RN)

2

p0,p = Wp01,p(RN), for 1 < p < 2, (13)

and 

L(RN), H12(RN)

2 p,p

⊂ W1p,p(RN), for 2 < p < ∞. (14) Moreover, the norm for the interpolation space on the left hand side of (13) is equivalent to the norm of the Sobolev space on the right side. Likewise, the norm of the Sobolev space on the right side of (14) is less than a fixed multiple of the norm of the interpolation space on the left side.

(17)

Consider the operator T in Corollary 3.3. We have T : L1(RNx × RNv ) → L1(RN), T : L2(RNx × RNv ) → H12(RN).

By Theorem 3.5 and the fact (L1, L2)2

p0,p= Lp for 1 < p < 2, T : Lp(RNx × RNv ) → Wp01,p(RN)

is bounded for 1 < p < 2. Hence if u + v · ∂xu =: f ∈ Lp(RNx × RNv ), then

¯

u = T (f ) ∈ Wp01,p(RN) and k¯uk

W

1 p0,p

(RN)≤ Ckf kLp ≤ C(kukLp+ kv · ∂xukLp).

The case 2 < p < ∞ follows similarly.

Unfortunately, the above Lp Velocity Averaging Lemma fails for the endpoint cases p = 1 and p = ∞. [16] provided an example to illustrate this phenomenon.

Theorem 3.6. Under the hypothesis of Proposition 3.1. Suppose also ψ = 1{|v|≤1}. There exists a bounded subset K ⊂ L1(RNx × RNv ) such that T (K) is not weakly precompact in L1(B1).

Proof. Let v0 be an arbitrary point in {0 < |v| < 1}. Consider a sequence of functions

fn(x, v) = n2Nψ1(n(0 − x)) ψ2(n(v0− v)) , where ψ1 and ψ2 are two mollifiers in Cc(B1). Therefore,

T (fn)(x) = Z

{|v|≤1}

Z 0

fn(x − tv, v)e−tdtdv.

If T (fn) converges weakly in L1(B1) to a function w. Given θ ∈ Cc(B1). On the one hand, as n → ∞,

Z

|x|≤1

T (fn)(x)θ(x)dx = Z

|x|≤1

Z

|v|≤1

Z 0

fn(x − tv, v)e−tθ(x)dtdvdx

→ Z

0

e−tθ(tv0)dt.

On the other hand, as n → ∞, Z

|x|≤1

T (fn)(x)θ(x)dx → Z

|x|≤1

w(x)θ(x)dx.

Therefore,

Z 0

e−tθ(tv0)dt = Z

|x|≤1

w(x)θ(x)dx (15)

for any θ ∈ Cc(B1). Let θ be a mollifier in Cc(B1) and y a Lebesgue point of w not on the line {tv0 : t > 0}. Consider θm(x) = mNθ (N (y − x)). Hence, as m → ∞,

Z

|x|≤1

w(x)θm(x)dx → w(y).

(18)

doi:10.6342/NTU201901751 We also have, as m → ∞,

Z 0

e−tθm(tv0)dt → 0.

Therefore, (15) implies w(y) = 0 for any Lebesgue point y /∈ {tv0 : t > 0}, which means w = 0 almost everywhere, a contradiction to (15). Hence we let K = {fn}n∈N.

Remark. Theorem 3.4 implies

T : Lp(RNx × RNv ) → Ws,p(RNx) (16) is bounded with 1 < p < ∞ and s = min(1p,p10). However, Theorem 3.6 shows that (16) fails when p = 1 no matter how small s > 0 is. For if for some s > 0 such that (16) holds, then consider K in Theorem 3.6. Therefore, T (K) ⊂ Ws,1(RNx) is bounded. Let M = { T (f )|B

1 : f ∈ K}. Hence, M ⊂ Ws,1(B1) is bounded. We have Ws,1(B1) ⊂⊂ L1(B1) by compact embedding property, so M is precompact in L1(B1), which contradicts Theorem 3.6.

For the case p = 1, nonetheless, we can still make additional assumptions to yield a regularity result via compact embedding property of Sobolev space.

Theorem 3.7. Under the hypotheses of Proposition 3.1, if K ⊂ L1(RNx × RNv ) is bounded and uniformly integrable, then T (K) is precompact in L1(S) for any C1 bounded open set S ⊂ RN.

Proof. For any f ∈ K and α > 0, we define

χα,f = 1{(x,v):|f (x,v)|<α}, ωα,f = 1 − χα,f.

Note that f · ωα,f and f · χα,f are the large part and the small part of f respectively.

We can write

¯

uf = T (f ) = T (f · ωα,f) + T (f · χα,f)

=: φf + ψf.

The idea is that we deal with large parts by uniform integrability and small parts by L2 Velocity Averaging Lemma. Clearly, we have

Z

f(x + h) − φf(x)|dx ≤ 2 Z

f(x)|dx

= 2 Z

|T (f · ωα,f)|dx

≤ 2 Z Z

|f · ωα,f|dvdx.

We claim

sup

f ∈K

Z Z

|f · ωα,f|dvdx → 0

(19)

as α → ∞. For given ε > 0, choose δ as in Definition 2.6. Since K is bounded in L1(RNx × RNv ),

sup

f ∈K

|{|f (x, v)| ≥ α}| ≤ sup

f ∈K

1 α

Z Z

{|f |≥α}

|f |dxdv

≤1 α sup

f ∈K

Z Z

|f |dxdv

<δ,

if α is large enough. The uniform integrability implies

sup

f ∈K

Z Z

|f · ωα,f|dxdv = sup

f ∈K

Z Z

{|f (x,v)|≥α}

|f |dxdv

<ε.

Thus we can choose α > 0 such that Z

f(x + h) − φf(x)|dx ≤ 2 Z

f(x)|dx < 2ε (17)

for every f ∈ K and h ∈ RN. With the α chosen above, sup

f ∈K

Z Z

|f · χα,f|2dxdv ≤ sup

f ∈K

α Z Z

|f |dxdv

< ∞.

In other words, {f · χα,f : f ∈ K} is bounded in L2(RNx × RNv ). According to Corollary 3.3, the set {ψf : f ∈ K} is bounded in H12. Since H12(S) ⊂⊂ L1(S) for any C1 bounded open set S ⊂ RN. By Theorem 2.7,

sup

f ∈K

Z Z

S

f(x + h) − ψf(x)|dx → 0 (18)

as h → 0. Hence T (K) satisfies (3) by (17) and (18). For (4), we note that K is uniformly integrable and

Z

S− ¯G

|¯u(x)|dx ≤ C Z

S− ¯G

Z

D

|f (x, v)|dvdx < ε,

where D is the support of ψ, if |S − ¯G| is small enough. Finally, we conclude that T (K) is precompact in L1(S) for any C1 bounded open set S.

The Velocity Averaging Lemmas for evolutionary case are parallel to those for stationary case. However, since the transport operators ∂t+ v · ∂x and v · ∂x have different (but similar) structures, the proofs for stationary case can not be applied to evolutionary case. Therefore, we choose to modify the second proof for Theorem 3.2. As in the stationary case, we first consider the velocity averaging operator with time t and then introduce L2 Evolutionary Velocity Averaging Lemma.

(20)

doi:10.6342/NTU201901751 Proposition 3.8. Let 1 ≤ p ≤ ∞. For any f ∈ Lp(Rt× RNx × RNv ), the transport

equation

u + ∂tu + v · ∂xu = f in Rt× RNx × RNv (19) has a unique solution uf in Lp(Rt× RNx × RNv ). The linear operator T : Lp(Rt× RNx × RNv ) → Lp(Rt× RNx) defined by T (f ) = ¯uf is continuous.

Proof. First, claim

uf(t, x, v) = Z

0

e−sf (t − s, x − sv, v)ds

is a solution to (19). The rest is similar to the proof in Proposition 3.1.

Theorem 3.9. Let u = u(t, x, v) be such that u and ∂tu + v · ∂xu (=

∂su(t + s, x + sv, v)

s=0 in the weak sense) both belong to L2(Rt × RNx × RNv ).

Then ¯u(t, x) = R

RNu(t, x, v)ψ(v)dv belongs to H12(Rt× RNx) and k¯uk

H12(Rt×RNx) ≤ C(kukL2 + k∂tu + v · ∂xukL2). (20) Proof. In this proof, we denote byF f the Fourier transform of f in t and x variable only, and by τ and ξ the corresponding Fourier variables. Since u ∈ L2(Rt× RNx × RNv ) and ∂tu + v · ∂xu ∈ L2(Rt× RNx × RNv ), it follows that

u + ∂tu + v · ∂xu = f ∈ L2(Rt× RNx × RNv ).

By Proposition 3.8, we have u(t, x, v) =

Z 0

e−sf (t − s, x − sv, v)ds and

¯

u(t, x) = Z

RN

Z 0

e−sf (t − s, x − sv, v)ψ(v)dsdv.

Therefore,

F ¯u(τ, ξ) =Z

RN

Z 0

e−s· e−iτ s· e−i(v·ξ)sF f(τ, ξ, v)ψ(v)dsdv

= Z

RN

F f(τ, ξ, v)ψ(v) 1 + i (τ + (v · ξ))dv.

By Cauchy-Schwarz inequality, Z

RN

Z

RN

(|τ |2+ |ξ|2)1/2 Z

RN

F f(τ, ξ, v)ψ(v) 1 + i (τ + (v · ξ))dv

2

dξdτ

≤ Z

RN

Z

RN

(|τ | + |ξ|)

Z

RN

|F f(τ, ξ, v)|2dv

  |ψ(v)|2dv 1 + (τ + (v · ξ))2

 dξdτ

= Z Z

|ξ|

Z

RN

|F f(τ, ξ, v)|2dv

  |ψ(v)|2dv 1 + (τ + (v · ξ))2

 dξdτ +

Z Z

|τ |

Z

RN

|F f(τ, ξ, v)|2dv

  |ψ(v)|2dv 1 + (τ + (v · ξ))2

 dξdτ

=: I + J.

(21)

Pick R > 0 sufficiently large so that Z |ψ(v)|2

1 + (τ + (v · ξ))2dv ≤ Z

[−R,R]N −1

Z R

−R

|ψ(v)|2

1 + (τ + (v · ξ))2dv⊥ξdv

≤C Z R

−R

1 1 + τ + |ξ|v

2dv

≤C 1

|ξ|

Z

−∞

1 1 + λ2

≤C 1

|ξ|, where λ = τ + |ξ|v. Hence,

I ≤ C Z Z Z

|F f(τ, ξ, v)|2dvdξdτ. (21) For J ,

|τ |

Z |ψ(v)|2

1 + (τ + (v · ξ))2dv ≤ C Z R

−R

|τ |

1 + τ + |ξ|v2dv

follows similarly. If |ξ| = 0, Z R

−R

|τ | 1 + τ + |ξ|v

2dv ≤2R · |τ | 1 + τ2

≤C.

If |ξ| 6= 0, then we have the following lemma.

Lemma 3.10. There exists a constant C > 0 depending only on R > 0 such that Z R

−R

1

1 + (τ + |ξ|s)2ds ≤ C · 1

|τ |. Proof of Lemma 3.10. Clearly,

Z R

−R

|τ |

1 + (τ + |ξ|s)2ds =|τ |

|ξ|

Z τ +|ξ|R τ −|ξ|R

1 1 + λ2

=R · |τ |

|ξ|R(arctan(τ + |ξ|R) − arctan(τ − |ξ|R))

=R sgn(τ )D

 τ

|ξ|R, |ξ|R

 , where λ = τ + |ξ|s and

D(a, b) = a (arctan b(a + 1) − arctan b(a − 1)) .

We show that D is a bounded function in R2. If |a| ≤ 2, then |D(a, b)| ≤ 2π. Now we fix an a with |a| > 2 and consider D(a, b) as a function of b. Since D(a, b) → 0 as |b| → ∞, the maximum and the minimum of D(a, ·) must occur at critical points b = ±1/√

a2− 1. However, D

a, ± 1

a2−1



is a bounded function for |a| ≥ 2. Thus Lemma 3.10 follows.

(22)

doi:10.6342/NTU201901751 Go back to the proof of Theorem 3.9. Hence, according to Lemma 3.10, we have

|τ |

Z |ψ(v)|2

1 + (τ + (v · ξ))2dv ≤ C and

J ≤ C Z Z Z

|F f(τ, ξ, v)|2dvdξdτ. (22) By (21) and (22), we conclude that

k¯uk

H12(Rt×RNx)≤C(k¯ukL2(Rt×RN

x)+ kf kL2(Rt×RN

x×RNv))

≤C(kukL2 + k∂tu + v · ∂xukL2).

Other proofs for Theorem 3.9 can be found in, for example, [4, 9].

Also notice that Theorem 3.9 can be formulated as follows.

Corollary 3.11. Under the hypotheses of Proposition 3.8, T : L2 Rt× RNx × RNv  → H12(Rt× RNx) is continuous.

By Corollary 3.11, we can prove Lp (1 < p < ∞) and L1 Evolutionary Veloc- ity Averaging Lemmas as in the stationary case. We omit proofs since they are essentially the same.

Theorem 3.12. Let u = u(t, x, v) be such that u and ∂tu + v · ∂xu both belong to Lp(Rt× RNx × RNv ). Then ¯u(t, x) belongs to Ws,p(Rt× RNx) with s = min(1p,p10) and k¯ukWs,p(Rt×RNx)≤ C(kukLp + k∂tu + v · ∂xukLp). (23) Theorem 3.13. Under the hypotheses of Proposition 3.8, if K ⊂ L1(Rt×RNx ×RNv ) is bounded and uniformly integrable, then T (K) is precompact in L1((0, T ) × S) for any T > 0 and C1 bounded open set S ⊂ RN.

So far, we only dealt with functions defined on whole space RNx . Now we consider a localized version of the above results. Let X be a C1 bounded convex domain in RNx. Denote by dΣ the surface measure on ∂X, and by n(q) the unit outward normal vector to X at q ∈ ∂X. We define

Γ := ∂X × RNv ,

Γ+ := {(q, v) ∈ Γ |n(q) · v > 0 } , Γ := {(q, v) ∈ Γ |n(q) · v < 0 } , Γ0 := {(q, v) ∈ Γ |n(q) · v = 0 } ,

and also define the backward exit time τx,v > 0 and the f orward exit time γx,v > 0 by relations

x − τx,vv ∈∂X, x + γx,vv ∈∂X,

where (x, v) ∈ ¯X × RN. τx,v and γx,v are well-defined since X is convex. Denote by dσ the measure

dσ = |v · n(q)|dΣ(q)dv.

We have the following change of variables formulas.

(23)

Lemma 3.14. For any h ∈ L1(X × RNv ), the following hold.

Z

RN

Z

X

h(x, v)dxdv = Z

Γ

Z γq,v

0

h(q + tv, v)dtdσ, (24) and, for almost every v ∈ RN,

Z

X

h(x, v)dx = Z

Γ−,v

Z γq,v

0

h(q + tv, v)|v · n(q)|dtdΣ(q), (25) where Γ−,v := {x ∈ X : (x, v) ∈ Γ}.

Proof. For (x, v) ∈ X × RN, write x = q + tv, where (q, v) ∈ Γ and 0 < t < γq,v. Consider a chart θ : D ⊂ RN −1→ ∂X, where D is an open subset of RN −1. Denote q = θ(α). Now we consider the change of variable (x, v) → (α, t, v). Clearly, we have

x = θ(α) + tv,

xαi = θαi for 1 ≤ i ≤ N − 1, xt= v.

Therefore, the Jacobian for the change of vatiables is

J (α, t, v) = det

 θα1

... θαN −1

v

 .

Hence, it follows that

dxdv =|J (α, t, v)|dαdtdv

=|v · n(q)|dtdΣ(q)dv

=dtdσ.

Consequently, we have (24) and (25).

For 1 < p < ∞, we define

Wp(X) :=u(x, v) : u and v · ∂xu both belong to Lp(X × RN) , kukWp(X) := kukLp(X×RN)+ kv · ∂xukLp(X×RN).

Let us discuss the boundary value u|Γ of u ∈ Wp(X) on Γ with measure dσ. The idea follows from [5, 6] and [20]. From the identity (24), we have

Z

RN

Z

X

|u(x, v)|pdxdv = Z

Γ

Z γq,v

0

|u(q + tv, v)|pdtdσ, Z

RN

Z

X

|v · ∂xu(x, v)|pdxdv = Z

Γ

Z γq,v

0

|∂

∂tu(q + tv, v)|pdtdσ.

Thus, for almost every (q, v) ∈ Γ (with respect to dσ), u(q + tv, v), as a function of t, belongs to W1,p(0, γq,v), which means u(q + tv, v) is an absolutely continuous

參考文獻

相關文件

In Sections 3 and 6 (Theorems 3.1 and 6.1), we prove the following non-vanishing results without assuming the condition (3) in Conjecture 1.1, and the proof presented for the

In this paper, we build a new class of neural networks based on the smoothing method for NCP introduced by Haddou and Maheux [18] using some family F of smoothing functions.

In this paper we establish, by using the obtained second-order calculations and the recent results of [23], complete characterizations of full and tilt stability for locally

In this paper we establish, by using the obtained second-order calculations and the recent results of [25], complete characterizations of full and tilt stability for locally

In this paper, motivated by Chares’s thesis (Cones and interior-point algorithms for structured convex optimization involving powers and exponentials, 2009), we consider

constant angular acceleration* 恆角加速度 constant angular velocity 恆角速度. constant force

For the data sets used in this thesis we find that F-score performs well when the number of features is large, and for small data the two methods using the gradient of the

In this thesis, we present a Threshold Jumping (TJ) and a Warp-Around Scan (WAS) techniques aim to coordinate simultaneous communications in high density RFID