Categorical polynomial entropy

From MaRDI portal
Publication:2020378



Abstract: For classical dynamical systems, the polynomial entropy serves as a refined invariant of the topological entropy. In the setting of categorical dynamical systems, that is, triangulated categories endowed with an endofunctor, we develop the theory of categorical polynomial entropy, refining the categorical entropy defined by Dimitrov-Haiden-Katzarkov-Kontsevich. We justify this notion by showing that for an automorphism of a smooth projective variety, the categorical polynomial entropy of the pullback functor on the derived category coincides with the polynomial growth rate of the induced action on cohomology. We also establish in general a Yomdin-type lower bound for the categorical polynomial entropy of an endofunctor in terms of the induced endomorphism on the numerical Grothendieck group of the category. As examples, we compute the categorical polynomial entropy for some standard functors like shifts, Serre functors, tensoring line bundles, automorphisms, spherical twists, P-twists, and so on, illustrating clearly how categorical polynomial entropy refines the study of categorical entropy and enables us to study the phenomenon of categorical trichotomy. A parallel theory of polynomial mass growth rate is developed in the presence of Bridgeland stability conditions.


The authors develop the basic theory of categorical polynomial entropy of an endofunctor of a triangulated category. Let \(\mathcal{D}\) be a triangulated category with a given split generator \(G\). Let \(F :\mathcal{D}\rightarrow \mathcal{D}\) be a (triangulated, not virtually zero) endofunctor. The categorical entropy of \(F\) is defined to be the function \(h_t(F): R\rightarrow [-\infty, \infty)\) in the real variable \(t\), given by \[h_t(F):=\lim_{n\rightarrow \infty } \frac{\log \delta _t(G,F^n(G))}{n},\] where \( \delta _t(G,F^n(G))\) is a certain positive number measuring the complexity of the image of a split generator \(G\) of \(\mathcal{D}\) under the \(n\)-th iteration of \(F\). The polynomial entropy of \(F\) is defined by \[h_t^{pol}(F):=\underset{n\rightarrow \infty }{\lim \sup }\frac{\log \delta _t(G,F^n(G))-nh_t(F)}{n}.\] Some basic properties of the categorical polynomial entropy function are given. The authors study the polynomial analogue of mass growth and compare it to the categorical polynomial entropy. Lower bound for categorical polynomial entropy and lower bound for polynomial mass growth are studied. They present a connection of the categorical theory developed so far to the classical setting. The categorical polynomial entropy function of the derived pullback functor is studied. As examples, the categorical polynomial entropy is computed. The polynomial entropy for tensoring a new line bundle is determined. The authors investigate the categorical polynomial entropy of autoequivalences of derived categories of smooth projective curves. Taking into account the Gromov-Yomdin-type equality for the categorical polynomial entropy, some new results are obtained.



Cites work


Cited in
(30)








This page was built for publication: Categorical polynomial entropy

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