Topological entropy for locally linearly compact vector spaces

In this paper we study some formulas involving metric and topological entropy and sequence entropy. We summarize some classical formulas satisfied by metric and topological entropy and ask the question whether the same or similar results hold for sequence entropy. In general the answer is negative; still some questions involving these formulas remain open. We make a special emphasis on the commutativity formula for topological entropy h(f ◦ g)=h(g ◦ f) recently proved by Kolyada and Snoha. We give a new elementary proof and use similar ideas to prove commutativity formulas for metric entropy and other topological invariants. Finally we prove a Misiurewicz–Szlenk type inequality for topological sequence entropy for piecewise monotone maps on the interval I=[0, 1]. For this purpose we introduce the notion of upper entropy.

‘‘Classical’’ topological entropy is one of the main numerical invariants in topological dynamics on compact spaces. Here, the author’s recent development of a noncommutative generalization of topological entropy, in the natural setting of general C*-algebras as the noncommutative counterpart of continuous function algebras on compact spaces, is presented in a slightly modified and improved form. This includes both a survey of earlier results with some important corrections, and also new general results in response to (and inspired by) a more recent counterproposal for a noncommutative topological entropy by Thomsen. Finally, some partially new examples for the calculation of the defined topological entropy are shown. The rather self-evident physical interpretation in the framework of (operator-algebraic) quantum statistical mechanics and of ‘‘chaotic’’ quantum dynamical systems is briefly touched upon.

By using the Carathéodory-Pesin structure (C-P structure), the topological entropy on the whole space introduced for a proper map, is generalized to the cases of arbitrary subset, i.e., we introduce three notions of topological entropy. Some of the properties of these notions are provided. As some applications, for the proper map of locally compact separable metric space, we prove the following variational principles: (1) The upper capacity topological entropy on any subset and the minimum of the Bowen-Dinaburg entropies always coincide; (2) For any invariant probability measure, the measure-theoretic entropy and the infimum of the topological entropies on all sets which are of full measures always coincide; (3) The relationship between the topological entropies of level sets of the ergodic average of some continuous functions and the measure-theoretic entropies are given. These are the extensions of results of Patrão and Pesin, etc.

We introduce a notion of entropy for automorphisms of discrete groups which admit amenable actions on a compact space. This entropy is dual to classical topological entropy in the sense that if G is discrete and abelian then our notion of entropy agrees with the topological entropy of the induced automorphism on the (compact) dual group of G. We prove a number of basic properties of this dual entropy and give a few calculations. In particular, we are able to give precise calculations for arbitrary automorphisms of crystallographic groups.

Topological entropy for discontinuous semiflows

This thesis is dedicated to studying the theory of entropy and its relation to the Kolmogorov complexity. Originating in physics, the notion of entropy was introduced to mathematics by C. E. Shannon as a way of measuring the rate at which information is coming from a data source. There are, however, a few different ways of telling how much information there is: an alternative approach to quantifying the amount of information is the Kolmogorov complexity, which was proposed by A. N. Kolmogorov. The Shannon entropy is the key ingredient in the definition of the Kolmogorov-Sinai entropy of a measure-preserving systems. Roughly speaking, the Kolmogorov-Sinai entropy is the expected amount of information in `Shannon sense' that one obtains per unit of time by observing the evolution of a measure-preserving system. In topological dynamics, the topological entropy takes place of the Kolmogorov-Sinai entropy. For metrizable systems, the topological entropy measures the exponential growth rate of the number of distinguishable partial orbits of length n as n tends to infinity. Originally defined for Z-actions, the 'classical' theories of entropy were later extended to actions of amenable groups. We provide a necessary background on amenable groups, topological/measurepreserving dynamics and the entropy theory in Chapters 1, 2, 3 and 5. The main focus of this thesis is extending the following results. First of all, a common generalization of the topological and the Kolmogorov-Sinai entropy theories for Z-systems was suggested by G. Palm. We provide an abstract generalization of the work of Palm for actions of discrete amenable groups in the language of measurement functors in Chapter 6. Secondly, we investigate the connection of entropy and Kolmogorov complexity. Originally, the equality between the topological entropy and a certain quantity measuring maximal asymptotic Kolmogorov complexity of the trajectories was established by A. A. Brudno for subshifts over Z. Later, he proved the equality of the Kolmogorov-Sinai entropy and the asymptotic Kolmogorov complexity of almost every trajectory for ergodic subshifts over Z. We provide a generalization of these results as follows. Firstly, in Chapter 4 we give a background on computability and Kolmogorov complexity and, further, introduce computable Folner monotilings, which are central in our extensions of Brudno's results. We treat the 'first' and the 'second' theorems of Brudno in Chapter 7. The first theorem is generalized for subshifts over computable groups admitting computable Folner monotilings, while the second theorem is proved under the assertion of regularity of the monotiling, which we introduce in Chapter 7 as well.

This paper studies a notion of topological entropy for switched systems, formulated in terms of the minimal number of trajectories needed to approximate all trajectories with a finite precision. For general switched linear systems, we prove that the topological entropy is independent of the set of initial states. We construct an upper bound for the topological entropy in terms of an average of the measures of system matrices of individual modes, weighted by their corresponding active times, and a lower bound in terms of an active-time-weighted average of their traces. For switched linear systems with scalar-valued state and those with pairwise commuting matrices, we establish formulae for the topological entropy in terms of active-time-weighted averages of the eigenvalues of system matrices of individual modes. For the more general case with simultaneously triangularizable matrices, we construct upper bounds for the topological entropy that only depend on the eigenvalues, their order in a simultaneous triangularization, and the active times. In each case above, we also establish upper bounds that are more conservative but require less information on the system matrices or on the switching, with their relations illustrated by numerical examples. Stability conditions inspired by the upper bounds for the topological entropy are presented as well.

In the present paper, we introduce a natural extension of Adler, Konheim and MacAndrew topological entropy for proper maps of locally compact separable metrizable spaces and prove a variational principle which states that this topological entropy, the supremum of the Kolmogorov–Sinai entropies and the minimum of the Bowen entropies always coincide. We apply this variational principle to show that the topological entropy of automorphisms of simply connected nilpotent Lie groups always vanishes. This shows that the Bowen formula for the Bowen entropy of an automorphism of a non-compact Lie group with respect to some invariant metric is just an upper bound for its topological entropy.

Using the notion of topological entropy for non-compact sets we prove that for a C 1+α -map with a finite Markov partition the corresponding coding map preserves topological entropy of subsets. We also provide an example of a piecewise linear conformal repeller with a Markov coding decreasing topological entropy. These results are generalized to the notions of u-dimensions.

The literature contains several extensions of the standard definitions of topological entropy for a continuous self-map $f: X \rightarrow X$ from the case when $X$ is a compact metric space to the case when $X$ is allowed to be noncompact. These extensions all require the space $X$ to be totally bounded, or equivalently to have a compact completion, and are invariants of uniform conjugacy. When the map $f$ is uniformly continuous, it extends continuously to the completion, and the various notions of entropy reduce to the standard ones (applied to this extension). However, when uniform continuity is not assumed, these new quantities can differ. We consider extensions proposed by Bowen (maximizing over compact subsets and a definition of Hausdorff dimension type) and Friedland (using the compactification of the graph of $f$) as well as a straightforward extension of Bowen and Dinaburg's definition from the compact case, assuming that $X$ is totally bounded, but not necessarily compact. This last extension agrees with Friedland's, and both dominate the one proposed by Bowen (Theorem 6). Examples show how varying the metric outside its uniform class can vary both quantities. The natural extension of Adler--Konheim--McAndrew's original (metric-free) definition of topological entropy beyond compact spaces dominates these other notions, and is unfortunately infinite for a great number of noncompact examples.

We define the concept of continuum-wise expansiveness for set-valued functions. We prove that for a compact metric space X X with positive topological dimension, if a set-valued function is c w cw -expansive, then its topological entropy is positive. We also introduce the notion of point-wise specification property for set-valued functions and prove that set-valued functions with this property have positive entropy.

Topological R-entropy and topological entropy of free semigroup actions

It is well known that the topological entropy of the induced hyperspace map is positive, provided so is the topological entropy of the original continuous single-valued map. In this paper we ask whether this is also true for the sequences of multivalued maps. In particular, we consider various definitions (some of them for the first time) of topological entropy for multivalued nonautonomous dynamical systems in compact Hausdorff spaces and investigate their mutual relations. We explain that some of them can deal with arbitrary multivalued maps, i.e. without regularity restrictions. For upper semicontinuous multivalued maps, we study the parametric topological entropy of the induced possibly discontinuous dynamical systems in hyperspaces. We show, among other things, that a comparison of different types of entropy notions allows us to make the entropy estimates without direct calculations. Several illustrative examples are supplied.

About 5 years ago, Dai, Zhou and Geng proved the following result. If $X$ is a metric compact space and $f:X\to X$ a Lipschitz continuous map, then the Hausdorff dimension of $X$ is bounded from below by the topological entropy of $f$ divided by the logarithm of its Lipschitz constant. We show that this is a simple consequence of a 30 years old Bowen's definition of topological entropy for noncompact sets. Moreover, a modification of this definition provides a new insight into the entropy of subshifts of finite type.

Observational modeling of topological spaces