Topological complexity

Citation
F. Blanchard et al., Topological complexity, ERGOD TH DY, 20, 2000, pp. 641-662
Citations number
21
Categorie Soggetti
Mathematics
Journal title
ERGODIC THEORY AND DYNAMICAL SYSTEMS
ISSN journal
01433857 → ACNP
Volume
20
Year of publication
2000
Part
3
Pages
641 - 662
Database
ISI
SICI code
0143-3857(200006)20:<641:TC>2.0.ZU;2-9
Abstract
In a topological dynamical system (X, T) the complexity function of a cover C is the minimal cardinality of a sub-cover of V-i(n)=0 T-iC. It is Shown that equicontinuous transformations are exactly those such that any open co ver has bounded complexity. Call scattering a system such that any finite c over by non-dense open sets has unbounded complexity, and call 2-scattering a system such that any such 2-set cover has unbounded complexity: then all weakly mixing systems are scattering and all 2-scattering systems are tota lly transitive. Conversely, any system that is not 2-scattering has covers with complexity at most n + 1. Scattering systems are characterized topolog ically as those such that their cartesian product with any minimal system i s transitive; they are consequently disjoint from all minimal distal system s. Finally, defining (x, y), x not equal y, to be a complexity pair if any cover by two non-trivial closed sets separating x from y has unbounded comp lexity, we prove that 2-scattering systems are disjoint from minimal isomet ries; that in the invertible case the complexity relation is contained in t he regionally proximal relation and, when further assuming minimality, coin cides with it up to the diagonal.