scientific article; zbMATH DE number 1126840

Let \(f\) be a continuous function from a Polish space \(\mathcal X\) to itself. \(\omega_f(x)\) is the set of those points \(y\in\mathcal X\) such that each neighbourhood of \(y\) contains for each \(n\) a point \(f^m(x)\) for some \(m>n\). We say that \(x\) attacks \(y\) if \(y\in\omega_f(x)\) and we write \(x\curvearrowright y\). Given a point \(a\in\mathcal X\), define recursively the sets \(A^\nu(a)\): \(A^0(a)=\omega_f(a)\), \(A^{\beta+1}(a)=\bigcup\{\omega_f(x):x\in A^\beta(a)\}\), \(A^\lambda(a)=\bigcap_{\nu<\lambda}A^\nu(a)\) for \(\lambda\) a limit ordinal. Let \(\theta(a,f)\) be the least ordinal \(\theta\) with \(A^\theta(a)=A^{\theta+1}(a)\) and let \(A^\infty(a,f)=A^{\theta(a,f)}(a)\). It is known that \(\theta(a,f)\leq\omega_1\). The points in \(A^\infty(a,f)\) are said to abide and the points in \(\omega_f(a)\setminus A^\infty(a,f)\) are said to escape. A point \(x\) is recurrent if \(x\curvearrowright x\). If \(y\curvearrowright x\) for all \(y\in\omega_f(x)\), then the set \(\omega_f(x)\), or the point \(x\) is called minimal. If \(\mathcal X\) is compact Polish space, then minimal points (which are recurrent, too) exist. The recurrent points are used to characterize the abiding points: \(x\in A^\infty(a,f)\) if and only if \(a\curvearrowright b\curvearrowright x\) for some recurrent point \(b\). Let \(S\) be the set of finite strictly increasing sequences of odd prime numbers. In ``Long delays in dynamics [CRM Preprint núm. 334, May 1996] the author gave the method of assignments of points at the nodes of the tree \(S\). For well founded subtrees \(T\) of \(S\) this method permits the construction of a point \(a\) with \(\theta(a,f)=\text{rank}(T)\) which may be any pre-assigned countable ordinal. In the paper under review the author applies this to ill-founded trees and in the Baire space \(^\omega\omega\) he obtains a recursive point \(a\) such that \(\theta(a,\mathfrak s)\) is the first non-recursive ordinal \(\omega_1^{\text{CK}}\), where \(\mathfrak s\) is the shift function defined by \(\mathfrak s(b)(n)=b(n+1)\) for \(b:\omega\to\omega\). At the end of each infinite path through \(T\) there is a recurrent point which attacks every point along it. This is a consequence of a more general result proved for all Polish spaces and continuous functions. The author reviews a bit of the theory of hyperarithmetic sets with respect to the dynamical context of the paper and discusses some open problems. For the entire collection see [Zbl 0881.00034].

Recommendations

Cited in

(7)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4379933)