Math 2.0

Statistical mechanics, structure of matter Kinetic theory Theorem

Lanford's theorem on the Boltzmann–Grad limit

Builds on Boltzmann equationBBGKY hierarchyHard spheresMean free path

Statement

For ε>0\varepsilon > 0, consider NN hard spheres of diameter ε\varepsilon in ℝ3\R^3, moving freely between collisions and colliding elastically. Assume the Boltzmann–Grad scaling Nε2=1N \varepsilon^2 = 1 as N→∞N \to \infty. Let f0 ⁣:ℝ3×ℝ3→[0,∞)f_0 \colon \R^3 \times \R^3 \to [0, \infty) be a continuous probability density with a Gaussian bound f0(x,v)≤Ce−β∣v∣2/2f_0(x, v) \le C e^{-\beta \abs{v}^2/2} for some constants C,β>0C, \beta > 0. Let the initial law of the NN particles be the product density f0⊗Nf_0^{\otimes N}, conditioned on the event that no two spheres overlap. Let fN(1)(t)f_N^{(1)}(t) be the one-particle marginal of the law of the particles at time tt. Then there is a time T>0T > 0, depending only on CC and β\beta, such that for every t∈[0,T]t \in [0, T]:

  1. fN(1)(t)f_N^{(1)}(t) converges almost everywhere to f(t)f(t) as N→∞N \to \infty. Here ff is the solution on [0,T][0, T] of the Boltzmann equation for hard spheres with initial value f0f_0.
  2. for each fixed ss, the ss-particle marginal converges almost everywhere to f(t)⊗sf(t)^{\otimes s}.

Remarks

Oscar Lanford proved the theorem in 1975; Isabelle Gallagher, Laure Saint-Raymond and Bela Texier later gave a complete version of the proof with explicit convergence rates. The scaling Nε2=1N \varepsilon^2 = 1 keeps the mean free path of order 11, while the volume fraction occupied by the spheres, of order Nε3=εN \varepsilon^3 = \varepsilon, tends to 00.

Idea of the proof: the marginals solve the BBGKY hierarchy of hard spheres, whose collision terms involve particles at distance ε\varepsilon. In the limit the hierarchy becomes the Boltzmann hierarchy, which the tensor powers f(t)⊗sf(t)^{\otimes s} solve. Both hierarchies are expanded in Duhamel series of collision trees, and these series converge on a short time interval uniformly in NN. The remaining work is to show that the trajectories with recollisions, which do not appear in the Boltzmann hierarchy, have a vanishing contribution.

Part 2 is called propagation of chaos: particles that were independent at time 00 stay asymptotically independent. It justifies the molecular chaos assumption that Boltzmann used, and so explains how the irreversible Boltzmann equation arises from reversible dynamics, the answer to Loschmidt's paradox in this setting. The restriction to a short time TT, a fraction of the mean free time, comes from the convergence of the series expansion used in the proof.

Going deeper

For a student

The theorem is the main rigorous derivation of a kinetic equation from particle dynamics. It connects the BBGKY hierarchy with the Boltzmann equation through the limit N→∞N \to \infty, ε→0\varepsilon \to 0, Nε2N \varepsilon^2 fixed. The limit is irreversible, as the H-theorem shows. This is consistent with reversible dynamics, because the convergence holds for chaotic initial data and in the sense of marginals, not along every trajectory.

Reading path

To understand this page from the ground up, read these 7 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. BBGKY hierarchy concept
  2. Boltzmann equation concept
  3. Canonical ensemble concept
  4. Mayer f-function concept
  5. Mean free path concept
  6. Hard spheres example
  7. Lanford's theorem on the Boltzmann–Grad limit statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Boltzmann_equation
About this page
TagK5RQMXS3FJ
URIm2://K5RQMXS3FJ
Kindstatement, theorem
WritingW0 stub
MSC82C40, 35Q20, 82C05
StatusThis copy of the site has no build data. Run m2 status K5RQMXS3FJ.
AboutBoltzmann equation
UsesBoltzmann equation, BBGKY hierarchy, Hard spheres, Mean free path
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.