propagation of chaos and return to equilibrium for kac s
play

Propagation of chaos and return to equilibrium for Kacs random walks - PowerPoint PPT Presentation

Propagation of chaos and return to equilibrium for Kacs random walks Cl ement Mouhot, University of Cambridge The Abel Symposium, Oslo, 21th of august, 2012 Joint w/ Mischler (+Wennberg, Marahrens) Plan I. From microscopic to macroscopic


  1. Propagation of chaos and return to equilibrium for Kac’s random walks Cl´ ement Mouhot, University of Cambridge The Abel Symposium, Oslo, 21th of august, 2012 Joint w/ Mischler (+Wennberg, Marahrens)

  2. Plan I. From microscopic to macroscopic evolutions II. Probabilistic foundation of kinetic theory III. The main results IV. The functional framework V. Sketch of the proof of the abstract stability result VI. Entropic chaos and relaxation rate VII. Statistical stability and the BBGKY hierarchy

  3. The problem at hand ◮ How to derive rigorously macroscopic evolution equations in terms of the microscopic laws? ◮ → Foundation of continuum mechanics (Hilbert 6-th pb) ◮ Statistical mechanics and kinetic theory for large number of particles as an intermediate step ◮ → Foundation of kinetic theory? The investigations on the foundations of geometry suggest the problem: To treat in the same manner, by means of axioms, those physical sciences in which mathematics plays an important part; in the first rank are the theory of probabilities and mechanics. [. . . ] Thus Boltzmann’s work on the principles of mechanics suggests the problem of developing mathematically the limiting processes, there merely indicated, which lead from the atomistic view to the laws of motion of continua .

  4. The (Maxwell)-Boltzmann equation (1867-1872) ∂ t f + v · ∇ x f = Q ( f , f ) on f ( t , x , v ) ≥ 0 ���� � �� � � �� � time change space change collision operator ◮ Transport term v · ∇ x : straight line along velocity v ◮ Collision operator Q ( f , f ): � � � � f ( v ′ ) f ( v ′ Q ( f , f )( v ) = ∗ ) − f ( v ) f ( v ∗ ) B ( v − v ∗ , σ ) v ∗ ∈ R 3 σ ∈ S 2 � �� � � �� � ( v ′ , v ′ ∗ ) → ( v , v ∗ ) ( v , v ∗ ) → ... Velocity collision rule (2 free parameters → σ ∈ S 2 ): v ′ := v + v ∗ + σ | v − v ∗ | ∗ := v + v ∗ − σ | v − v ∗ | v ′ , 2 2 2 2

  5. Structure of the Boltzmann equation � � Q ( f , f ) ϕ ( v ) = 1 [ f ′ f ′ ∗ − ff ∗ ] B ( ϕ + ϕ ∗ − ϕ ′ − ϕ ′ Symmetries: ∗ ) 4 v , v ∗ ,ω v Conservation laws:     1 1 � � d  d v d x =  d v d x = 0 R 2 d f v R 2 d Q ( f , f ) v   d t | v | 2 | v | 2 H -Theorem: � � d t H ( f ) = d d R 2 d f log f d v d x = − R 2 d Q ( f , f ) log f d x d v ≤ 0 d t (2 π T ) d / 2 e −| v − u | 2 / 2 T (Maxwellian) ρ with cancellation only at M f = Time-irreversible equation and mathematical basis for 2-d law of thermodynamic: natural question in the many-particle limit

  6. Molecular chaos (I) Irreversibility according to Boltzmann in terms of a “factorization” of a dynamics W W 0 M 0 t W W 1 M 1 S = k log W

  7. Molecular chaos (II) Implicitly nontrivial “factorization” assumption of the dynamics: X 0 ∈ W ( M 0 ) ⇒ T t ( X 0 ) ∈ W ( F t ( M 0 )) T t , F t micro./macro. semigroups W W 0 M 0 t W W 1 W ′ M 1 1 M ′ 1 � = M 1 S = k log W Forbidden for macroscopic evolution laws (closed equation)

  8. Molecular chaos (III) How to justify this “factorization”: ◮ Boltzmann’s idea of molecular chaos (“Stosszahlansatz”) ◮ Roughly speaking: for certain initial data (low correlations), the low correlations are mostly preserved with times and the Poincar´ e recurrence time is “sent to ∞ ” as N → + ∞ ◮ At least the time scale of such spurious “reversible fluctuations” remains out of the range of observations

  9. “Proving” the Boltzmann equation (I) Cercignani 1972: The apparently paradoxical connection between the reversible nature of the basic equations of classical mechanics and the irreversible features of the gross description of large systems of classical particles satisfying those equations, came under strong focus with the celebrated H-theorem of Boltzmann and the related controversies between Boltzmann on one side and Loschmidt and Zermelo on the other. [. . . ] In particular, it is not clear whether an averaging is taking place during the duration and over the region of a molecular collision. This averaging is related to another controversial point, i.e., whether irreversibility can appear only through the intervention of a stochastic or random model or can be a consequence of the progressive weakening of the property of continuous dependence on initial conditions .

  10. “Proving” the Boltzmann equation (II) ◮ Second viewpoint : best result so far Lanford 1973: convergence for very short time (less than mean free time) ◮ Conceptually based on expansion of the solution in terms of the initial data but hard, deep and technical: see recent preprint Gallagher-Saint-Raymond-Texier ◮ At now, not adapted for the study of the long-time behavior ◮ First viewpoint : related to the question of the probabilistic foundation of kinetic theory (Kac 1956): randomness in the evolution itself and probabilistic methods

  11. Plan I. From microscopic to macroscopic evolutions II. Probabilistic foundation of kinetic theory III. Statistical stability and quantitative chaos III. The main results IV. The functional framework V. Sketch of the proof of the abstract stability result VI. Entropic chaos and relaxation rate VII. Statistical stability and the BBGKY hierarchy

  12. Kac’s program (I) ◮ Goal: derive the spatially homogeneous Boltzmann Eq. and H -theorem from a many-particle Markov jump process ◮ The process is studied through its master equation (the equation on the law of the process) Remarks : (1) This amounts intuitively to consider the spatial variable as a hidden variable inducing “loss of memory” and randomness on the velocity variable by ergodicity. → Open and interesting question. . . (2) Limit different from the Boltzmann-Grad limit: mean-field limit

  13. Kac’s program (II) “This formulation led to the well-known paradoxes which were fully discussed in the classical article of P. and T. Ehrenfest. These writers made it clear (a) that the “Stosszahlansatz” cannot be strictly derivable from purely dynamic considerations and (b) that the “Stosszahlansatz” has to be interpreted probabilistically. [. . . ]The “master equation” approach which we have chosen seems to us to follow closely the intentions of Boltzmann.” Interpretation not clear! Cf. Cercignani 1972, Lanford 1973 But it raises a nice question: If we have to introduce stochasticity, at least. . . Can we keep it under control all along the process of many-particle limit and relate it to the dissipativity of the limit equation?

  14. The propagation of chaos = f ⊗ N ◮ If f N tensorized on t ∈ [0 , T ], then f t satisfies the t t limit nonlinear Boltzmann equation on t ∈ [0 , T ] ◮ Tensorization property does not propagate in time (interactions) ◮ But the weaker property of chaoticity can be expected to propagate in time, in the correct scaling limit ◮ ( f N ) N ≥ 1 symmetric probabilities on E N is said f -chaotic if f N ∼ f ⊗ N when N → ∞ (weak convergence of marginals) ◮ Many-particle limit reduced to the propagation of chaos f 0 -chaoticity of ( f N 0 ) N ≥ 1 implies f t -chaoticity of ( f N t ) N ≥ 1

  15. The notions of chaos and how to measure them (I) ◮ f N ∈ P sym ( E N ) is f -chaotic, f ∈ P ( E ), if for any ℓ ∈ N ∗ and any ϕ ∈ C b ( E ) ⊗ ℓ there holds � f N , ϕ ⊗ 1 N − ℓ � � � f ⊗ ℓ , ϕ lim = N →∞ which amounts to the weak convergence of any marginals ◮ Strong and weak topologies on P ( E ) ◮ Canonical distance M 1 for the strong topology ◮ But many distances for the weak topology ◮ In this talk Monge-Kantorovich-Rubinstein distance � W 1 ( µ, ν ) = sup ϕ ( d µ − d ν ) . � ϕ � Lip ≤ 1 E

  16. The notions of chaos and how to measure them (II) ◮ Finite-dimensional chaos: K ℓ > 0 and ε ( N ) → 0, N → ∞ s.t. � Π ℓ f N , f ⊗ ℓ � W 1 ≤ K ℓ ε ( N ) ◮ Infinite-dimensional chaos: � f N , f ⊗ N � W 1 ≤ ε ( N ) N ◮ (Infinite-dimensional) entropic chaos: � f N � N →∞ 1 � N H − − − − → H ( f ) , H ( f ) := f log f ◮ Other metrics by duality, e.g. � � �� Π ℓ f N − f ⊗ ℓ , ϕ ∀ ϕ ∈ F ⊗ ℓ ⊂ C b ( E ) ⊗ ℓ � � � ≤ K ℓ ε ( N ) , �

  17. Kac’s walk in the simpler case (I) ◮ Markov process on a continuous phase space with transition operator P ◮ Continuous in time: exponential random time E ( T ) = 1 P ( T ≥ t ) = e − at and so that a P ( n jumps before t ) = ( at ) n n ! e − at and � P ( n jumps before t ) P n f (0) f ( t ) = n ≥ 0 ( at ) n � n ! e − at P n f (0) = e ta ( P − Id) f (0) = n ≥ 0 ◮ Differentiating the latter equation in time we obtain the Master equation (Kolmogorov forward equation) ∂ t f = a ( P − Id) f

  18. Kac’s walk in the simpler case (II) ◮ Simplify collisions: one-dimensional velocities ◮ Trivial with momentum and energy conservation: drop momentum conservation ◮ Draw pairs ( i , j ) uniformly, with exponential time and perform v ′ v ′ i = v i cos θ + v j sin θ, j = − v i sin θ + v j cos θ ◮ Energy is preserved, normalize it as ( � N i =1 v 2 i ) / N = 1 ◮ In order to maintain O (1) collisions happening per unit of time, scale the random exponential time so that E ( T ) = 1 / N ∂ f N = N ( P − Id) f N = L N f N ∂ t √ ◮ Jump process on S N − 1 ( N ) (Kac’s walk): � 2 π j ( θ ) , . . . ) − f N � d θ ∂ f N 2 � � f N ( . . . , v ′ i ( θ ) , . . . , v ′ = ∂ t ( N − 1) 2 π 0 i < j

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend