Topological complexity

被引:88
作者
Blanchard, F
Host, B
Maass, A
机构
[1] CNRS, IML, F-13288 Marseille 09, France
[2] Univ Marne la Vallee, Equipe Anal & Math Appl, F-77454 Marne la Vallee, France
[3] Univ Chile, Dept Ingn Matemat, Santiago, Chile
关键词
D O I
10.1017/S0143385700000341
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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 cover has bounded complexity. Call scattering a system such that any finite cover 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 totally transitive. Conversely, any system that is not 2-scattering has covers with complexity at most n + 1. Scattering systems are characterized topologically as those such that their cartesian product with any minimal system is transitive; they are consequently disjoint from all minimal distal systems. 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 complexity, we prove that 2-scattering systems are disjoint from minimal isometries; that in the invertible case the complexity relation is contained in the regionally proximal relation and, when further assuming minimality, coincides with it up to the diagonal.
引用
收藏
页码:641 / 662
页数:22
相关论文
共 21 条