High order approximation for the Boltzmann equation without angular cutoff
Ling-Bing He, Yulong Zhou

TL;DR
This paper introduces a new model to approximate the Boltzmann equation without angular cutoff, combining the Boltzmann and Landau operators, and demonstrates higher accuracy and well-posedness.
Contribution
It proposes a novel approximation model that integrates Boltzmann and Landau operators, achieving higher order accuracy without angular cutoff.
Findings
Proved well-posedness of the approximate equation
Established error estimates between approximate and original solutions
Achieved higher order accuracy compared to standard methods
Abstract
In order to solve the Boltzmann equation numerically, in the present work, we propose a new model equation to approximate the Boltzmann equation without angular cutoff. Here the approximate equation incorporates Boltzmann collision operator with angular cut-off and the Landau collision operator. As a first step, we prove the well-posedness theory for our approximate equation. Then in the next step we show the error estimate between the solutions to the approximate equation and the original equation. Compared to the standard angular cut-off approximation method, our method results in higher order of accuracy.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGas Dynamics and Kinetic Theory · Numerical methods in inverse problems · Radiative Heat Transfer Studies
High order approximation for the Boltzmann equation without angular cutoff
Lingbing He and Yulong Zhou
Department of Mathematical Sciences, Tsinghua University, Beijing 100084, P. R. China.
Department of Mathematics, Hong Kong Baptist University, Hong Kong, P. R. China.
Abstract.
In order to solve the Boltzmann equation numerically, in the present work, we propose a new model equation to approximate the Boltzmann equation without angular cutoff. Here the approximate equation incorporates Boltzmann collision operator with angular cut-off and the Landau collision operator. As a first step, we prove the well-posedness theory for our approximate equation. Then in the next step we show the error estimate between the solutions to the approximate equation and the original equation. Compared to the standard angular cut-off approximation method, our method results in higher order of accuracy.
Keywords: homogeneous Boltzmann equation, long-range interactions, hard potentials, high order approximation.
AMS Subject Classification (2010): 35Q20, 35R11, 75P05.
1. Introduction
1.1. The Boltzmann equation
Our interest is to consider the numerical method for the spatially homogeneous Boltzmann equation with long-range interaction in the case of hard potentials. Here, the spatial homogeneity means the unknown function is assumed to be independent of the position variables. In this case, the Boltzmann equation reads:
[TABLE]
where is the distribution function of collision particles which at time move with velocity . The Boltzmann collision operator is a bilinear operator which acts only on the velocity variables , that is,
[TABLE]
Here we use the standard shorthand , , , where , are given by
[TABLE]
The nonnegative function in the collision operator is called the Boltzmann collision kernel. It is always assumed to depend only on and . We introduce the angle variable through . Without loss of generality, we may assume that is supported in the set , i.e, , for otherwise can be replaced by its symmetrized form:
[TABLE]
Here, is the characteristic function of the set .
1.2. Assumptions on the collision kernel
We consider the collision kernel satisfying the following assumptions:
- •
(A-1) The cross-section takes a product form of
[TABLE]
where both and are nonnegative functions.
- •
(A-2) The angular function is not locally integrable and it satisfies
[TABLE]
- •
(A-3) The kinetic factor takes the form of
[TABLE]
- •
(A-4) The parameter verifies that .
We remark that under assumption (A-2), we have .
The solutions of the Boltzmann equation (1.1) have the fundamental physical properties of conserving the total mass, momentum and kinetic energy, that is, for all ,
[TABLE]
Moreover, there exists a quantity called entropy satisfying the Boltzmann’s theorem, which formally is
[TABLE]
1.3. Existing results, motivations and difficulties
The well-posedness of the spatially homogeneous Boltzmann equation with angular cut-off, that is when , had been investigated by many authors. For the hard potentials, Arkeryd [8] and Mischler-Wennberg [20] established the existence and uniqueness of the solutions in weighted space. Recently, Lu-Mouhot in [14] extended the results to the space of non-negative measure with finite non-increasing kinetic energy. For the well-posedness of the spatially homogeneous Boltzmann equation without angular cut-off, we refer to [10] and the references therein. As for the regularity theory of the equation, we refer to [18] for the analysis of the positive part of the collision operator and the propagation of smoothness in the case of angular cut-off and refer to [2], [4], [13] and [19] in the case of long-range interaction.
For any , let , and be the operator associated to the angular cut-off kernel . That is,
[TABLE]
Then the angular cut-off Boltzmann equation
[TABLE]
is well-posed(see [12]). And moreover if and are solutions to the Boltzmann equation (1.1) and the cutoff Boltzmann equation (1.3) with the same initial datum respectively, then one has
[TABLE]
The cut-off Boltzmann operator omits all grazing collisions and then results in an error of order . We emphasize that the cutoff Boltzmann equation (1.3) is not a good approximation to the Boltzmann equation (1.1) as the singularity parameter approaches to .
The effect of grazing collisions has been studied extensively, and we refer to [5] and [9]. It is proved that the limit of concentrating grazing collisions leads to the Landau collision operator. Mathematically, if denote , and let be the operator associated to , according to [9], we shall have
[TABLE]
where the Landau collision operator is defined as
[TABLE]
Here the symmetrical matrix is given by
[TABLE]
where is a constant.
This motivates us to compensate the omission of grazing collisions by Landau operator. Specifically, we consider the operator
[TABLE]
and propose our approximate equation,
[TABLE]
If is the solution to equation (1.7), we will prove
[TABLE]
That is, by adding Landau operator to the cutoff Boltzmann equation, we increase the order of error from to . The accuracy of approximation of the Boltzmann equation (1.1) by equation (1.7) remains even if the singularity parameter goes to . Another motivation for studying equation (1.7) is the recent development of numerical methods. We believe that our approximate equation can be solved numerically. In this regard, see next subsection for a detailed discussion. We emphasize that the solutions of our approximate equation (1.7) also have the above mentioned properties, namely, conservation of mass, moment, energy and entropy dissipation.
In the current paper, we study the well-posedness of equation (1.7) and then give the error analysis of the approximate equation (1.7) and the original Boltzmann equation (1.1). There are two main difficulties in the current paper. One is to show the existence of a non-negative solution to equation (1.7). We proceed by constructing a sequence of convergent non-negative functions with its limit being the solution. Since we consider hard potentials (), there will be an increase of weight at each iteration. Observing the coefficient before the weight increased term is strictly less , we prove that, on a whole level, the increased weight is limited. The other difficulty is related to the estimate of the error function as defined in (4.1). Again, weight increase problem happens here and another problem is no sign information of . We circumvent the problem of lacking sign information by writing the equation of error function in a suitable way. The weight increase problem is dealt with by carefully separating the integration region such that either the increased weight is eliminated or the coefficient before the weight increased term is controlled as desired.
1.4. Existing numerical results and future work
Our approximate equation contains both the angular cut-off Boltzmann operator and Landau operator . Numerical methods of the Boltzmann equation and Landau equation have been investigated extensively. The most famous one is Kac’s program. Kac started from the Markov process corresponding to collisions only, and try to prove the limit towards the spatially homogeneous Boltzmann equation. For Kac’s program approximating Boltzmann equation, we refer to the recent work [15] and the references therein. In [15], the authors proved the propagation of chaos quantitatively in an abstract framework by proving stability and convergence estimates between linear semigroups. They then applied their results to prove the propagation of chaos of Kac’s program in the cases of hard sphere model () and true Maxwell molecules ().
As for particle system approximating the Landau equation, we refer to [8] and the references therein. The authors in [8] proved quantitatively the propagation of chaos for a -particle continuous drift diffusion process under the cases of Maxwell molecules () and hard potentials ().
As one can see from above, the Boltzmann equation corresponds to the limit of jump processes, while the Lanau equation corresponds to the limit of continuous processes. If we are to numerically solve our approximate equation (1.7), we need some jump-diffusion processes. Actually, the method in [15] is general and robust to deal with mixture of jump and diffusion processes. As shown to be successful in [16], the authors considered the Boltzmann equation for diffusively excited granular media, used jump-diffusion processes to approximate it, and then proved the propagation of chaos. The jump part is the Boltzmann operator with an integrable kernel, while the diffusive part is a Laplace operator. We know that the Landau operator behaves like the Laplace operator, except with some compensation to conserve energy.
In the recent work [7], the authors replaced the small collisions by a small diffusion term to approximate the Kac equation without cutoff, and successfully built a stochastic particle system to approximate the solution of the Kac equation without cutoff. The Kac equation is a one-dimensional case of the Boltzmann equation.
Thanks to the above breakthroughs, our approximate equation (1.7) has great potential to be solved numerically. In our future work, we will build a particle system based on equation (1.7) and prove the propagation of chaos.
1.5. Notations and main results
Let us introduce the function spaces and notations which we shall use throughout the paper.
- •
For integer , we define the Sobolev space
[TABLE]
where the multi-index with and .
- •
For real number , we define the weighted Sobolev space
[TABLE]
where , and is the pesudo-differential operator with symbol defined by
[TABLE]
- •
We also introduce the standard notations
[TABLE]
- •
For the ease of notation, let us define a new norm for any and as:
[TABLE]
If , we simply write instead of . If , we simply write instead of . Then for any .
- •
Let us define the symbol by
[TABLE]
which comes from the coercivity estimate of the cut-off Boltzmann operator .
- •
For any , we denote by the inner product of and .
- •
By , we mean that there is a uniform constant which may be different on different lines, such that . We write if both and .
We do not bother to distinguish a function and its value at a point. For example, we do not distinguish weight function and the value it takes at a point .
We recall Young’s inequality for use in future. For and , with , there holds
[TABLE]
As a result, for any , we have the basic inequality
[TABLE]
We also recall the Gronwall’s inequality. For any , and a function defined on satisfying
[TABLE]
then
[TABLE]
There is also an integral type of Gronwall’s inequality. Let be functions defined on . If is nonnegative and for any , satisfies
[TABLE]
then
[TABLE]
If, in addition, the function is non-decreasing, then
[TABLE]
Before stating our main results, let us give the definition of which is related to the weight function:
[TABLE]
where
[TABLE]
We begin with the first result concerns the propagation of the moments and smoothness for the solution to our approximate equation.
Theorem 1.1**.**
Let be the function defined as in (1.14). Let and . If with , then (1.7) admits a non-negative and unique solution in and morevover there exists a constant , depending only on and , such that for any and small enough,
[TABLE]
Remark 1.1**.**
The result of Theorem 1.1 is also true when , which corresponds to the propagation of moments and smoothness of solution of the original Boltzmann equation (1.1).
The last two theorems describe the error between solutions of the Boltzmann equation and our approximate equation.
Theorem 1.2**.**
Let such that and . Suppose with . Let and be solutions to the Boltzmann equation (1.1) and the approximated equation (1.7) with the same initial datum respectively, then we have for any ,
[TABLE]
where is a constant depending only on and time .
Let us introduce the definition of :
[TABLE]
and :
[TABLE]
Then we have:
Theorem 1.3**.**
Let and such that and . Let be functions defined as in (1.19) and (1.20). Suppose with . Let and be solutions to the Boltzmann equation (1.1) and the approximated equation (1.7) with the same initial datum respectively, then we have for any ,
[TABLE]
where is a constant depending only on and time .
1.6. Plan of the paper
In section 2, we state three estimates (upper bound, coercivity, commutator) of the operator . Section 3 is devoted to the well-posedness theory of our approximate equation, namely, uniqueness and existence of non-negative solution. In the last section, we prove the high order convergence of solutions between the Boltzmann equation and our approximate equation.
2. Estimates of the collision operators
In this section, we state three estimates of the operator , as defined in (1.6) which will used frequently in next sections. We begin with upper bound of the collision operator.
Theorem 2.1**.**
Suppose the collision kernel satisfies the Assumption (A-1)-(A-4), and is the collision operator associated to the collision kernel . Let with , with and with . Then for smooth functions and , the following estimate holds uniformly with respect to :
[TABLE]
Proof.
For the cut-off Boltzmann operator , as in [11], for any with , there holds
[TABLE]
Again from [11], we have
[TABLE]
Patching together the above two estimates, the estimate (2.1) follows accordingly. ∎
We now turn to coercivity estimate of the operator.
Theorem 2.2**.**
Suppose the collision kernel satisfies the Assumption (A-1)-(A-4), and is the collision operator associated to the collision kernel . Suppose function is nonnegative and satisfies
[TABLE]
then there exists constants and depending only on and such that
[TABLE]
Proof.
For the cut-off Boltzmann operator , with a similar argument as in [1], one has
[TABLE]
For the Landau operator , by [6], there holds
[TABLE]
The coercivity estimate (2.5) follows by noting that
[TABLE]
∎
In the last, we move to commutator estimates. We first give the commutator estimate of the cut-off Boltzmann operator as a lemma.
Lemma 2.1**.**
Suppose the collision kernel satisfies the Assumption (A-1)-(A-4), and is the collision operator associated to the collision kernel . Let and with , and let . Then for smooth functions and , the following estimate holds uniformly with respect to :
[TABLE]
Proof.
One may refer to [4] for a proof. ∎
The next lemma is the commutator estimate of the Landau operator .
Lemma 2.2**.**
Let and with . Then for smooth functions and , the following estimate holds true:
[TABLE]
where .
Proof.
We define as usual the following quantities in 3-dimension:
[TABLE]
Hence the Landau operator can be rewritten as:
[TABLE]
Then we have
[TABLE]
It is easy to check
[TABLE]
Thus we have
[TABLE]
Considering the following facts
[TABLE]
and
[TABLE]
and
[TABLE]
we arrive at
[TABLE]
Thanks to
[TABLE]
we have
[TABLE]
provided . Similarly, if , there holds
[TABLE]
With the help of the fact
[TABLE]
we have
[TABLE]
provided . Patching together the above estimates, if , we have
[TABLE]
∎
In the end of this section, we state the commutator estimate of the operator .
Theorem 2.3**.**
Suppose the collision kernel satisfies the Assumption (A-1)-(A-4), and is the collision operator associated to the collision kernel . Let and with , and let . Then for smooth functions and , the following estimate holds uniformly with respect to :
[TABLE]
Proof.
The commutator estimate (2.9) follows from lemma 2.1 and 2.2. ∎
3. Well-posedness for approximate equation (1.7): existence and uniqueness
In this section, we will show that (1.7) admits a non-negative, unique and smooth solution if the initial data is smooth. To do that, we separate the proof into three steps. In the first step, we prove that the linear equation to (1.7) admits a non-negative and smooth solution. Then in the next step, by using Picard iteration scheme, we get the well-posedness result. In the final step, we improve the well-posedness result by applying the symmetric property of the collision operators.
3.1. Well-posedness of linear equation to (1.7)
Throughout this subsection, is a fixed but small enough number. In the following, we construct a non-negative solution to the linear equation:
[TABLE]
Let us define two operators:
[TABLE]
[TABLE]
Then we have , so we call the gain operator and the loss operator.
We first give a proposition, which shall be used in both the current section and the next section.
Proposition 3.1**.**
Let , and . Suppose is the vector such that , then there holds
[TABLE]
Proof.
It is easy to check . By Taylor expansion, we have
[TABLE]
For the last term , we have for any :
[TABLE]
Together with , we arrive at
[TABLE]
For the term , we have
[TABLE]
Combining , we arrive at (3.1). ∎
We begin with an equation which shall be used to construct solution to the linear equation to (3.1).
Lemma 3.1**.**
Let be smooth functions. Suppose is the solution to the following equation
[TABLE]
Then for any .
Proof.
Denote , then we have , and
[TABLE]
Since and , it is clear that
[TABLE]
By the definition of , we have
[TABLE]
Since is a positive semi-definite matrix, we have . By assumption (A-2), there holds . Therefore, there exists such that, for any ,
[TABLE]
Finally, we arrive at
[TABLE]
Thus for any , which implies for any . ∎
Now we are ready to construct a solution to the linear equation (1.7).
Lemma 3.2**.**
Let be real numbers. Suppose the non-negative datum with . Suppose is a non-negative function satisfying
[TABLE]
*then (3.1) admits a unique non-negative solution in . *
Proof.
Define a sequence of approximate solutions by
[TABLE]
According to the previous lemma, we have .
Step 1: (Uniform Upper Bound)
Step 1.1: (Uniform Upper Bound in )
In this step, we shall use the energy method to get the uniform upper bound of norm of with respect to . Applying the basic inequality (1.10), for any , there holds
[TABLE]
Also one has
[TABLE]
Thanks to the above two facts, we obtain
[TABLE]
where . It is easy to check
[TABLE]
That is, for any , there holds
[TABLE]
Then we obtain
[TABLE]
For the Landau operator, referring to [6], there holds
[TABLE]
Patching together the above estimates, we arrive at
[TABLE]
Observing that
[TABLE]
thus we can take an small enough such that,
[TABLE]
With such a small , let us denote . Therefore, we arrive at a neater inequality on the interval ,
[TABLE]
By defining and for any and , we derive that
[TABLE]
Now denote for , by recursive derivation and noting that and , we obtain
[TABLE]
By further recursive derivation, we have
[TABLE]
Noting that
[TABLE]
and
[TABLE]
and recalling the definition of constants , we obtain
[TABLE]
Step 1.2: (Uniform Upper Bound in )
In this step, we show the uniform upper bound of norm of with respect to . It is easy to check that
[TABLE]
By Cauchy-Schwartz inequality, there holds
[TABLE]
where we have used the estimate (3.6) and the usual change of variable . By direct calculation, we have
[TABLE]
By coercivity estimate (2.6) and commutator (2.8) estimate of the Landau operator, thus we have
[TABLE]
Now patching together the inequalities (3.1), (3.14) and (3.1), and using the basic inequality (1.10), we have
[TABLE]
where are some positive constants depending on . For any , one has
[TABLE]
With the help of the above inequality, we have
[TABLE]
for some new constant . By the previous step, with the uniform upper bound of , we have
[TABLE]
where is some constant depending on and uniform upper bound of . Now we use the same technique as in the previous step. Integrating both sides with respect to time, for any , we obtain
[TABLE]
Now denote and for , by recursive derivation and noting that , we obtain, for ,
[TABLE]
By tracking the definitions of constants , we obtain
[TABLE]
Step 1.3: (Uniform Upper Bound in with )
Fix an with , one has
[TABLE]
Then we have
[TABLE]
As the same as (3.1), we have
[TABLE]
As the same as (3.14), we have
[TABLE]
When , by upper bound estimate (2.3) and commutator (2.8) estimate of the Landau operator, we have
[TABLE]
When , as the same as (3.1), we have
[TABLE]
Now patching together the above estimates and taking sum over , we have
[TABLE]
where are some positive constants depending on uniform upper bound of and uniform lower bound of . Thanks to interpolation theory and the basic inequality (1.10), for any , there exists some constant such that
[TABLE]
thus we have
[TABLE]
for some new constant . By the previous step, with the uniform upper bound of , we have
[TABLE]
where is some constant depending on and uniform upper bound of . Noticing that inequality (3.19) has exactly the same structure as inequality (3.17), we have
[TABLE]
Step 2: (Cauchy Sequence)
In this step, we prove that is a Cauchy sequence in for any . Set for . Then for , we have
[TABLE]
Because we are uncertain about the sign of , we have to introduce the sign function . Similar as in (3.1), we obtain
[TABLE]
Similar as in (3.9)
[TABLE]
For the inner product , we can approximate Landau operator by Boltzmann operators. Let for each , such that
[TABLE]
Let be the Boltzmann operator associated to the kernel , then by lemma 7.1 in [9], there holds
[TABLE]
By the uniform estimate (3.1) and our assumption on and , we have
[TABLE]
Thanks to proposition 3.1, for , we derive that
[TABLE]
For small enough, we have
[TABLE]
Thus we have
[TABLE]
and
[TABLE]
and finally
[TABLE]
With the help of the above three inequalities, we arrive at
[TABLE]
Let tend to [math], by (3.24) and the uniform estimate (3.1), we have
[TABLE]
Choose small enough such that
[TABLE]
and denote . Patch altogether (3.1), (3.1) and (3.1), we obtain
[TABLE]
For ease of notation, denote , and . Then we have a much neater inequality on the interval ,
[TABLE]
Using the same technique as in the previous step, by defining and , for and . Then for , we derive that
[TABLE]
where we have used the initial condition . Now denote for and , by recursive derivation, we obtain
[TABLE]
By previous estimates (3.1), we have
[TABLE]
For ease of notation, for , let us define
[TABLE]
Thus, by further recursive derivation, for any , we obtain
[TABLE]
where we used the fact . Note that is a geometric sequence and for any , thus we have
[TABLE]
By recalling the definitions of and , we arrive at
[TABLE]
Since the series is finite, we conclude that is a Cauchy sequence in . Due to the arbitrariness of , there is a function such that
[TABLE]
It is obvious that is the solution to (3.1). Thus the non-positivity of is ensured by the non-positivity of .
Step 3: (High Order Moments and Smoothness)
In this step, we prove the solution constructed in the previous step actually lies in . Let . By lemma 3.1 and inequality (3.8), we first have
[TABLE]
Next, according to [6], one has
[TABLE]
Therefore we have
[TABLE]
By Gronwall’s inequality, it is not difficult to derive
[TABLE]
Recalling the uniform estimate (3.1) and the convergence of in , we also have .
Step 4: (Uniqueness)
Suppose are two non-negative solutions of equation (3.1), set . Then is a solution to the following equation,
[TABLE]
Observe that the above equation is as the same as the equation (3.21) if . With the same argument until inequality (3.1), we have
[TABLE]
where and are some positive constants depending on and . Then we have
[TABLE]
which gives the uniqueness. ∎
3.2. First result on the well-posedness of approximate equation (1.7)
Based on the Picard iteration scheme, we derive that
Lemma 3.3**.**
Let be a real number and be an nonnegative integer. Let be functions defined by
[TABLE]
[TABLE]
[TABLE]
Suppose the non-negative datum with , then our approximate equation (1.7) admits a non-negative solution in for some . Moreover, if and , the solution is unique.
Proof.
Consider the sequence of functions defined by
[TABLE]
We first mention that equation (3.32) conserves mass, that is, for any and . By previous lemma, for any .
Step 1: (Uniform Upper Bound)
In this step we prove that has uniform upper bound in with respect to for some if . Thanks to proposition 3.1, for any , we have
[TABLE]
In the following, denote , then we have
[TABLE]
and
[TABLE]
where we used and . Together with , , and , we obtain
[TABLE]
Recalling (3.1), we have
[TABLE]
With (3.2) and (3.34) in hand, we have
[TABLE]
where we denote . For simplicity, denote . For any and , define
[TABLE]
and
[TABLE]
We claim that for any ,
[TABLE]
We will prove (3.36) by induction. First, it is obvious . Next, fix a , suppose , then on the interval , for any , from (3.2), we have
[TABLE]
Thus for any and , we derive that
[TABLE]
Multiplying the above inequality by and taking sum over , we obtain
[TABLE]
Observing that , we arrive at
[TABLE]
Thus we have
[TABLE]
by the definition of . That is, . Therefore the claim (3.36) is proved, which impiles
[TABLE]
Step 2: (Uniform Upper Bound)
In this step, we shall use the energy estimate to get the uniform upper bound of norm of with respect to . Fix an with , one has
[TABLE]
As before, we have
[TABLE]
By coercivity estimate (2.5) and commutator estimates (2.7), (2.8), we have
[TABLE]
By upper bound estimate (2.1) and commutator estimates (2.7), (2.8), for , we have
[TABLE]
When , by (3.2), we have
[TABLE]
By (3.38), there holds
[TABLE]
so we have
[TABLE]
Thanks to the fact
[TABLE]
we have
[TABLE]
By Gronwall’s inequality, we obtain
[TABLE]
With the help of uniform norm and the above inequality, we can prove in a similar manner as in the second step in the proof of theorem 1.1,
[TABLE]
where .
Now we turn to higher order regularity. Taking into account the fact , for the fixed , by (3.2) and (3.2), we have
[TABLE]
Thanks interpolation theory and Young’s inequality, one has
[TABLE]
[TABLE]
and finally
[TABLE]
we have used the Young’s inequality (1.10) with and . Thus we arrive at for any ,
[TABLE]
where is the uniform upper bound of and with respect to on the time interval . Here . With the same technique as in dealing with (3.2), we obtain
[TABLE]
The above inequality is true for any and , so we have the desired result
[TABLE]
Continuing the argument, there will be a function , such that
[TABLE]
Step 3: (Cauchy Sequence)
Now we are ready to prove is a Cauchy sequence in . Set for . Then for , is the solution to the following equation
[TABLE]
As the same as (3.2), we have
[TABLE]
As the same as (3.1), we have
[TABLE]
Applying proposition 3.1 again, we obtain
[TABLE]
Recalling the Landau operator can be rewritten as:
[TABLE]
we have
[TABLE]
Patch all together inequalities (3.2),(3.2),(3.2) and (3.2), we obtain
[TABLE]
where and are some constants depending at most on the uniform upper bound of , which is bounded by a constant depending on . With a similar argument as in the previous lemma, for any , we can conclude
[TABLE]
where . Thus is finite and is a Cauchy sequence in . Due to the arbitrariness of , there is a function such that
[TABLE]
In the following, we prove is a Cauchy sequence in .
Fix an with , one has
[TABLE]
Then we have
[TABLE]
As the same as (3.2), on the time interval , we have
[TABLE]
and thus
[TABLE]
As the same as (3.2), for and any , on the time interval , we have
[TABLE]
which implies, for any ,
[TABLE]
Similarly, on the time interval , we have
[TABLE]
and so for any ,
[TABLE]
Taking a suitable , we obtain
[TABLE]
Now taking sum over , we arrive at
[TABLE]
By interpolation theory, one has
[TABLE]
and
[TABLE]
where and . It is easy to check . Choosing suitable and , we have
[TABLE]
Thanks to (3.48), on the time interval , there holds
[TABLE]
where and . For ease of notation, let and
. Then we have
[TABLE]
Integrating both sides with respect to time over for any , we have
[TABLE]
Thus is finite and is a Cauchy sequence in . So there is a function such that
[TABLE]
The condition on can be summarized by the definitions of and the previous step as
[TABLE]
Under this condition, actually is a Cauchy sequence in .
It is obvious that is the solution to (1.7). Because is non-negative, the limit function is also non-negative.
Step 4: (Uniqueness)
Suppose are two non-negative solutions to (1.7). Set and . Then is a solution to the following equation,
[TABLE]
Note that the above equation is as the same as equation (3.42) if . Thus following the same argument until inequality (3.2), we have
[TABLE]
where is some constant depending on the uniform upper bound of . Note that the previous estimate holds true for . Therefore, our approximate equation (1.7) has at most one solution in the space if and .
∎
3.3. Improvement of the well-posedness result of approximate equation (1.7)
In this subsection, by using the symmetric property of the collision operators, we will prove the propagation of and norms of the solution to (1.7) and then extend the lifespan in Lemma 3.3 to be global. Thanks to Lemma 3.3, we may assume that solution to our approximate equation is non-negative and smooth. It means that in this subsection we only need to give the a priori estimates to the equation.
In order to prove the propagation of of the solution , we first give two propositions. The first proposition is related to the Boltzmann operator, while the second deals with the Landau operator.
Proposition 3.2**.**
Let and . Suppose
[TABLE]
then one has
[TABLE]
Proof.
One may refer to Lemma 3.6 in [14] for the proof. ∎
Remark 3.1**.**
Lemma 3.6 in [14] only deals with the case , however, the conclusion is also valid in the case but with a different and smaller coefficient coming out instead of the constant before the highest order .
Proposition 3.3**.**
Let and be a non-negative function, then
[TABLE]
Proof.
One may refer to [6] for the proof. ∎
Now we are ready to prove the propagation of moments and the smoothness.
Proof of Theorem 1.1: The proof will be divided into four steps.
Step 1: Propagation of the moments.
We consider the moment. Assume , for the case , the proof is similar thanks to remark 3.1. By the case By the definition of , we have
[TABLE]
The term can be written as:
[TABLE]
Let , then by proposition 3.2, we have
[TABLE]
where we have used the assumption . By interpolation, for any with , we have
[TABLE]
Using the fact , we can conclude:
[TABLE]
For the term , we apply proposition 3.3 with and obtain
[TABLE]
Let be the point such that , then for any , we have
[TABLE]
For any , there exists a constant such that
[TABLE]
Thus we have . With the preservation of mass and energy, by denoting and taking , we have
[TABLE]
Let and , by Gronwall’s inequality (1.11), we have the following:
[TABLE]
The constant depends only on , and .
Step 2: Propagation of norm.
By the definition of , we have
[TABLE]
Applying coercivity estimates of (2.5) with , we have
[TABLE]
Applying commutator estimates (2.9) with and , we have
[TABLE]
Thanks to the facts and , we have
[TABLE]
Now patching together (3.53),and (3.54), we get
[TABLE]
where the existence of is ensured by the previous step.
By applying (3.16) with , we have
[TABLE]
Thanks to Gronwall’s inequality, there exists a constant such that for any ,
[TABLE]
Inequality (1.17) is obtained in the case of .
Step 3: Propagation of norm.
We first introduce some notations for the fractional derivative. We set
[TABLE]
with and . Then there holds
[TABLE]
Due to the definition of the fractional Sobolev space, we observe that:
[TABLE]
Moreover, we also have, for and ,
[TABLE]
[TABLE]
and
[TABLE]
One may check the proof of (3.57), (3.58) and (3.3) in the appendix of [10].
Let . It is easy to check that solves the following equation:
[TABLE]
By the upper bound estimate (2.1), noting , we have
[TABLE]
which implies, for any ,
[TABLE]
By the commutator estimates (2.7) and (2.8), we have
[TABLE]
which implies, for any ,
[TABLE]
Similarly, we have
[TABLE]
which implies, for any ,
[TABLE]
Also by the upper bound estimate (2.1), we have
[TABLE]
which implies, for any ,
[TABLE]
By the coercivity estimate (2.5), we have
[TABLE]
Thanks to
[TABLE]
patching together all the above estimates, taking in (3.60),(3.3),(3.3), we arrive at, for ,
[TABLE]
where we have used the fact . Integrating both sides from [math] to with respect to time, we obtain
[TABLE]
Integrating both sides on the Ball with respect to the variable , noting that
is finite, thanks to the facts (3.56) and (3.3), taking a small enough , we derive that
[TABLE]
Using the fact , substituting into the uniform bound of and , we have
[TABLE]
Actually, inequality (3.3) holds true on any bounded interval. Therefore, for any with , we have
[TABLE]
By Gronwall’s inequality (1.12) and uniform upper bound (3.55) for integral of on any bounded interval, we arrive at
[TABLE]
Also from (3.55), we conclude that, in any unit interval , there exists at least one point such that
[TABLE]
Combining (3.69) and (3.70), we have
[TABLE]
Together with (3.3), we finally arrive at
[TABLE]
By interpolation theory, there holds
[TABLE]
where . Therefore we have
[TABLE]
Step 4: Propagation of norm when .
We prove the propagation by induction on . Let be an integer. Suppose inequality (1.17) holds true for all , we now prove that it is also valid for .
Set with , then solves
[TABLE]
By the coercivity estimate (2.5), we have
[TABLE]
By the commutator estimate (2.9), we have
[TABLE]
which implies, for any ,
[TABLE]
For the remaining terms in the right hand of (3.3) with , we split each of them into two terms:
[TABLE]
By the commutator estimate (2.9), for the case , we have
[TABLE]
which implies, for any ,
[TABLE]
For the case , we have
[TABLE]
which implies, for any ,
[TABLE]
By the upper bound estimate (2.1), for the case , we have,
[TABLE]
which implies, for any ,
[TABLE]
While for the case , we similarly have, for any ,
[TABLE]
Now choosing suitable in (3.3), in (3.77) and (3.3), and in (3.78) and (3.79), we have
[TABLE]
When , inequality (3.3) reduces to
[TABLE]
Remembering that
[TABLE]
by interpolation theory and the basic inequality (1.10), for any , we have
[TABLE]
where , and
[TABLE]
where . Taking small enough , we finally have
[TABLE]
Then by Gronwall’s inequality and the uniform upper bound (3.73) of norm, we arrive at
[TABLE]
Once again by interpolation theory, there holds
[TABLE]
where . By setting , we have
[TABLE]
When , has uniform bound by assumption. According to the interpolation inequality and the basic inequality (1.10), one has
[TABLE]
where . With the fact , we finally arrive at
[TABLE]
Then by Gronwall’s inequality and the assumed uniform bound of norm,
[TABLE]
By interpolation theory, there holds
[TABLE]
where . Now by setting , we arrive at
[TABLE]
The proof of theorem 1.1 is complete now.
Remark 3.2**.**
Since if , one can obtain lower weight requirement in the space . We use as one interpolation space just for a neat expression. For the same reason, we replace with .
4. Error estimates to the approximation
In this section, we prove the last two theorems stated in section 1. We first give a proof to theorem 1.2.
Proof of Theorem 1.2: For each , we define and respectively as follows:
[TABLE]
[TABLE]
Take the difference between equations (1.1) and (1.7), and divide both sides by , we have
[TABLE]
where
[TABLE]
We now show that norm of is bounded by the initial datum and time . According to (4.3), we have
[TABLE]
Thanks to lemma (7.1) in the Appendix of [9], we have
[TABLE]
Now we deal with , note that
[TABLE]
where
[TABLE]
and
[TABLE]
According to proposition 3.2, we have
[TABLE]
Now we turn to . Recall that
[TABLE]
where . By symmetry,
[TABLE]
Observe that the matrix is positive definite, we are only left with
[TABLE]
Split into two parts:
[TABLE]
where .
For , we have
[TABLE]
By cancellation lemma,
[TABLE]
where . For the term , apply Taylor expansion:
[TABLE]
where . For fixed , it is easy to check
[TABLE]
Thus we are only left with
[TABLE]
Set , then we have
[TABLE]
and
[TABLE]
By the change of variable: , the Jacobian matrix is
[TABLE]
with its Jacobian
[TABLE]
Thanks to , we obtain
[TABLE]
where we have used the fact .
Now we turn to . Note that
[TABLE]
First look at the term . Recall that in lemma 3.1, then we have , and thus
[TABLE]
Applying proposition 3.1 and the above equality, we obtain
[TABLE]
where . Thanks to the following fact:
[TABLE]
and , we have
[TABLE]
Due to , we obtain
[TABLE]
For the term , we have
[TABLE]
provided .
Patch the above inequalities (4.6),(4.7),(4),(4.10), and (4)-(4), for those such that , we have the following desired result:
[TABLE]
where we have used the mass conservation property: . The propagation of and norms of and allows us to conclude:
[TABLE]
Applying Gronwall’s inequality (1.11) with
and , we have
[TABLE]
We now prove theorem 1.3 in the rest of this section.
**Proof of Theorem 1.3:
**Step 1: (Case )
Taking the difference between equations (1.1) and (1.7), and dividing both sides by , we have
[TABLE]
Then we have
[TABLE]
Thanks to lemma 7.1 in the Appendix of [9], we have
[TABLE]
which implies, for any ,
[TABLE]
Splitting into two terms
[TABLE]
By coercivity estimate (2.5), we have
[TABLE]
By commutator estimate (2.9) with , we have,
[TABLE]
which implies, for any ,
[TABLE]
Splitting into two terms
[TABLE]
Applying upper bound estimate (2.1) with , we have
[TABLE]
which implies, for any ,
[TABLE]
By commutator estimate (2.9), we have
[TABLE]
which implies, for any ,
[TABLE]
Now setting in (4.17),(4.19),(4.20),(4.21), and combining with (4.18), we have
[TABLE]
Now choosing in (3.16), we have
[TABLE]
According to theorem 1.2, we have
[TABLE]
The other terms of the right hand side of (4) are also bounded by some lower order or lower weight norm of initial datum , thus we arrive at
[TABLE]
We remark that the dependence on is also at most exponential.
Step 2: (Case )
Suppose inequality (1.21) holds true for all , we now prove that it is also valid for .
Let with , then solves
[TABLE]
Therefore we have
[TABLE]
Again by lemma 7.1 in the Appendix of [9], we have
[TABLE]
which implies, for any ,
[TABLE]
Splitting into two terms, we have
[TABLE]
By coercivity estimate (2.5), we have
[TABLE]
For , by upper bound estimate (2.1) with , we have
[TABLE]
which implies, for any ,
[TABLE]
By commutator estimates (2.9) with , we have
[TABLE]
which implies, for any ,
[TABLE]
Splitting into two terms, we have
[TABLE]
Applying upper bound estimate (2.1) with , we may have
[TABLE]
which implies, for any ,
[TABLE]
By commutator estimate (2.9) with , we have
[TABLE]
which implies, for any ,
[TABLE]
Patching all together (4.25),(4.26),(4.27),(4.28),(4.29),(4.30), and taking small enough, we arrive at
[TABLE]
Let . Summing over , by taking , we have
[TABLE]
Thanks to (3.81), we may conclude
[TABLE]
By theorem 1.1 and remark 1.1, for any , we have
[TABLE]
By assumption, there holds
[TABLE]
On the other hand, by interpolation, we have
[TABLE]
where . By defining , we have
[TABLE]
Acknowledgments. The authors thank the first 2016 exchange program between Hong Kong and the mainland of China, supported by the Ministry of education of the People’s Republic of China. They also express their gratitude to the Department of Mathematical Sciences of Tsinghua University and the Department of Mathematics of Hong Kong Baptist University for the kindly hospitality.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Alexandre, L. Desvillettes, C. Villani, and B. Wennberg, Entropy dissipation and long- range interactions, Arch. Ration. Mech. Anal. 152 (2000), no. 4, 327-355.
- 2[2] R. Alexandre, Y. Morimoto, S. Ukai, C.-J. Xu, and T. Yang, Smoothing effect of weak solutions for the spatially homogeneous Boltzmann equation without angular cutoff, Kyoto J. Math. 52 (2012), no. 3, 433-463.
- 3[3] L. Arkeryd, On the Boltzmann equation, Arch. Rational Mech. Anal. 45 (1972), 1-34.
- 4[4] Y. Chen and L. He, Smoothing estimates for Boltzmann equation with full-range interactions I: spatially homogeneous case, Arch. Ration. Mech. Anal. 201 (2011), no. 2, 501-548.
- 5[5] L. Desvillettes, On asymptotics of the Boltzmann equation when the collisions become grazing, Transp. Theory Stat. Phys. 21(3) (1992), 259–276.
- 6[6] L. Desvillettes, C. Villani, On the spatially homogeneous landau equation for hard potentials part i: existence, uniqueness and smoothness., Comm. Partial Differential Equations 25.1-2 (2000), 179-259.
- 7[7] N. Fournier and D. Godinho, Asymptotic of grazing collisions and particle approximation for the Kac equation without cutoff, Commun. Math. Phys. 316.2 (2012), 307-344.
- 8[8] N. Fournier and A. Guillin, From a Kac-like particle system to the Landau equation for hard potentials and Maxwell molecules, ar Xiv preprint ar Xiv:1510.01123 , (2015).
