On recurrence and entropy in hyperspace of continua in dimension one
Domagoj Jelić, Piotr Oprocha
TL;DR
The paper addresses whether entropy is preserved when passing from a graph map $f$ to its induced map on the continua hyperspace, proving $h_{top}(f)=h_{top}( ilde{f})$ for topological graphs. The approach hinges on a detailed analysis of Rec$( ilde{f})$ via ω-limit structures, showing that most recurrent continua are periodic unless tied to circumferential or solenoidal behavior, which are then analyzed through almost-conjugate models to irrational rotations. This allows localization of entropy sources and a variational-entropy argument that rules out entropy inflation on $C(G)$. The result extends known interval/tree cases to graphs and clarifies how one-dimensional dynamics constrain entropy growth on continua, providing a framework for entropy computation via ω-limit typology in one-dimensional settings.
Abstract
We show that if $G$ is a topological graph, and $f$ is continuous map, then the induced map $\tilde{f}$ acting on the hyperspace $C(G)$ of all connected subsets of $G$ by natural formula $\tilde{f}(C)=f(C)$ carries the same entropy as $f$. This is well known that it does not hold on the larger hyperspace of all compact subsets. Also negative examples were given for the hyperspace $C(X)$ on some continua $X$, including dendrites. Our work extends previous positive results obtained first for much simpler case of compact interval by completely different tools.
