On sets with recurrence properties, their topological structure and entropy (Q409676)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On sets with recurrence properties, their topological structure and entropy |
scientific article; zbMATH DE number 6024156
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On sets with recurrence properties, their topological structure and entropy |
scientific article; zbMATH DE number 6024156 |
Statements
On sets with recurrence properties, their topological structure and entropy (English)
0 references
13 April 2012
0 references
Let \((X,d)\) be a compact metric space and let \(f\in C(X,X)\). A set \(K\subset X\) is said to be transitive of order \(n\) if it is a transitive set for \(f^n\) and weakly mixing of order \(n\) if \(\underbrace{A\times\dots\times A}_n\) is a transitive set for the map \(\underbrace{f\times\dots\times f}_n\). The authors obtain the following results: \begin{itemize}\item[(1)] The following families of subsets of \(X\) are \(G_\delta\) subsets of \(2^X\): transitive, transitive of order \(n\), totally transitive, weakly mixing of order \(n\), and weakly mixing. \item[(2)] If any of these five sets is a singleton, then they all are singletons and \(f\) is proximal. \item[(3)] If a factor map from \((X,f)\) to another system is given, then the relative entropy of \(f\) is a supremum of entropies of \(f\) on chaotic sets contained in fibers. The same statement holds true for weakly mixing sets and closed weakly mixing entropy sets. \item[(4)] The sets with full local entropy capacity are studied in relation to the before mentioned classes of sets.\end{itemize}
0 references
transtitivity
0 references
weak mixing
0 references
entropy
0 references
topological entropy
0 references
factor map
0 references
hyperspace
0 references
chaos
0 references
0 references