A recursive algorithm and a series expansion related to the homogeneous Boltzmann equation for hard potentials with angular cutoff
Nicolas Fournier

TL;DR
This paper introduces a recursive algorithm and a series expansion for the homogeneous Boltzmann equation with hard potentials, providing explicit representations of solutions based on initial data, though practical efficiency is limited.
Contribution
It presents a novel recursive algorithm and a series expansion for solutions to the Boltzmann equation with hard potentials, extending Wild's sum to non-Maxwellian molecules.
Findings
The recursive algorithm produces a random variable representing the solution.
The series expansion explicitly expresses the solution in terms of initial data.
Both methods are theoretically interesting but may be impractical for computations.
Abstract
We consider the spatially homogeneous Boltzmann equation for hard potentials with angular cutoff. This equation has a unique conservative weak solution , once the initial condition with finite mass and energy is fixed. Taking advantage of the energy conservation, we propose a recursive algorithm that produces a random variable such that . We also write down a series expansion of . Although both the algorithm and the series expansion might be theoretically interesting in that they explicitly express in terms of , we believe that the algorithm is not very efficient in practice and that the series expansion is rather intractable. This is a tedious extension to non-Maxwellian molecules of Wild's sum and of its interpretation by McKean.
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.
A recursive algorithm and a series expansion related to the homogeneous Boltzmann equation for hard potentials
with angular cutoff
Nicolas Fournier
N. Fournier: Laboratoire de Probabilités et Modèles aléatoires, UMR 7599, UPMC, Case 188, 4 pl. Jussieu, F-75252 Paris Cedex 5, France.
Abstract.
We consider the spatially homogeneous Boltzmann equation for hard potentials with angular cutoff. This equation has a unique conservative weak solution , once the initial condition with finite mass and energy is fixed. Taking advantage of the energy conservation, we propose a recursive algorithm that produces a random variable such that . We also write down a series expansion of . Although both the algorithm and the series expansion might be theoretically interesting in that they explicitly express in terms of , we believe that the algorithm is not very efficient in practice and that the series expansion is rather intractable. This is a tedious extension to non-Maxwellian molecules of Wild’s sum [18] and of its interpretation by McKean [10, 11].
Key words and phrases:
Kinetic equations, Numerical resolution, Wild’s sum.
2000 Mathematics Subject Classification:
82C40,60K35
1. Introduction
We consider a spatially homogeneous gas modeled by the Boltzmann equation: the density of particles with velocity at time solves
[TABLE]
where
[TABLE]
The cross section is a nonnegative function given by physics. We refer to Cercignani [4] and Villani [16] for very complete books on the subject. We are concerned here with hard potentials with angular cutoff: the cross section satisfies
[TABLE]
The important case where and is constant corresponds to a gas of hard spheres. If , the cross section is velocity independent and one talks about Maxwellian molecules with cutoff.
We classically assume without loss of generality that the initial mass and we denote by the initial kinetic energy. It is then well-known, see Mischler-Wennberg [12], that (1) has a unique weak solution such that for all , is a probability density on with energy . Some precise statements are recalled in the next section.
In the whole paper, we denote, for a topological space, by (resp. ) the set of probability measures (resp. nonnegative measures) on endowed with its Borel -field . For and , we put
[TABLE]
does not depend on and is given by . If , then we have , see (2), so that the definition of is not important, we can e.g. set .
In the rest of this introduction, we informally recall how (1) can be solved, in the case of Maxwellian molecules, by using the Wild sum, we quickly explain its interpretation by McKean, and we write down a closely related recursive simulation algorithm. We also recall that Wild’s sum can be used for theoretical and numerical analysis of Maxwellian molecules. Then we briefly recall how the Wild sum and the algorithm can be easily extended to the case of any bounded cross section, by introducing fictitious jumps. Finally, we quickly explain our strategy to deal with hard potentials with angular cutoff.
1.1. Wild’s sum
Let us first mention that some introductions to Wild’s sum and its probabilistic interpretation by McKean can be found in the book of Villani [16, Section 4.1] and in Carlen-Carvalho-Gabetta [1, 2]. Wild [18] noted that for Maxwellian molecules, i.e. when , so that the cross section does not depend on the relative velocity, (1) rewrites
[TABLE]
where, for two probability densities on , .
It holds that is also a probability density on , that can be interpreted as the law of , where and are two independent -valued random variables with densities and and where is, conditionally on , a -distributed -valued random variable. Wild [18] proved that given , the solution to (1) is given by
[TABLE]
where is defined recursively by and, for , by
[TABLE]
McKean [10, 11] provided an interpretation of the Wild sum in terms of binary trees, see also Villani [16] and Carlen-Carvalho-Gabetta [1]. Let be the set of all discrete finite rooted ordered binary trees. By ordered, we mean that each node of with two children has a left child and a right child. We denote by the number of leaves of . If is the trivial tree (the one with only one node: the root), we set . If now , we put , where (resp. ) is the subtree of consisting of the left (resp. right) child of the root with its whole progeny. Then (8) can be rewritten as
[TABLE]
In words, (9) can be interpreted as follows. For each , the term is the probability that a typical particle has as (ordered) collision tree, while is the density of its velocity knowing that it has as (ordered) collision tree.
Finally, let us mention a natural algorithmic interpretation of (1) closely related to (9). The dynamical probabilistic interpretation of Maxwellian molecules, initiated by Tanaka [15], can be roughly summarized as follows. Consider a typical particle in the gas. Initially, its velocity is -distributed. Then, at rate , that is, after an Exp-distributed random time , it collides with another particle: its velocity is replaced by , where is the velocity of an independent particle undergoing the same process (stopped at time ) and is a -distributed -valued random variable. Then, at rate , it collides again, etc. This produces a stochastic process such that for all , is -distributed.
Consider now the following recursive algorithm.
Function velocity:
.. Simulate a -distributed random variable , set .
.. While do
.. .. simulate an exponential random variable with parameter ,
.. .. set ,
.. .. if , do
.. .. .. set velocity,
.. .. .. simulate a -distributed -valued random variable ,
.. .. .. set ,
.. .. end if,
.. end while.
.. Return velocity.
Of course, each new random variable is simulated independently of the previous ones. In particular, line 7 of the algorithm, all the random variables required to produce velocity are independent of all that has already been simulated.
Comparing the above paragraph and the algorithm, it appears clearly that velocity produces a -distributed random variable. We have never seen this fact written precisely as it is here, but it is more or less well-known folklore. In the present paper, we will prove such a fact, in a slightly more complicated situation.
In spirit, the algorithm produces a binary ordered tree: each time the recursive function calls itself, we add a branch (on the right). So it is closely related to (9) and, actually, one can get convinced that velocity is precisely an algorithmic interpretation of (9). But entering into the details would lead us to tedious and technical explanations.
1.2. Utility of Wild’s sum
The Wild sum has often been used for numerical computations: one simply cutoffs (8) at some well-chosen level and, possibly, adds a Gaussian distribution with adequate mean and covariance matrix to make it have the desired mass and energy. See Carlen-Salvarini [3] for a very precise study in this direction. And actually, Pareschi-Russo [13] also managed to use the Wild sum, among many other things, to solve numerically the inhomogeneous Boltzmann equation for non Maxwellian molecules.
A completely different approach is to use a large number of times the perfect simulation algorithm previously described to produce some i.i.d. -distributed random variables , and to approximate by . We believe that this is not very efficient in practice, especially when compared to the use of a classical interacting particle system in the spirit of Kac [8], see e.g. [7]. The main reason is that the computational cost of the above perfect simulation algorithm increases exponentially with time, while the one of Kac’s particle system increases linearly. So the cost to remove the bias is disproportionate. See [6] for such a study concerning the Smoluchowski equation, which has the same structure (at the rough level) as the Boltzmann equation.
The Wild sum has also been intensively used to study the rate of approach to equilibrium of Maxwellian molecules. This was initiated by McKean [10], with more recent studies by Carlen-Carvalho-Gabetta [1, 2], themselves followed by Dolera-Gabetta-Regazzini [5] and many other authors.
1.3. Bounded cross sections
If with bounded, e.g. by , we can introduce fictitious jumps to write (1) as , with , where and something similar for . Hence all the previous study directly applies, but the resulting Wild sum does not seem to allow for a precise study the large time behavior of , because it leads to intractable computations.
1.4. Hard potentials with angular cutoff
Of course, the angular cutoff (that is, we assume that ) is crucial to hope for a perfect simulation algorithm and for a series expansion in the spirit of Wild’s sum. Indeed, implies that a particle is subjected to infinitely many collisions on each finite time interval. So our goal is to extend, at the price of many complications, the algorithm and series expansion to hard potentials with cutoff. Since the cross section is unbounded in the relative velocity variable, some work is needed.
We work with weak forms of PDEs for simplicity. First, it is classical, see e.g. [16, Section 2.3] that a family is a weak solution to (1) if it satisfies, for all reasonable ,
[TABLE]
As already mentioned, one also has , so that belongs to for all . A simple computation shows that, for all reasonable ,
[TABLE]
This equation enjoys the pleasant property that the maximum rate of collision, given by , is finite. Hence, up to some fictitious jumps, one is able to predict when a particle will collide from its sole velocity, knowing nothing of the environment represented by . The function is not bounded as a function of , since it resembles , but, as we will see, this it does not matter too much. On the contrary, the presence of in front of the gain term is problematic. It means that, in some sense, particles are not all taken into account equally. To overcome this problem, we consider an equation with an additional weight variable . So we search for an equation, resembling more the Kolmogorov forward equation of a nonlinear Markov process, of which the solution would be such that for all times. Then, one would recover the solution to (1) as . All this is doable and was our initial strategy. However, we then found a more direct way to proceed: taking advantage of the energy conservation, it is possible to build an equation of which the solution is such that for all . And this equation is of the form
[TABLE]
Here is any (explicit) function dominating , the additional variable is here to allow for fictitious jumps, and the post-collisional characteristics , depending on are precisely defined in the next section. The perfect simulation algorithm for such an equation is almost as simple as the one previously described, except that the rate of collision now depends on the state of the particle. On the contrary, this state-dependent rate complicates subsequently the series expansion because the time and phase variables do not separate anymore.
1.5. Plan of the paper
In the next section, we expose our main results: we introduce an equation with an additional variable , state that this equation has a unique solution that, once integrated in , produces the solution to (1). We then propose an algorithm that perfectly simulates an -distributed random variable, we write down a series expansion for in the spirit of (9) and discuss briefly the relevance of our results. The proofs are then handled: the algorithm is studied in Section 3, the series expansion established in Section 4, well-posedness of the equation solved by is checked in Section 5, and the link between and shown in Section 6.
2. Main results
2.1. Weak solutions
We use a classical definition of weak solutions, see e.g. [16, Section 2.3].
Definition 1**.**
Assume (6) and recall (7). A measurable family is a weak solution to (1) if for all , and for all ,
[TABLE]
where .
Everything is well-defined in (10) by boundedness of mass and energy and since .
For any given such that , the existence of unique weak solution starting from is now well-known. See Mischler-Wennberg [12] when has a density and Lu-Mouhot [9] for the general case. Let us also mention that the conservation assumption is important in Definition 1, since Wennberg [17] proved that there also solutions with increasing energy.
2.2. An equation with an additional variable
We fix and define, for ,
[TABLE]
For and , we put
[TABLE]
We also introduce and, for and in and ,
[TABLE]
with a small abuse of notation. We finally consider, for and in ,
[TABLE]
which is a measure on with total mass , see (6).
Definition 2**.**
Assume (6). A measurable family is said to solve (A) if for all , , and for all , all ,
[TABLE]
where .
All is well-defined in (11) thanks to the conditions on and since (with the notation ). As already mentioned in the introduction, the important point is that the function does not depend on . Hence a particle, when in the state , jumps at rate , independently of everything else.
Proposition 3**.**
Assume (6). For any such that , (A) has exactly one solution starting from .
We will also verify the following estimate.
Remark 4**.**
Assume (6). A solution to (A) satisfies .
Finally, the link with the Boltzmann equation is as follows.
Proposition 5**.**
Assume (6). Let such that and let be the solution to (A). Introduce, for each , the nonnegative measure on defined by for all . If and if the quantity used to define the coefficients of (A) is precisely , then is the unique weak solution to (1) starting from .
2.3. A perfect simulation algorithm
We consider the following procedure.
Algorithm 6**.**
Fix and . For any we define the following recursive function, of which the result is some -valued random variable.
function (value,counter):
.. Simulate a -distributed random variable , set and .
.. While do
.. .. simulate an exponential random variable with parameter ,
.. .. set ,
.. .. if , do
.. .. .. set (value,counter),
.. .. .. simulate with law ,
.. .. .. set ,
.. .. .. set ,
.. .. end if,
.. end while.
.. Return value and counter. **
Of course, each time a new random variable is simulated, we implicitly assume that it is independent of everything that has already been simulated. In particular, line 7 of the procedure, all the random variables used to produce (value,counter) are independent of all the random variables already simulated. By construction, counter is precisely the number of times the recursive function calls itself.
Proposition 7**.**
Assume (6). Fix such that and fix . Algorithm 6 a.s. stops and thus produces a couple of random variables. The -valued random variable is -distributed, where is the solution to (A) starting from . The -valued random variable satisfies .
2.4. A series expansion
We next write down a series expansion of , the solution to (A), in the spirit of Wild’s sum (9). Unfortunately, the expressions are more complicated, because the time () and phase () variables do not separate. This is due to the fact that the jump rate depends on the state of the particle.
For in , we define by, for all Borel subset ,
[TABLE]
Observe that (11) may be written, at least formally, , provided is a probability measure on for all . Also, note that in general.
For , consider the measurable family defined by
[TABLE]
for all Borel subset .
We finally consider the set of all finite binary (discrete) ordered trees: such a tree is constituted of a finite number of nodes, including the root, each of these nodes having either [math] or two children (ordered, in the sense that a node having two children has a left child and a right child). We denote by the trivial tree, composed of the root as only node.
Proposition 8**.**
Assume (6). Let such that . The unique solution to (A) starting from is given by
[TABLE]
with defined by induction: and, if ,
[TABLE]
where (resp. ) is the subtree of consisting of the left (resp. right) child of the root with its whole progeny.
We will prove this formula by a purely analytic method. We do not want to discuss precisely its connection with Algorithm 6, but let us mention that in spirit, the algorithm produces a (random) ordered tree of interactions together with the value of , and that can be interpreted as the probability distribution of restricted to the event that .
2.5. Conclusion
Fix such that and set , which satisfies .
(a) Gathering Propositions 7 and 5, we find that Algorithm 6 used with and with produces a random variable , with such that for all , where is the unique weak solution to (1) starting from . Also, the mean number of iterations is bounded by .
Indeed, we know from Proposition 7 that . But we have , which is smaller than by Remark 4.
(b) Gathering Propositions 8 and 5, we conclude that for all , all Borel subset , we have .
2.6. Discussion
It might be possible to prove Proposition 5 assuming only that satisfies instead of , since the Boltzmann equation (1) is known to be well-posed as soon as the initial energy is finite, see [12, 9]. However, it would clearly be more difficult and our condition is rather harmless.
Observe that (A) is well-posed under the condition that satisfies , which does not at all imply that . But, recalling that the has to be finite for the coefficients of (A) to be well-defined, this is not very interesting.
The series expansion of Proposition 8 is of course much more complicated than the original Wild sum, since (a) we had to add the variable , (b) we had to introduce fictitious jumps, (c) time and space do not separate. So it is not clear whether the formula can be used theoretically or numerically. However, it provides an explicit formula expressing as a (tedious) function of .
Algorithm 6 is extremely simple. Using it a large number of times, which produces some i.i.d. sample , we may approximate by . For a central limit theorem to hold true, one needs to be finite. We do not know if this holds true, although we have some serious doubts. Hence the convergence of this Monte-Carlo approximation may be much slower that . The main interest of Algorithm 6 is thus theoretical.
3. The algorithm
Here we prove Proposition 7. We fix such that , which implies that . When Algorithm 6 never stops, we take the convention that it returns (value,counter)=, where is a cemetery point. For each , we denote by the law of the random variable produced by Algorithm 6. Also, for , and , we take the conventions that and . We arbitrarily define, for , .
Step 1. We now consider the following procedure. It is an abstract procedure, because it assumes that for each , one can simulate a random variable with law and because the instructions are repeated ad infinitum if the cemetery point is not attained.
Simulate a -distributed random variable , set and .
While do ad infinitum
.. simulate an exponential random variable with parameter ,
.. set and for all ,
.. set ,
.. set (value,counter), with if it never stops,
.. simulate with law ,
.. set ,
.. set ,
end while.
If , set and for all .
Observe that in the last line, we may have either because after a finite number of steps, the simulation of with law has produced , or because we did repeat the loop ad infinitum, but the increasing process became infinite in finite time.
At the end, this produces a process and one easily gets convinced that for each , is -distributed. Indeed, if one extracts from the above procedure only what is required to produce (for some fixed ), one precisely re-obtains Algorithm 6 if (and in this case Algorithm 6 stops), while implies that Algorithm 6 never stops.
By construction, the process is a time-inhomogeneous (possibly exploding) Markov process with values in with generator , absorbed at if this point is reached and set to after explosion if it explodes, where
[TABLE]
for all , all , all and all .
Step 2. Here we handle a preliminary computation: for all , we have
[TABLE]
Writing , and recalling Subsection 2.2, equals
[TABLE]
But , see (2), so that , whence
[TABLE]
because .
Step 3. We now prove that actually does not explode nor reach the cemetery point, that and that .
For , we introduce . The process does not explode nor reach the cemetery point during , so that we can write, with , (recall that and that is a.s. non-decreasing),
[TABLE]
Since , we deduce that
[TABLE]
because is -distributed. We thus find
[TABLE]
whence, by the Gronwall lemma,
[TABLE]
We next choose and write, as previously,
[TABLE]
whence
[TABLE]
But equals
[TABLE]
whence by (12) and since . Finally, we have checked that whence
[TABLE]
Gathering (13) and (14) and letting increase to infinity, we first conclude that for all . In particular, a.s. for all , and the process does a.s. not explode and never reach . Consequently, by (14). Finally, we easily conclude from (13) that .
Step 4. By Step 3, we know that (which is the law of ) is actually supported by for all . Hence Algorithm 6 a.s. stops. The process is thus an inhomogeneous Markov with generator defined, for , by
[TABLE]
and we thus have
[TABLE]
Let now be the law of (so is the first marginal of ). It starts from and solves (A). Indeed, is locally bounded by Step 3 and for all , applying the above equation with , we find , so that
[TABLE]
as desired. Finally, we have already seen in Step 3 that . We have proved Proposition 7, as well as the existence part of Proposition 3.
4. Series expansion
The goal of this section is to prove Proposition 8. We thus consider such that . To shorten notation, we set .
Step 1. Here we check that for all , all , . We work by induction. First, since , we find that for all , which is finite by assumption. Next, we fix , , we consider and as in the statement, we assume by induction that and and prove that . We start from
[TABLE]
But it follows from (12) that , whence
[TABLE]
We finally used that for , . Next, by the Fubini theorem,
[TABLE]
so that as desired.
Step 2. We deduce from Step 1 that for all ,
[TABLE]
is locally bounded.
Step 3. We fix and denote by the finite set of all ordered binary trees with at most nodes. We introduce . By Step 2, we know that is locally bounded. We claim that for all , all ,
[TABLE]
whence in particular . Indeed, we first observe that
[TABLE]
and then that, for ,
[TABLE]
Since by definition, the result follows.
Step 4. Differentiating (15), we find that for all , all ,
[TABLE]
The differentiation is easily justified, using that is bounded, that is locally bounded, as well as for all , and that for ,
[TABLE]
Step 5. Here we verify that and that for all . First observe that if is nonnegative, then
[TABLE]
We used that the map is injective from into , as well as the bilinearity of . Consequently, by (16),
[TABLE]
For the last equality, we used that for any , we have
[TABLE]
Applying (17) with , we see that
[TABLE]
Since and since is locally bounded, we conclude that for all (because ).
Applying next (17) with and using that , we find that
[TABLE]
because , see (12). Since and since, again, , we conclude that .
Step 6. By Step 5, the series of nonnegative measures converges, satisfies , and we know that is locally bounded. Passing to the limit in the time-integrated version of (16), we find that for all , all ,
[TABLE]
To justify the limiting procedure, it suffices to use that is locally bounded, as well as , which equals . We used that the map is bijective from into , as well as the bilinearity of . By the same way, (19) rewrites as
[TABLE]
see (18). To conclude that solves (A), it only remains to verify that is locally bounded, which follows from the fact that , and that for all . Applying the previous equation with (for which ), we find that , where is locally bounded. Hence for all by the Gronwall lemma. The proof of Proposition 8 is complete.
5. Well-posedness of (A)
We have already checked (twice) the existence part of Proposition 3. We now turn to uniqueness. Let us consider two solutions and to (A) with . By assumption, we know that is locally bounded. Hence, setting , we have for all .
We use the total variation distance where . We also have , where for a finite signed measure on , with the usual definitions of and .
We fix such that and we use Definition 2 to write
[TABLE]
where and .
Using only that , we get
[TABLE]
We next recall that and that and we write
[TABLE]
Since now is a nonnegative measure bounded by , we may write, for any ,
[TABLE]
All this proves that , whence
[TABLE]
Integrating in time (recall that ) and taking the supremum over such that , we find
Recall the following generalized Gronwall lemma: if we have three locally bounded nonnegative functions such that for all , then . Applying this result with , and , we get
[TABLE]
so that . Recalling that is locally bounded and that tends to [math] as , we conclude that , which was our goal. The proof of Proposition 3 is now complete.
We end this section with the
Proof of Remark 4.
We fix and apply (11) with , which belongs to . With the notation and , we find
[TABLE]
But a simple computation, recalling (2) and using that
[TABLE]
where (recall (7)) shows that
[TABLE]
where . Hence,
[TABLE]
where . One can check that if and it always holds true that . At the end, . Consequently, applying (11) and using a symmetry argument,
[TABLE]
Letting and using that (which follows from the fact that ), we conclude that . ∎
6. Relation between (A) and the Boltzmann equation
It remains to prove Proposition 5. In the whole section, we consider the solution to (A) starting from some such that . We define the nonnegative measure on by for all and we assume that and that , where was used in Subsection 2.2 to build the coefficients of (A). We want to prove that is a weak solution to (1).
The main difficulty is to establish properly the following estimate, of which the proof is postponed at the end of the section.
Lemma 9**.**
For any , .
Next, we handle a few preliminary computations.
Remark 10**.**
(i) For all of the form with , using the notation and , it holds that
[TABLE]
(ii) Assume furthermore that there is such that for all , . Then .
Proof.
For (i), it suffices to write
[TABLE]
where
[TABLE]
which equals , and where
[TABLE]
For point (ii), we first observe that , because , see (2). Using next that and that , we thus find
[TABLE]
from which the conclusion easily follows. ∎
We now can give the
Proof of Proposition 5.
For any such that , we can apply (11) with . To check it it properly, first apply (11) with with and let . This essentially relies on the facts that
by Remark 10-(ii) (with ), whence and
is locally bounded by Lemma 9 and Definition 2.
So, applying (11) and using the formula of Remark 10-(i), we find
[TABLE]
This precisely rewrites, by definition of ,
[TABLE]
where .
But, with , recalling (20), it holds that
[TABLE]
Hence applying (21) and using a symmetry argument, we find
[TABLE]
Hence for all by the Gronwall Lemma, because and are locally bounded by Lemma 9.
Coming back to (21), we thus see that for all ,
[TABLE]
To complete the proof, it only remains to prove that for all , which follows from the choice (for which ), and to check that for all , which holds true because . ∎
It only remains to prove Lemma 9.
Proof of Lemma 9.
The proof relies on the series expansion , see Proposition 8. We write for simplicity. We will make use of the functions , and .
Step 1. Here we verify that for all , all , . We proceed by induction as in the proof of Proposition 8, Step 1. First, by assumption. Next, we fix , , we assume by induction that and and prove that . We start from
[TABLE]
But we see from Remark 10-(ii) (with ) that
[TABLE]
Together with the Fubini theorem, this gives us
[TABLE]
We conclude by induction and since we already know from Step 1 of the proof of Proposition 8 that for all .
Step 2. For , we define as in the proof of Proposition 8, Step 3. We know that and that for all nonnegative , see (17) and recall that ,
[TABLE]
Also, we immediately deduce from Step 1 that is locally bounded, as well as , see Step 2 of the proof of Proposition 8. It is then easy to extend (23) to any function of the form , with . This follows from the fact that, by Remark 10-(ii) (with ),
[TABLE]
Step 3. We now verify that for all . To this end, we apply (23) with for which, by Remark 10-(i),
[TABLE]
where . Using that (recall (22)) and a symmetry argument, we find that
[TABLE]
Setting and , we know that and are locally bounded by Step 2 (because ) and that . This implies that for all , which was our goal.
Step 4. We finally apply (23) with . By Remark 10, we see that, with ,
[TABLE]
Hence
[TABLE]
by Step 3. We next recall a Povzner lemma [14] in the version found in [12, Lemma 2.2-(i)]: for , setting , there is a such that for all , . Actually, the result of [12] is much stronger. Since and since , we conclude that
[TABLE]
so that
[TABLE]
Finally, using twice a symmetry argument,
[TABLE]
by Step 3 again. Hence by the Gronwall lemma. It then suffices to let increase to infinity, by monotone convergence, to complete the proof. ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] E.A. Carlen, M.C. Carvalho, E. Gabetta , Central limit theorem for Maxwellian molecules and truncation of the Wild expansion , Comm. Pure Appl. Math. 53 (2000), 370–397.
- 2[2] E.A. Carlen, M.C. Carvalho, E. Gabetta , On the relation between rates of relaxation and convergence of Wild sums for solutions of the Kac equation , J. Funct. Anal. 220 (2005), 362–387.
- 3[3] E.A. Carlen, F. Salvarani , On the optimal choice of coefficients in a truncated Wild sum and approximate solutions for the Kac equation , J. Statist. Phys. 109 (2002), 261–277.
- 4[4] C. Cercignani , The Boltzmann equation and its applications. Applied Mathematical Sciences, 67. Springer-Verlag, New York, 1988.
- 5[5] E. Dolera, E. Gabetta, E. Regazzini , Reaching the best possible rate of convergence to equilibrium for solutions of Kac’s equation via central limit theorem , Ann. Appl. Probab. 19 (2009), 186-209.
- 6[6] N. Fournier, J.S. Giet , Exact simulation of nonlinear coagulation processes , Monte Carlo Methods Appl., 10 (2004), 95–106.
- 7[7] N. Fournier, S. Méléard , A stochastic particle numerical method for 3D Boltzmann equations without cutoff , Math. Comp. 71 (2002), 583–604.
- 8[8] M. Kac , Foundations of kinetic theory , Proceedings of the Third Berkeley Symposium on Mathematical Statistics and Probability, 1954–1955, vol. III, pp. 171–197. University of California Press, 1956.
