A splitting theorem for transitive maps (Q1288162): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jmaa.1999.6277 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2093706895 / rank | |||
Normal rank |
Revision as of 01:53, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A splitting theorem for transitive maps |
scientific article |
Statements
A splitting theorem for transitive maps (English)
0 references
24 April 2001
0 references
The basic result is the following theorem. For a continuous transitive map \(f : X \rightarrow X\), \(X\) a locally connected compact metric space, exactly one of the following two statements holds: (1) \(f\) is totally transitive i.e. \(f^k\) is transitive for all \(k \geq 1\). (2) There exist closed connected subsets \(X_0, \dots X_{k-1}\) of \(X\), \(k > 1\), with nonempty interiors such that \(X = \bigcup_{i=0}^{k-1}X_i\), \(\text{int}(X_i) \cap X_j = \emptyset \), for \(i \neq j\), and \(f(X_i) = X_{i+1\pmod k}\). Moreover, \(f^k|_{X_i}\) is transitive, for \(i = 0, \dots, k-1\). As a consequence, the authors establish lower bounds for the topological entropy of transitive graph maps in terms of the cardinality of their splittings. They also show that for a connected graph which is not a tree, the infimum of the topological entropy of the transitive maps having a periodic point is zero.
0 references
splitting
0 references
transitivity
0 references
topological entropy
0 references