A note on the three versions of distributional chaos

✍ Scribed by Risong Li

• Publisher: Elsevier Science
• Year: 2011
• Tongue: English
• Weight: 200 KB
• Volume: 16
• Category: Article
• ISSN: 1007-5704
• DOI: 10.1016/j.cnsns.2010.08.014

✦ Synopsis

The concept of distributional chaos was introduced by Schweizer et al. [Schweizer B, Sklar A, Smítal J. Measures of chaos and a spectral decomposition of dynamical systems on the interval. Tran Amer Math Soc 1994;344:737-854.] for a continuous selfmap on an interval. However, it turns out that, for a continuous selfmap on a compact metric space, three mutually nonequivalent versions of distributional chaos, DC1-DC3, can be discussed. In this paper, we consider a continuous map f : X ? X, where X is a compact metric space, and show that DC1 (resp. DC2) is an iteration invariant, that is, for any integer N > 0, f is DC1 (resp. DC2) if and only if f N is also DC1(resp. DC2). As applications, we show that the following statements hold:

(1) Let G be a graph and f : G ? G a continuous map. Then f is DC1 if and only if f is DC2.

(2) For a continuous selfmap f on a tree T, these three versions of distributional chaos, DC1 À DC3 are mutually equivalent.

Furthermore, we present two examples which show that DC3 may be an iteration invariant. We will also discuss and partly solve the problem.