Hostname: page-component-848d4c4894-r5zm4 Total loading time: 0 Render date: 2024-06-14T21:45:54.215Z Has data issue: false hasContentIssue false

Relativization of complexity and sensitivity

Published online by Cambridge University Press:  11 June 2007

Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, People's Republic of China (e-mail:


First notions of relative complexity function and relative sensitivity are introduced. It turns out that for any open factor map $\pi: (X, T)\rightarrow (Y, S)$ between topological dynamical systems with minimal $(Y, S),\ \pi$ is positively equicontinuous if and only if the relative complexity function is bounded for each open cover of $X$; and that any non-trivial weakly mixing extension is relatively sensitive. Moreover, a relative version of the notable result that any $M$-system is sensitive if it is not minimal is obtained. Then notions of relative scattering and relative Mycielski's chaos are introduced. A relative disjointness theorem involving relative scattering is given. A relative version of the well-known result that any non-trivial scattering topological dynamical system is Li–Yorke chaotic is proved.

Research Article
2007 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)