zbMATH — the first resource for mathematics

Coarsening in ergodic theory. (English) Zbl 1371.37006
Summary: This paper deals with the coarsening operation in dynamical systems where the phase space with a finite invariant measure is partitioned into measurable pieces and the summable function transferred by the phase flow is averaged over these pieces at each instant of time. Letting the time tend to infinity and then refining the partition, we arrive at a modernization of the von Neumann ergodic theorem, which is useful for the purposes of nonequilibrium statistical mechanics. In particular, for fine-grained partitions, we obtain the law of increment of coarse entropy for systems approaching the state of statistical equilibrium.

37A30 Ergodic theorems, spectral theory, Markov operators
37A60 Dynamical aspects of statistical mechanics
Full Text: DOI
[1] V. V. Nemytskii and V. V. Stepanov, Qualitative Theory of Differential Equations (Princeton,N.J.: Princeton Univ. Press, 1960; see also: New York: Dover, 1989). · Zbl 0089.29502
[2] Kozlov, V V; Treschev, D V, Fine-grained and coarse-grained entropy in problems of statistical mechanics, Theoret. and Math. Phys., 151, 539-555, (2007) · Zbl 1119.82005
[3] W. Gibbs, Elementary Principles in Statistical Mechanics, Developed with Especial Reference to the Rational Foundation of Thermodynamics (New York: Dover, 1960). · Zbl 0098.20904
[4] Kozlov, V V, Kinetics of collisionless continuous medium, Regul. Chaotic Dyn., 6, 235-251, (2001) · Zbl 1006.82011
[5] Piftankin, G; Treschev, D, Coarse-grained entropy in dynamical systems, Regul. Chaotic Dyn., 15, 575-597, (2010) · Zbl 1203.37008
[6] Kozlov, V V, The generalized Vlasov kinetic equation, Usp. Mat. Nauk, 63, 93-130, (2008) · Zbl 1181.37006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.