Limit Sets, Attractors and Chaos

The aim of this paper is a study on relations between ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-chaos and the structure of ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-limit sets. We propose a definition of ω^\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\hat{\omega }$$\end{document}-chaos which requires stronger relations between limit sets of points from tuples. We present example with relatively simple dynamics (almost equicontinuous system) which is ω\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\omega $$\end{document}-chaotic and propose further restrictions on the conditions in the definition.


Introduction
The qualitative theory of dynamical systems focuses on the understanding how the trajectories of all points from the state space behave in long time. There appear situations when the motion is periodic or almost periodic however also more complicated, irregular patterns can appear during evolution of a point. Roughly speaking, the last case can usually be identified with some kind of chaos, and was intensively studied by many authors from different points of view, introducing several notions of chaos (e.g. see [1]).
The notion of omega chaos was introduced by Li [15] in 1993 for interval maps and was later generalized for continuous maps on compact metric spaces. An uncountable subset of the state space is called ω-scrambled if for any nondiagonal pair in the set: (i) difference of omega limit sets is uncountable, (ii) intersection of omega limit sets is nonempty and (iii) each omega limit set is not contained in the set of periodic points.
It provides yet another characterization of the situation when interval map has positive entropy or other chaotic phenomena, equivalent in this one-dimensional context.
Omega chaos is still not well understood and many open questions remains unsolved. The main difficulty in studies on this notion is that it more relies on geometric structure of attractors in the space, rather than evolution of single points. Simply, points with completely different, unrelated trajectories can lead at the end to the same omega limit set (e.g. two points with dense trajectory). In [16] authors discussed omega chaos for the circle maps and [11,12] studied cardinality of omega scrambled sets and relations to the chaos in the sense of Li and Yorke. Later in [4,23] authors discussed Lebesgue measure of omega scrambled sets for continuous maps on the interval. Recently in [14] the specification property was used to study omega chaos and [19] relates limit shadowing with ω-chaos. In [8] the notion of ω-chaos was transferred from individual dynamics to collective one. For further reading on the topic see e.g. [9] and [22]. An important notion tightly bonded with ω-chaos is minimality. It is worthy to note at this point, that by the definition, ω-chaos is not present in minimal dynamical systems. So intuitively it seems that ω-chaos may not appear if the structure of minimal systems is not rich. This is somehow misleading.
In [6] authors construct space which is ω-chaotic but the only minimal sets are periodic orbits. Furthermore, ω-chaos can appear in dynamical system with one minimal subset, even in the case when the minimal system is rigid and dynamics is almost equicontinuous (see Sect. 5). To avoid the above situation and induce a more complicated structure of limit sets we will modify the definition of ω-chaos. Let us first recall mathematically strict definition of ω-chaos introduced first by Li in [15]. Definition 1.1 A set ⊂ X containing at least two points is called an ω-scrambled set for dynamical system (X, f ) if, for any two x = y in , The map f is ω-chaotic if there is an uncountable ω-scrambled set. By an ω-chaotic pair we mean any ω-scrambled set of cardinality 2.
It was pointed out in [15] that the third condition is superfluous when X = I = [0, 1]. In [13] it was shown, however, that even in dimension one there are systems where the third condition is essential. Recent progress in theory of dynamical systems revealed big advantages of studies of dynamics of tuples, especially when studying topological entropy (e.g. see [20] for a survey on recent results). Following this approach, we will require that tuples in scrambled set satisfy a stronger property, which is a natural generalization of chaotic pairs (in particular, 2-tuple is chaotic pair in the standard sense). Definition 1.2 A tuple of points (x 1 , . . . , x n ) ∈ X n , n ≥ 2, is an ω-scrambled n-tuple if the following three conditions are satisfied: An uncountable set Q ⊂ X isω-scrambled set if for any n ≥ 2, any choice of distinct points x 1 , . . . , x n ∈ Q forms and ω-scrambled n-tuple (x 1 , . . . , x n ). If an uncountablê ω-scrambled set exists, the map f is calledω-chaotic.

Remark 1.3
It may happen in practice that conditions (1)-(3) in Definition 1.2 are satisfied but the structure of the dynamical system is quite simple (see example of dynamical system (X , G) constructed in Sect. 5). Then we propose to replace (1)-(3) by the following two stronger conditions: contains an uncountable minimal set for any permutation π of the set {1, . . . , n}, contains an uncountable minimal set. Observe that for n = 2 Definition 1.2 immediately gives Definition 1.1. On the other hand it is possible to construct an example of ω-chaotic map with ω-chaotic pairs without ω-chaotic triples; the construction is just simplification of the proof of Proposition 1 from [23] while picking the initial set A as two point set of sequences containing infinitely many zeros and ones.
In the article (in Sect. 3) we will show that every interval map with positive topological entropy isω-chaotic, obtaining yet another condition equivalent to positive topological entropy. We strongly believe that this definition (after update proposed in Remark 1.3) should lead to dynamics with complicated structure of limit sets (both theoretically and geometrically, which should be visible in computer simulations).

Definitions and Notations
By a dynamical system we mean a pair (X, f ), where X is a compact metric space with a metric d, and f is a continuous map from X to itself. The orbit of x ∈ X is the set O + (x) := { f k (x) : k ≥ 0}, where as usual f k stands for the k fold composition of f . For x ∈ X the ω-limit set is the set and minimal if it is nonempty, closed and invariant under f and it does not contain any proper subset which satisfy these three conditions. When X is a minimal set, then we say that the dynamical system (X, f ) is minimal. It is known that (X, f ) is minimal iff each x ∈ X has dense orbit or equivalently ω f (x) = X for any x ∈ X . If x ∈ ω f (x) then x is recurrent.
We say that f is (topologically) transitive if for any two nonempty open sets U, V ⊂ X there exist n > 0 such that f n (U ) ∩ V = ∅ and is (topologically) weakly mixing if for any three nonempty open sets U, V, W ⊂ X there exist n > 0 such that f n (W ) ∩ U = ∅ and f n (W ) ∩ V = ∅ (see [2] for a list of equivalent conditions). If for every two nonempty sets U, V ⊂ X there exist N > 0 such that f n (U ) ∩ V = ∅ for all n > N then we say that f is (topologically) mixing. Now let us present some standard notation related to symbolic dynamics. Let A be any finite set (an alphabet) and let A * denote the set of all finite words over A. In what follows, for simplicity of notation, we assume that symbol 0 ∈ A. For any word w ∈ A * we denote by |w| the length of w, that is the number of letters which form this word. If w is empty word then we put |w| = 0. An infinite word is a mapping w : N → A, hence we may view it as an infinite sequence w 1 w 2 , . . . where w i ∈ A for any i ∈ N. The set of all infinite words over alphabet A is denoted by A N . By 0 ∞ we will denote the infinite word 0 ∞ = 000 . . . . If x ∈ A N and i ≤ j are integers then we denote x [i, j) = x i x i+1 . . . x j−1 and by L(X ) we denote the language of subshift X , that is, the set L(X ) := {x [0,k) : x ∈ X, k ≥ 0}. If a word u ∈ A * appears in z ∈ A N (the same for z ∈ A * ), then we denote it by u z and say that u is a subword of z. If u k is a sequence of words such that |u k | −→ ∞ then we write z = lim k→∞ u k if the limit z = lim k→∞ u k 0 ∞ exists in A N .
The set A is provided with the discrete topology and A N is endowed with the product topology that is equivalently metrizable by the metric d : where k is the length of maximal common prefix of x and y, that is k = max{i : The collection of all cylinder sets form a basis of the topology of + n . Observe that x ∈ + n is a minimal point for σ if for any open and nonempty set U there exist a positive number m such that for any A Hausdorff space X is perfect if it has no isolated points, and a Cantor space if it is non-empty, compact, totally disconnected, perfect metrizable space. We say that a subset in a Hausdroff space is a Cantor set if it is a Cantor space with respect to relative topology, and a Mycielski set if it can be presented as a countable union of Cantor sets.
We present here a simplified version of Mycielski's theorem ( [17], Theorem 1) that will play a crucial role in the proof of Theorems 4.1 and 4.3.
Theorem 2.1 (Mycielski) Let X be perfect complete metric space and let R n ⊂ X n be residual subsets in X n for each n ∈ N. Then there is a dense Mycielski set S ⊂ X with the property that (x 1 , x 2 , . . . , x n ) ∈ R n for any n ∈ N and any pairwise distinct points x 1 , x 2 , . . . , x n ∈ S. Remark 2.2 Clearly, we may apply Mycieski theorem when R n are defined only for n ∈ F where F ⊂ N. Simply, for n / ∈ F we can put R n = X n .

Construction ofω-Chaotic Set in Full Shift
In what follows, we will need the following simple fact (e.g. see [18,Lemma 3.8

]):
Lemma 3.1 For every dynamical system (X, f ) the following conditions are equivalent:

with dense orbit such that for any non-empty and open neighbourhood U of x there is an integer n
Fix k > 0 and put A = 0 k and B = 0 k 1. Define a Finally, we put . . the subshift X k defined by (3.1) has following properties: Proof Fix any k > 0. First we claim, that if we fix any integer r ≥ 0 then for all non-negative integers j, both a (k) r + j can be presented as concatenations of a (k) r and b (k) r . We prove this fact by induction on j. Indeed, for j = 0 the claim follows by the definition. Now assume, that the claim holds for some j ≥ 0. By the definition To prove (i) that X k is minimal we show that any point x from X k is a minimal point. To do so, fix any z (k) , its open neighbourhood U and let p > 0 be an integer such that l+1 as a subword and both of them contain a (k) l as a subword. This shows that z We will prove (ii) by reducing to Lemma 3.1. Let us fix any non-empty open We claim that there are u t and u t+1 such that and |u t+1 | = |u t | + 1 for some t > 0. To prove this fact, we firstly show that for every positive number r we have |b (k) r | = |a (k) r | + 1. It is obviously true for r = 0. Now assume, that the following equalities |b hence by the induction it is clear that r +1 are its subwords, which gives (3.2). Since U was arbitrarily chosen, X k is weakly mixing by Lemma 3.1.
To show (iii) let us suppose that X m ∩ X n = ∅ for some m = n. We may assume that m > n. Let z ∈ X m ∩ X n . Then there is 1 where each of these words ends with 1. Hence the longest allowed block of consecutive zeros in z (n) is bounded by which is a contradiction. This completes the proof. Now we continue with the construction of anω-chaotic map. Let x ∈ + 2 and let P = { p i } ∞ i=1 = {2, 3, 5, . . .} be an increasing sequence consisting of all prime numbers.

Lemma 3.3
Fix any z ∈ ω σ (z x ). Then one of the following conditions is satisfied: there is j such that x j = 1 and z = 0 m y for some m ≥ 0 and y ∈ X j , (iii) there is j such that x j = 1 and z = 0 s w0 ∞ for some w ∈ L(X j ) and some s ≥ 0, Proof Let x ∈ + 2 and fix z ∈ ω σ (z x ). Note that by the definition, we have z x = φ x (2)0φ x (3)0 2 φ x (4)0 3 . . .. Let us analyze the structure of u k = (z x ) [s k ,s k +k) where s k is an increasing sequence such that We have exactly four possibilities on the structure u k depending on the relative position of u k in z x with respect to blocks 0 n connecting words φ x (n).
(a) First case is when u k = 0 k , for every k. Then we immediately get z = lim k→∞ u k = 0 ∞ which is condition (i).
which proves the setting of (ii), that is z = 0 m y for some y ∈ X j . (c) Similarly we show that it may happen that z = w0 ∞ for some w ∈ L(X j ) which appears when u k = φ x (n) [|φ x (n)|− p,|φ x (n)|) 0 k− p for every k, where n depends on k and p is fixed and has the same value for all k. Note that φ x (n) [|φ x (n)|− p,|φ x (n)|) is finite hence is the same for infinitely many n (and as a result infinitely many k). In other words, since z = lim k→∞ u k exists, we obtain that z = φ x (n) [|φ x (n)|− p,|φ x (n)|) 0 ∞ for some n. This is the case (iii) with s = 0, ψ 2 (n) and its suffix is w. (d) The remaining situation that we have in (iii) is z = 0 s w0 ∞ for some s > 0. Note that if x j is 1 and n has decomposition into primes n = p r j .... where, p j is smallest prime in decomposition, we may obtain u k of the form where t is the same for all k and words w k are possibly changing with k. But n tends to infinity, so without loss of generality we may assume that w k is an empty word. If r increases with n then |a ( j) r | → ∞, which reduces to the case (ii). The other situation is that r stabilizes, but then z = 0 t a ( j) r 0 ∞ which is the case (iii). We considered all the possibilities of the structure of u k , hence the proof is completed.

Lemma 3.5 Function ζ : x → z x is continuous and ζ(Q) is a Cantor set (where Q is provided by
Proof First we show that function ζ : x → z x is continuous, i.e. for every ε > 0 exist δ > 0 such that d(x 1 , x 2 ) < δ gives d(z x 1 , z x 2 ) < ε. Fix any ε > 0 and take k > 0 such that ε > 2 −k . It is enough to provide δ > 0 such that z x 1 and z x 2 have common prefix of length at least k, since then d(z k] , and so it is enough to put δ = 2 −k . Indeed, ζ is continuous. Let Q be the Cantor set provided by Lemma 3.4. Since ζ is continuous, ζ(Q) is compact. But ζ is also injective, hence Q does not have isolated points. This shows that ζ(Q) is a perfect subset in a totally disconnected space, hence is a Cantor set. Now, fix any x 1 , . . . , x n ∈ Q. There is k such that x 1 (k) = x 2 (k) = · · · = x n (k) = 1. Then by the definition of z x i we obtain that X k ⊂ ω σ (z x i ) for i = 1, . . . , n. Similarly, there is s such that x 1 (s) = x 2 (s) = · · · = x n−1 (s) = 1 and x n (s) = 0. Then X s ⊂ ω σ (z x i ) for i = 1, . . . , n−1 and by Lemma 3.3 we obtain that X s ∩ω σ (z x n ) = ∅. Indeed, conditions (3.3) and (3.4) are satisfied and the proof is finished. By Lemma 3.5 (see also Lemma 3.2) we directly obtain the following. Simply, it is enough to put D = ζ(Q).

Theorem 3.6 There exists a Cantor set D ⊂ +
2 such that for any n ≥ 2 and any distinct z 1 , . . . , z n ∈ D there are s, k > 0 such that:

contains an uncountable weakly mixing minimal set (hence is nonempty).
In particular D is anω-scrambled set for σ . Since f is a transitive interval map, there exists p ∈ (0, 1) such that for every ε > 0 and every j there is n such that (ε,

Dimension One and Beyond
In particular, there is n and a Cantor set C j such that f n (U j ) ∩ C j = C j . By [24,Remark4.3.6], there exists a Cantor set D j ⊂ U j such that f n | D j is one-to-one and Putting M = ∞ j=1 D j we obtain a dense Mycielski set. But for every n we have ω f (x) = ω f ( f n (x)), and sets C j were pairwise disjoint, hence M isω-scrambled.
Before proceeding, we will need the following result by Oxtoby and Ulam (see [21,Thm. 9]).  Clearly T = f × f is a special type of triangular map, hence we have also the following. A computer simulation, showing how ω-limits sets of a triple in a map T = f × f when f is the standard tent map can look like is presented on Fig. 1. Points x 1 , x 2 , x 3 ∈ [0, 1] 2 were chosen in such a way that (0, 0)

Almost Equicontinuous Example
The aim of this section is to construct a compact set X and anω-chaotic homeomorphism F on it which is almost equicontinuous (however is not transitive). We will construct the space X (and the map F) in a few steps. Let us first recall the definition of equicontinuity and almost equicontinuity (see [10])

Definition 5.1
Let (X, f ) be a dynamical system.
(1) The set E ⊆ X of equicontinuous points of (X, f ) is defined by Denote by S 1 the unit circle with metric induced from the complex plane. Start with the irrational rotation of the unit circle R : S 1 → S 1 and for n = 1, 2, . . .
0 ) for all j ∈ Z. We will perform a construction similar to that of a Denjoy map (see [5,Example 14.9] or [3, Theorem 7.2.3]). As the first step of our construction we remove all points x (n) j from S 1 and fill each obtained hole with a closed interval I n j of length 4 −| j|−n . Clearly ∞ n=1 j∈Z 4 −| j|−n < ∞ so this new extended space can be identified again with S 1 . Denote by π : S 1 → S 1 factor map which collapses back intervals I n j . There is also a natural induced homeomorphism g (Denjoy map) defined on the extended circle: (1) each interval I n j is mapped homeomorphicaly onto I n j+1 , (2) if all intervals I n j are collapsed back into single points x (n) j then g reverts back to the map R.
In particular condition R • π = π • g is satisfied. If we denote C = S 1 \ n>0, j∈Z I n j then clearly π | C is one to one (and C is an open set).
Note that diam I n j ≤ 4 −n for every j and for every m there is N m such that ∞ n=1 j∈Z Fix a point z in S 1 which does not belong to the orbit of any x (n) 0 . Since orbit of z under R is dense, we can find sequence of integers a (n,m) increasing with respect to m such that:

Roughly speaking, condition (iii) means that x (n)
−m is closer to R a (n,m) (z) than points x (i) j for small values of i, j.
Denote byẑ ∈ C the unique point such that π(ẑ) = z and for any n denote by b n m one of the endpoints of I n m in such a way that g(b n m ) = b n m+1 for every m ∈ Z. Simply it is enough to fix b n 0 as one of the endpoints of I n 0 and then put b n m = g m (b n 0 ) for every m ∈ Z. Since we have freedom when choosing a (n,m) , in particular we can choose "the side" of x n m approached by orbit of z, we may assume that b n m is closer toẑ than the other endpoint of I n m . Define a sequence ξ j by replacing segments of the orbit of z for iterations j = a (n,m) , . . . , a (n,m) + 2m, putting ξ j = g j−a (n,m) (b n m ) for all these j and keeping ξ j = g j (z) otherwise. Furthermore, we consider only pairs (n, m) with m ≥ n. For j = a (n,m) , . . . , a (n,m) + 2m the distance between ξ j and g j (z) is bounded from the above by R a (n,m) −m increased by the diameters of intervals inserted into points between R j (z) and R j−a (n,m) (x (n) −m ). But by condition (iii) and (5.1) these diameters are bounded from the above, hence |ξ j −g j (z)| < 4 −m+1 for j = a (n,m) , . . . , a (n,m) + 2m. This shows that the constructed sequence is asymptotic to the orbit of z, that is lim j→∞ |ξ j − g j (z)| = 0.
Observe that for any fixed α, by the definition of numbers a (n,m) the sequence p α i i∈Z contains arbitrarily long segments of the orbit g i (z) i∈N , which means that C is contained in the set of accumulation points of each such sequence. Now we will construct main space for our example. Let Q ⊂ + 2 be the set obtained by Lemma 3.4 and ∼ is an equivalence relation defined by (α, x, t) ∼ (α , x , t ) provided that one of the conditions is satisfied: We endow X with the metric ρ given by where (α, x, t) is any member of the class [(α, x, t)] ∼ . If we fix any r = t i for some i ∈ Z then we have two possibilities. Either or there are two b, q ∈ S 1 and n such that In both cases the set Y r is compact. Furthermore, each Y r ⊂ Q × S 1 × {r } which immediately implies that Y is compact (and as a result X is compact too, since ∼ is a closed equivalence relation).
Observe that ρ is well defined, it induces topology which coincides with the quotient topology on X , and hence (X , ρ) is a compact metric space (Fig. 2). In what follows, we will write (α, x, t) ∈ X identifying each such element with the class it represents under ∼. Of course for |t| = 1 we have and then we define G : X → X by It is not hard to see that G is a continuous map.

Lemma 5.2 Dynamical system (X , G) is almost equicontinuous.
Proof Fix any [α, x, t] ∼ ∈ X with |t| < 1. Then x = p α i and t = t i for some i ∈ Z. Fix any ε > 0 and let n be such that 4 −n < ε. Let γ > 0 be such that If we take any [β, y, s] ∼ ∈ U then s = t = t i and y = p β i and for any j ≥ 0 we have is possible only when p β i+ j , p α i+ j ∈ I k l for some k > n and some l ∈ Z. But then We have just proved that G is equicontinuous at each point [α, x, t] ∼ with |t| < 1. In particular the set of equicontinuity points is an open dense set, completing the proof.

Lemma 5.3 Dynamical system (X , G) isω-chaotic.
Proof We claim that the set S = {[α, x, t] ∼ ∈ X : t = 0} isω-scrambled. As we mentioned earlier, for every α ∈ Q we have that accumulation points of the sequence This shows that S satisfies conditions (2) and (3)  . This shows that proving that (1) in Definition 1.2 also holds. The proof is completed.
It is enough to combine Lemmas 5.2 and 5.3 to obtain the following.

Theorem 5.4
There exists an almost equicontinuousω-chaotic dynamical system. Remark 5.5 Note that the set S in the proof of Lemma 5.3 is open (because t = 0 is isolated in the sequence {t n } n∈Z ), but G n (S) ∩ S = ∅ for every n > 0. In particular (X , G) is not transitive.
Almost equicontinuous systems are to some extent very regular. They leave some space for sensitivity, but this space is quite narrow. In that sense we may view almost equicontinuous systems as systems with quite regular dynamics. From this point of view it seems that the definition of ω-chaos (andω-chaos) should be strengthened. In our opinion, the smallest demand should be conditions in Remark 1.3. It also seems reasonable to require in place of Remark 1.3 (ii) a stronger condition: contains an uncountable family of pairwise disjoint uncountable minimal set.
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.