Topological entropy
From Wikipedia, the free encyclopedia
In mathematics, in the area of ergodic theory, the topological entropy provides a way of defining the entropy in an iterated function map. In essence, the topological entropy counts the number of distinguishable orbits that an iterated map may have.
[edit] Definition
Let (X,d) be a compact metric space and 
a continuous map. For each 
, we define a new metric dn by
Two points are ε-close with respect to this metric if their first n iterates are ε-close. For ε > 0 and we say that 
is an (n,ε)-separated set if for each pair x,y of points of E we have dn(x,y) > ε. The goal of this metric is to be able to distinguish points that move away from each other during iteration, from points that travel together, in the neighborhood of an orbit.
Denote by N(n,ε) the maximum cardinality of an (n,ε)-separated set (which is finite, because X is compact). Roughly, N(n,ε) represents the number of distinguishable orbit segments of length n, assuming we cannot distinguish points that are less than ε apart. The topological entropy of f is defined by
It is easy to see that this limit always exists, but it could be infinite. A rough interpretation of this number is that it measures the average exponential growth of the number of distinguishable orbit segments. Hence, roughly speaking again, we could say that the higher the topological entropy is, the more essentially different orbits we have.
Topological entropy was first introduced in 1965 by Adler, Konheim and McAndrew, with a different (but equivalent) definition to the one presented here. The definition we give here is due to Bowen and Dinaburg.
[edit] References
- This article incorporates material from Topological Entropy on PlanetMath, which is licensed under the GFDL.
