\(\varepsilon\)-pseudo-orbits and isolated invariant sets (Q2710285)

The subject of the paper is dynamical systems consisting of the iteration of continuous function \(f\) on compact metric space \(X\). \(\varepsilon\)-pseudo-orbit of length \(n\) is a sequence of points \((x_0,\dots,x_n)\) in \(X\) which satisfy \(d(f(x_{k-1}),x_k) < \varepsilon\) for \(k=1,\dots,n\). \(\varepsilon\)-pseudo-orbit can be considered as a mathematical representation of a computer model of the discrete system. The main notions used are the following: chain recurrent point (if there is \(\varepsilon\)-pseudo-orbit from this point back to itself for all \(\varepsilon>0\)), chain recurrent set \(R(f)\) (set of chain recurrent points), and the corresponding notions of \(\varepsilon\)-chain recurrent point and \(\varepsilon\)-chain recurrent set \(R_{\varepsilon}(f)\). The latter two notions do not require fulfillment ``for all \(\varepsilon\)'' but stand for a fixed \(\varepsilon>0\). NEWLINENEWLINENEWLINEThe paper presents a review of some results on this topic without proof. In particular, the Conley decomposition theorem is presented for the case of fixed \(\varepsilon\) and arbitrary \(\varepsilon\). The main theorem states that \(R_\varepsilon (f)\to R(f)\) as \(\varepsilon\to 0^+\), where the set convergence is with respect to the Hausdorff metric.NEWLINENEWLINEFor the entire collection see [Zbl 0940.00021].