Genericity and rigidity for slow entropy transformations

From MaRDI portal
Publication:1998995



Abstract: The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate function an(t), we prove there exists a generic class of invertible measure preserving systems such that the lower slow entropy is zero and the upper slow entropy is infinite. Also, given any subexponential rate an(t), we show there exists a rigid, weak mixing, invertible system such that the lower slow entropy is infinite with respect to an(t). This gives a general solution to a question on the existence of rigid transformations with positive polynomial upper slow entropy, Finally, we connect slow entropy with the notion of entropy covergence rate presented by Blume. In particular, we show slow entropy is a strictly stronger notion of complexity and give examples which have zero upper slow entropy, but also have an arbitrary sublinear positive entropy convergence rate.


The article deals with the notion of slow entropy for \(\mathbb{Z}\)-actions of Lebesgue measure-preserving transformations [\textit{A. Katok} and \textit{J.-P. Thouvenot}, Ann. Inst. Henri Poincare, Probab. Stat. 33, No. 3, 323--338 (1997; Zbl 0884.60009)]. The author constructively proves three main results: (i) There exists a dense set of invertible measure-preserving transformations with infinite upper slow entropy with respect to subexponential rate function; (ii) There exists a dense set of invertible measure-preserving transformations with zero lower slow entropy with respect to divergent rate function; (iii) There exists a set \(\mathcal{F}\) of rigid, weak mixing-transformations such that given any subexponential rate, there exists a transformation in \(\mathcal{F}\) with infinite lower slow entropy under that rate. The author also compares the notion of slow entropy in the framework of entropy convergence rates (see [\textit{F. Blume}, Math. Z. 271, No. 3--4, 723--750 (2012; Zbl 1283.37008)]).











This page was built for publication: Genericity and rigidity for slow entropy transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1998995)