Special homeomorphisms and approximation for Cantor systems (Q386191)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Special homeomorphisms and approximation for Cantor systems |
scientific article |
Statements
Special homeomorphisms and approximation for Cantor systems (English)
0 references
9 December 2013
0 references
Let \(\mathbf{H}^+\) (resp.\ \(\mathbf{H}\)) denote the space of all continuous onto maps (resp. homeomorphisms) of the Cantor set endowed with the sup metric. It is well known that both \(\mathbf{H}^+\) and \(\mathbf{H}\) are Polish spaces. \textit{M. Hochman} [Ergodic Theory Dyn. Syst. 28, No. 1, 125--165 (2008; Zbl 1171.37305)] proved that the space of all transitive systems in \(\mathbf{H}\) is Polish and that the conjugacy class of the universal odometer is a dense \(G_\delta\) set in this space. In the paper under review, the author proves that the conjugacy class of the universal odometer is a dense \(G_\delta\) set in the space of all chain transitive systems in \(\mathbf{H}^+\). Actually, this result is derived from a more general theorem. A set \(P^* \subset \mathbb{N}^+\) is said to satisfy the condition of a periodic spectrum if for all \(a,b \in P^*\), every divisor of \(a\) and the least common multiple of \(a\) and \(b\) also belong to \(P^*\). The author associate to each such a set \(P^*\) a corresponding odometer system \((\text{Od}_{P^*},\rho)\). The main result of the paper is the following. Theorem. Let \(P^* \subset \mathbb{N}^+\) be an infinite set that satisfies the condition of a periodic spectrum and \((\text{Od}_{P^*},\rho)\) be the corresponding odometer system. Then, denoting by \(\mathrm{PS}(f)\) the periodic spectrum of \(f\), the subspace \(\{f \in \mathbf{H}^+ : f \text{ is chain transitive and } P^* \supset \text{PS}(f)\}\) of \(\mathbf{H}^+\) is closed and the conjugacy class of the odometer system \((\text{Od}_{P^*},\rho)\) is a dense \(G_\delta\) set in this subspace.
0 references
dynamical system
0 references
graph
0 references
zero-dimensional
0 references
chain transitive
0 references
recurrent
0 references
generic
0 references