Dynamics of the Induced Shift Map
Puneet Sharma, Anima Nagar

TL;DR
This paper compares the dynamics of the shift map and its induced map on the hyperspace, revealing equivalences in properties like mixing, sensitivity, and expansivity, especially in full shifts and subshifts of finite type.
Contribution
It provides a detailed comparison of shift map dynamics and their induced counterparts on hyperspaces, highlighting equivalences and specific properties in various shift systems.
Findings
Equivalence of mixing and sensitivity in full shifts.
Cofinite sensitivity is equivalent in all subshifts.
All Sturmian subshifts are cofinitely sensitive.
Abstract
In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of symbols. We compare the dynamics of the shift system with its induced counterpart , where is the hyperspace of all nonempty compact subsets of . Recently, such comparisons have been studied a lot for general spaces. We continue the same study in case of shift spaces, and bring out the significance of such a study in terms of sequences. We compare the mixing properties, denseness of periodic points, various forms of sensitivity and expansivity of the shift map and its induced counterpart. In particular, we show their equivalence in case of the full shift. We also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Mathematical Dynamics and Fractals · semigroups and automata theory
111This work is a part of a Ph.D. thesis sucessfully defended in 2011.
DYNAMICS OF THE INDUCED SHIFT MAP
Puneet Sharma and Anima Nagar
[email protected], [email protected]
Abstract.
In this article, we compare the dynamics of the shift map and its induced counterpart on the hyperspace of the shift space. We show that many of the properties of induced shift map can be easily demonstrated by appropriate sequences of symbols. We compare the dynamics of the shift system with its induced counterpart , where is the hyperspace of all nonempty compact subsets of . Recently, such comparisons have been studied a lot for general spaces. We continue the same study in case of shift spaces, and bring out the significance of such a study in terms of sequences.
We compare the mixing properties, denseness of periodic points, various forms of sensitivity and expansivity of the shift map and its induced counterpart. In particular, we show their equivalence in case of the full shift. We also look into the special case of subshifts of finite type, and in particular prove that the properties of weakly mixing, mixing and sensitivity are equivalent in both systems. And in the case of any general subshift, we show that the concept of cofinite sensitivity is equivalent in both systems and for transitive subshifts, cofinite sensitivity is equivalent to syndectic sensitivity. In the process we prove that all sturmian subshifts are cofinitely sensitive.
Key words and phrases:
symbolic dynamics, sequence spaces, hyperspace, induced map
1991 Mathematics Subject Classification:
Primary 37E10; Secondary 37B99, 54H20
The first author thanks CSIR for financial support.
1. INTRODUCTION
Many times dynamical systems are studied by discretizing both time and state space. The basic idea involves in taking a partition of the state space into finite number of regions, each of which can be labelled with some symbol. Time is then discretized by taking iterates of all points in the space. Each itinerary in the state space then corresponds to an infinite sequence of symbols, where the symbols are the labels of the region in the partition given by the trajectory of the point. This ‘Symbolic Dynamics’ though gives an approximation of the actual orbits, but is very useful in capturing the essence of any dynamics.
Symbolic systems are important classes of dynamical systems and have great applicability to topological dynamics and ergodic theory. Their equivalence with many topological dynamical systems and simple computational structure makes them an important class of dynamical systems. They have also been used to approximate various natural processes and predict their long term behavior. Further, it has been seen that most of the dynamical systems, observed in Nature, are collective(set valued) dynamics of many units of individual systems. In particular, the asymptotic behavior of the iterates of any non-empty subset of the space becomes an important study. Hence, there is a strong need to develop a relation between the dynamics on the base space and the hyperspace(space of subsets). Such a study can help in understanding the combined dynamics on systems, which on an individual basis may not be that interesting. This has lead to the study of ‘set-valued dynamics’. Roman Flores [15], Banks [2], Liao, et al [8], Sharma and Nagar [18, 19] have given a comparison of individual dynamics and set-valued dynamics. On the other hand, it has been observed that dynamical systems can be better studied via symbolic dynamics [10, 11, 13]. Also in [16], it is shown that any dynamical system can be realized as a subshift of some shift space.
Some recent studies of dynamical systems, in branches of engineering and physical sciences, have revealed that the underlying dynamics is set valued or collective, instead of the normal individual kind which is usually studied. Some recent studies in Population Dynamics, consider population as local subpopulation in discrete habitat patches, with independent dynamics. This initiates the study of metapopulation dynamics ( see [14]). In Chemical Physics, the individual dynamics of the electron and the nuclei are combined to stimulate the dynamics of large molecular systems containing thousands of atoms ( see [20]). In Atmospheric Sciences, the perturbation of waves is studied as a combined effect of the near-surface, intermediate-level and tropopause-level perturbations upon flow development ( see [7]). In Mechanical Engineering recently, lane keeping controllers have been specifically designed, so that they can be coupled with steering force feedback for better maintenance of lane position in absence of driver steering commands. Artificial damping is further injected to make the combined effect of the system stable, ensuring risk free and safe driving ( see [9]).
With these varieties of dynamics observed, there arises the need of a topological treatment of such collective dynamics. Also, the evolution of trajectories of a chaotic dynamical system is equivalent to symbolic dynamics in an appropriate symbol system. Hence, there is a strong need to develop a relation between the dynamics on the shift system and its induced counterpart on its hyperspace.
In this article, we study the relations between the dynamical behavior of the shift and its induced counterpart . We consequently show that many of the chaotic properties of can be easily exhibited by the sequences in .
2. THEORETICAL PRELIMINARIES
We now introduce some basics from dynamical systems, hyperspace topologies and symbolic dynamics.
2.1. Dynamical Systems
Let (resp. ) be a topological (resp. metric) space and let be a continuous function. The pair is referred as a dynamical system. We state some dynamical properties here, though we refer to [1, 4, 5, 6, 17] for more details.
A point is called periodic if for some positive integer , where ( times). The least such is called the period of the point . If there exists a such that for every and for each there exists and a positive integer such that and , then is said to be sensitive (-sensitive). The constant is called the sensitivity constant for . is said to be cofinitely sensitive, if there exists such that the set of instances there exist with is cofinite. is called syndetically sensitive if there exists with the property that for every -neighborhood of , is syndetic. In general,
is Li-Yorke sensitive if there exists such that for each and for each , there exists with such that but . A very strong form of sensitivity is expansivity. is called expansive (-expansive) if for any pair of distinct elements , there exists such that .
is called transitive if for any pair of non-empty open sets in , there exist a positive integer such that , and is called totally transitive if is transitive for each . is called weakly mixing if is transitive. is called mixing or topologically mixing if for each pair of non-empty open sets in , there exists a positive integer such that for all . is called locally eventually onto (leo) if for each non-empty open set , there exists a positive integer such that . Among the above topological properties, the following relation holds,
2.2. Hyperspace Topologies
For a Hausdorff space , a hyperspace comprises of all nonempty compact subsets of endowed with the topology , where the topology is defined using the topology of . The topology , that we consider here will be either the Vietoris topology or the Hausdorff Metric topology (when is a metric space). We briefly describe these topologies.
Define, = and E . The topology generated by the collection of all such sets, where varies over all possible natural numbers and varies over all possible open subsets of , is known as the Vietoris topology.
For a metric space and for any two non-empty compact subsets of , define, where and . is a metric on and is known as the Hausdorff metric, which generates the Hausdorff metric topology on .
It is known that is compact if and only if is compact and in this case, the Hausdorff metric topology is equivalent to the Vietoris topology. Also, it is known that the collection of finite sets is dense in . We can talk of these topologies for any subspace of . See [3, 12] for details.
2.3. Symbolic Dynamics
We study the sequence space generated by a symbol set , where may be finite or infinite. In general, we study the sequence space or .
Let be a discrete alphabet set ( may be finite or infinite). Let be the space of all infinite sequences over . Define as,
where, and is the discrete metric.
Then, defines a metric which generates the product topology on . Similarly, defines a metric which generates the product topology on , the space of all bifinite sequences over .
It can be seen that the set is a clopen set in , and is referred to as a cylinder set. Any open set, in , is a countable union of such sets. Consequently, the cylinder sets form a basis for the product topology on . The shift (left shift) operator, defined as is known to be continuous when the space is equipped with the metric . We refer the system as the full shift (shift) space.
When is a finite set, (resp. ) is a compact metrizable space. Let be a closed -invariant subset of . If there exists a finite collection of words (finite strings) that are forbidden in any sequence in , then the subsystem is called a subshift of finite type. Every subshift of finite type can be represented by a square matrix. In such a case, the matrix is called the transition matrix for the space .
It may be noted that the subsystems “subshifts of finite type” can be considered also when the symbol set is infinite. We will, however, not consider such cases.
Let be a transition matrix. is said to be irreducible if for every pair of indices and there is an with . Fix an index and let . This is called the period of the index . When is irreducible, period of every index is same and is called the period of . If the matrix has period one, it is said to be aperiodic (see [10, 11, 13]). Also, is transitive if and only if is irreducible. is irreducible and aperiodic if and only if there exists such that for all , is strictly positive. is topological mixing if and only if is irreducible and aperiodic. Also, from [17] the following are equivalent.
-
is totally transitive
-
is weakly mixing.
-
is topological mixing.
We now discuss the case when the alphabets in are elements of some metric space, i.e. when is a general metric space. Then, equipped with the metric
generates the product topology on .
For any set of symbols , let be endowed with metric (which is or , depending on the space ). In all such cases, is a dynamical system.
From [16] we see that if be a compact dynamical system, and , then is a shift invariant subset of and thus, is a subsystem of the full shift . Also, if we define,
Then, is one-one, onto and continuous function satisfying the relation . Thus, the system is conjugate to the system . This leads to the observation that for any dynamical system , there exists such that the system is conjugate to the system .
Also, [17] proves that a point in is a point of sensitivity for the system if and only if it is not isolated. Though, in [17], this has been proved for the case of a discrete alphabet set, it can be easily established for the case when the alphabet set is any general metric space.
Hence, to study any dynamical system, it is sufficient to study a subsystem of an appropriate symbolic system. Henceforth, we shall constrain ourselves to the subsystems of the symbolic space , where the symbol set comprises of the points in the metric space , where is the discrete metric in case is a discrete alphabet set.
3. MAIN RESULTS
3.1. We first consider the case when is the full
shift, i.e. .
It has been shown that if has dense set of periodic points, also has the same [2, 18]. We, prove the same result in terms of sequences.
Proposition 3.1**.**
* has dense set of periodic points.*
Proof.
Let be any open set. As the set of finite sequences in is dense in , let , where . Then, there exists such that .
Let \bar{y}^{j}=x^{j}_{0}x^{j}_{1}\ldots x^{j}_{r}x^{j}_{0}x^{j}_{1}\ldots x^{j}_{r}x^{j}_{0}x^{j}_{1}\ldots x^{j}_{r}\ldots\ for .
Each is periodic under with period and .
Thus, is a periodic point in with period . ∎
The system is locally eventually onto for any alphabet set . And we also have
Proposition 3.2**.**
* is locally eventually onto.*
Proof.
Let be a non empty open set in . As set of finite sequences is dense in , let where . Thus, there exists such that .
We shall show that . Let . Let . Then, is a compact subset of . Let . Then, . Also, . As was arbitrary, . Hence the result. ∎
This can also be seen in a general case, but our proof is specialized for sequences. The case of sensitivity is not very simple in general(see [19]). But, we observe that is sensitive for any discrete alphabet set , with sensitivity constant . Similarly,
Proposition 3.3**.**
* is sensitive with sensitivity constant .*
Proof.
To establish sensitivity on the induced system, it is sufficient to prove sensitivity on the collection of all finite subsets, since finite sets are dense in .
Let be a finite subset where . Let and let be an -neighborhood of . Let such that . Pick such that .
Let where .
Then, and .
Consequently, .
∎
For sensitivity, we use the discrete metric on to establish the sensitivity on the hyperspace. However, if is equipped with a metric and , a similar proof establishes the sensitivity for the induced map on the hyperspace, with sensitivity constant .
Proposition 3.4**.**
For any alphabet set , containing at least two elements,
1. is Li-Yorke sensitive.
2. is Li-Yorke sensitive.
Proof.
- We note that when is a discrete alphabet set, is Li-Yorke sensitive. For the sake of completion we include the proof of the case when is a metric space.
Let and let be an -neighborhood of . Let such that . For each , choose such that . where . Replace -th entries( i.e. ) in the sequence for by (keeping all others same) to obtain new sequence . Consequently, . Further, and for infinitely many . Thus, the space is Li-Yorke sensitive.
- We now prove that the system is Li-Yorke sensitive. It suffices to show the same in case of the alphabet set being equipped with a metric , and .
We now prove that is Li-Yorke sensitive. Let and let () be a neighborhood of in the hyperspace. Since is totally bounded and periodic sequences are dense in , let be the finite set of words such that -ball around the sequences covers . Let each be of length and let be the least common multiple of all such lengths.
As is compact, we construct the set of finitely many words such that -ball around the sequences covers the set . Let be the least common multiple of lengths of all words in .
Inductively, define the set as the set of finitely many words such that -ball around the sequences covers the set .
Let . For each , choose such that .
Construct the set , where the repetitions of are made till length is achieved and varies over all possible entries in .
We see that .
Let be any limit point of . Then, there exists a sequence such that . But, in any sequence , the first entries are repetitions of words from , which has finite number of choices. Hence, there exists a subsequence and a word such that first entries are repetitions of for each member of the subsequence .
Also, . And so, in , the first entries are repetitions of and the entry will be . Again, the next entries in each are repetition of words from , which have finite number of choices. Hence, there exists a subsequence in which the next entries are repetitions of a word . Consequently, the next entries in are repetitions of the word . Inductively, we see that is solely of the form of sequences in , implying that i.e. is closed.
Then, with and . Thus, is Li-Yorke sensitive. ∎
3.2. We now consider the case when is a subshift of
finite type described via the transition matrix ,
where,
M=\left(\begin{array}[]{ccccc}m_{11}&m_{12}&.&.&m_{1n}\\ m_{21}&m_{22}&.&.&m_{2n}\\ .&.&.&.&.\\ .&.&.&.&.\\ m_{n1}&m_{n2}&.&.&m_{nn}\\ \end{array}\right)
with each or .
Let . Let be a matrix indexed by entries of defined as,
Then is a square matrix of order , given as,
M^{*2}=\left(\begin{array}[]{cccccccc}m_{11}m_{11}&.&.&m_{1n}m_{1n}|&.&.&.&m_{1n}m_{1(n-1)}\\ m_{21}m_{21}&.&.&m_{2n}m_{2n}|&.&.&.&.\\ .&.&.&.&.&.&.&.\\ \underline{m_{n1}m_{n1}}&\underline{.}&\underline{.}&\underline{m_{nn}m_{nn}}|&.&.&.&.\\ .&.&.&.&.&.&.&.\\ .&.&.&.&.&.&.&.\\ .&.&.&.&.&.&.&.\\ m_{n1}m_{(n-1)1}&.&.&.&.&.&.&m_{nn}m_{(n-1)(n-1)}\\ \end{array}\right)
When comprises of elements, the transition matrix provides the dynamical behavior of the system, giving the details of how two given regions, labelled by distinct alphabets, of the system interact. In the matrix generated above, gives the details of simultaneous interaction of the and regions of the original system respectively. As the entries vary over all possible combinations, the matrix determines the dynamics of . Thus, the system can be embedded into certain symbolic dynamical system of symbols. This is similar to the concept of “higher block codes” discussed in [11].
Similarly, let . Let be a matrix indexed by entries of defined as,
Then is a square matrix of order , given as
M^{*k}=\left(\begin{array}[]{cccccccc}m_{11}m_{11}\ldots m_{11}&.&.&m_{1n}m_{1n}\ldots m_{1n}|&.&.&.&m_{1n}m_{1n}\ldots m_{1n}m_{1(n-1)}\\ m_{21}m_{21}\ldots m_{21}&.&.&m_{2n}m_{2n}\ldots m_{2n}|&.&.&.&.\\ .&.&.&.&.&.&.&.\\ \underline{m_{n1}m_{n1}\ldots m_{n1}}&\underline{.}&\underline{.}&\underline{m_{nn}m_{nn}\ldots m_{nn}}|&.&.&.&.\\ .&.&.&.&.&.&.&.\\ .&.&.&.&.&.&.&.\\ .&.&.&.&.&.&.&.\\ m_{n1}m_{n1}\ldots m_{n1}m_{(n-1)1}&.&.&.&.&.&.&m_{nn}m_{nn}\ldots m_{nn}m_{(n-1)(n-1)}\\ \end{array}\right)
Arguing as before, the matrix determines the simultaneous interaction of a set of regions of the original space, with another set of regions of the same space. The matrix hence determines the dynamics of , where the cartesian product is taken number of times.
It can be observed that the first block in is just .
The Vietoris topology is generated by sets of the form . Hence, while studying the hyperspace under Vietoris topology, it is sufficient to study the simultaneous behavior of finitely many regions of the original space. Consequently, the behavior of the matrices is sufficient to study the dynamics of the hyperspace .
For a dynamical system , is weakly mixing if and only if for every , is transitive [8]. Thus, is weakly mixing if and only if is transitive for each , and by the discussion above, if and only if is irreducible for .
This proves that on a subshift of finite type, described via a transition matrix , is weakly mixing if and only if for every , is irreducible. And also establishes that the following are equivalent :
-
is weakly mixing
-
is weakly mixing
-
is transitive
Similarly, the following are equivalent :
-
is topologically mixing
-
is topologically mixing
Also is irreducible and aperiodic if and only if is irreducible and aperiodic for all , establishing that is topologically mixing if and only if is topologically mixing.
Transitivity of the induced system is equivalent to weak mixing of the original system . But, if the system is transitive, the induced system may fail to be transitive. This can be illustrated by a simple counterexample :
Example 3.5**.**
Let be the subshift of finite type given by the matrix
M=\left(\begin{array}[]{cccc}0&0&1&1\\ 0&0&1&1\\ 1&1&0&0\\ 1&1&0&0\\ \end{array}\right)
Then, is irreducible and hence generates a transitive subshift. However is not irreducible for . Hence, the induced map is not transitive.
Remark 3.6**.**
The above results involving transitivity, weakly mixing and mixing are known in the case of any general dynamical system . See [2, 15, 18]
Whereas for sensitivity we can observe that
Proposition 3.7**.**
* is sensitive if and only if is sensitive.*
Proof.
Let be a subshift of finite type and let be sensitive. We now show that is sensitive. In order to prove this, we show that the induced map, , is sensitive on all finite subsets of , with a uniform sensitivity constant. Without loss of generality, we assume that all forbidden words for have the same length, say .
Let be a finite subset of and let be a neighborhood of , . We show that is sensitive on with sensitivity constant .
For each , in the sequence , we see the possible number of options for the next entry . If more than one option is available, we find a sequence with this entry replaced, or otherwise move to the next entry. We need to continue this process for only the next entries, since at least one of the entries and will be different for . Otherwise, if each entry has a unique option, it means that there is only one allowed word of length . This will contradict the sensitivity of . Thus, we find sequences such that for each , at least one of the entries and are different for .
Therefore, for each , .
Construct the set as,
\bar{z}^{i}=\left\{\begin{array}[]{ll}\bar{y}^{i},&\hbox{D(\sigma^{n}(\bar{x}^{1}),\sigma^{n}(\bar{y}^{i}))\geq\frac{1}{2^{M+1}};}\\ \bar{x}^{i},&\hbox{\mbox{otherwise}.}\\ \end{array}\right.
Therefore, is at least apart from , . Thus, , and hence is sensitive.
Conversely, let be sensitive with sensitivity constant . For and for , let be an -neighborhood of . Then, there exists and such that . Thus, there exists a sequence such that . Consequently, we get establishing the sensitivity of . ∎
Remark 3.8**.**
It is known that when the system is cofinitely sensitive, then so is and vice-versa [19]. And since sensitive subshifts of finite type are cofinitely sensitive, the above result should hold as a special case of the general result. We however prove this in terms of sequences, without referring to the cofinite sensitivity of the space.
3.3. We now consider the case when is
any subshift of ,
where can be any alphabet set.
The system induces the subsystem .
Proposition 3.9**.**
If has dense set of periodic points, then so does .
Proof.
Let and let be a neighborhood of in the hyperspace. As finite set of points in are dense in , there exists such a finite set , where each . Further, there exists such that . As periodic points are dense in , is a periodic point of period in . Let . Then, is a periodic point of with period , contained in . Thus, periodic points are dense in . ∎
The result proved above is a manifestation of the known result in the general case. It is known that the system can be seen as a subsystem of . And by expanding the symbol set (of the original system) to an appropriate cardinality the system can be embedded into the symbolic space of these new symbols. Then if is transitive, under successive iterations, any two regions of the space labelled by distinct symbols interact. The same holds for the original set of symbols. Consequently, any two regions of the original dynamical system interact under iterations of the map making the transitive.
Similarly, we observe that
Proposition 3.10**.**
* is weakly mixing if and only if is weakly mixing.*
Proof.
Let be weakly mixing. Let , and , be two pairs of open sets in the hyperspace. As finite sets are dense in the hyperspace, let , . Further, there exists such that , . As is weakly mixing, there exists , , , and such that . Thus, such that for . Thus, is weakly mixing.
The converse can be deduced similarly as discussed above. ∎
Proposition 3.11**.**
* is topological mixing if and only if is topological mixing.*
Proof.
Let be topologically mixing. Let , be non empty open sets in the hyperspace. As finite sets are dense in , let , . Further, there exists such that . As is topological mixing, for each , there exists such that for any , there exists such that . Let . Thus, for each , there exists such that .
Thus, since , this ensures . As the above can be done for all , is topological mixing.
The converse can be deduced similarly as above. ∎
Remark 3.12**.**
Similar techniques have been used to prove the above result in a much more general setting [2, 15, 18]. The result below also uses techniques similar to the general form as in [19].
Whereas for sensitivity,
Proposition 3.13**.**
* is cofinitely sensitive if and only if is cofinitely sensitive.*
Proof.
Let be cofinitely sensitive. We prove that is cofinitely sensitive, by showing that is cofinitely sensitive on the set of all finite sets in .
It will suffice to prove the result in case of the alphabet set being discrete. In case is equipped with some metric , the sensitivity constants can be suitably modified.
Without loss of generality, let be cofinitely sensitive with sensitivity constant . This implies that for any neighborhood of , there exists such that for each , there exists such that .
Let . Let be a neighborhood of where . For each and each neighborhood , there exists such that for each , , for some .
Let . For each and for each , there exists such that .
Therefore, for each , for each , .
Construct the set as,
\bar{z}^{i}=\left\{\begin{array}[]{ll}\bar{y}^{i\ l},&\hbox{D(\sigma^{n}(\bar{x}^{1}),\sigma^{n}(\bar{y}^{i\ l}))\geq\frac{1}{2^{M+1}};}\\ \bar{x}^{i},&\hbox{\mbox{otherwise}.}\\ \end{array}\right.
Therefore, is at least apart from , . Thus, . As such sets can be constructed for all , is cofinitely sensitive.
Conversely, Let and let be given. As is cofinitely sensitive with sensitivity constant and is -neighborhood of , there exists such that for each , there exists such that . Consequently, there exists a sequence such that . As the existence of the set is guaranteed for all , for each such integer , we obtain such that . Hence is cofinitely sensitive. ∎
In case of transitive subshifts, cofinite sensitivity and syndetic sensitivity turn out to be equivalent. Though, this equivalence holds for any alphabet set, we prove it below only for the case of discrete alphabet.
Proposition 3.14**.**
Let be a transitive subshift. Then, is cofinitely sensitive if and only if is syndetically sensitive.
Proof.
Since every cofinitely sensitive map is syndectically sensitive, we only need to prove that is cofinitely sensitive whenever is syndetically sensitive.
Let be syndetically sensitive and let be the point with dense orbit. Let be the bound for syndetic sensitivity of the cylinder . It can be seen that is the bound for syndetic sensitivity of any other cylinder of the form .
Let and let be a neighborhood of . As the bound for syndetic sensitivity for any cylinder around must be , there exists some such that for each instant , there exists such that . Consequently, . Thus is cofinitely sensitive at each point of the orbit of with the same sensitivity constant. As is dense, is cofinitely sensitive. ∎
Corollary 1**.**
Let be a transitive subshift. is syndetically sensitive if and only if is syndetically sensitive.
One of the important examples of subshifts are the *Sturmian subshifts *( see [17]). They are minimal shifts and it has been shown in [17] that Sturmian subshifts are syndetically sensitive.
Corollary 2**.**
All Sturmian subshifts are cofinitely sensitive. And hence, the corresponding induced map on the hyperspace of its compact subsets is also cofinitely sensitive.
The above corollary contradicts the result in [17] which states that no Sturmian subshift is cofinitely sensitive. The error there is a trivial one (follows from the definition there).
There exist subshifts such that is not sensitive [ishs]. The example constructed there is not syndetically sensitive, and hence not cofinitely sensitive. Does that mean all subshifts , for which is sensitive, need to be either syndetically sensitive or cofinitely sensitive. We answer this in the negative, by giving an example (from [17]) of a subshift which is not syndetically sensitive, but for which happens to be sensitive.
Example 3.15**.**
Let be a strictly increasing sequence of natural numbers. Inductively, define a sequence of words as,
[TABLE]
Put
Clearly, is a recurrent point for the dynamical system , where denotes the left shift on the sequence space of two symbols.
Define where,
It has been shown in [17], that defined above is sensitive, but not syndetically sensitive. We here prove that is sensitive.
We first show that elements of the form are limit points of the orbit of under the map . It is sufficient to show that all elements of the form are limit points of the orbit.
It can be seen that is the word . Similarly contains the word , contains the word and so on. Consequently, all the sequences of the form are limit points of the orbit and hence every sequence of the form is a limit point of the orbit.
As is dense in , the set for all is dense in . We shall, equivalently, show that is sensitive on .
Let . Let be its neighborhood, where each is a neighborhood of . As , let for some . Let . Then, there exists for each . Consider the set . The set reduces to the constant sequence after some finite iterations. Thus, there exists such that . Consequently, is sensitive on .
And for expansivity, we have
Proposition 3.16**.**
For any alphabet set , is expansive implies is expansive. However, the converse does not hold in general.
Proof.
Let be -expansive and let . Then, as is expansive, for , there exists such that . Consequently, . Thus, is also -expansive.
We now provide an example to show that the converse is not true.
Let be the sequence space of two symbols [math] and and let be the hyperspace of all non empty compact subsets of . It can be easily observed that is expansive with expansivity constant . However, we prove that the system is not expansive.
Let if possible, be expansive with expansivity constant . Let such that .
Let be the set of all sequences comprising of all [math]’s except one string of ’s of length , . Let be the set of all sequences comprising of all [math]’s except one string of ’s of length , . Then, . Also, , . Thus, for any , which contradicts the definition of .
Thus, the system is not expansive. ∎
A similar result for expansivity holds in case of a general dynamical system . See [18] for details.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Akin Ethan and Kolyada Sergii, Li-Yorke Sensitivity, Nonlinearity, 16(2003) 1421 - 1433.
- 2[2] Banks John, Chaos for induced hyperspace maps, Chaos, Solitons and Fractals, 25(2005) 681 - 685.
- 3[3] Beer Gerald, Topologies on Closed and Closed Convex Sets, Kluwer Academic Publishers, Dordrecht/Boston/London (1993).
- 4[4] Block L. and Coppel W., Dynamics in one dimension, Springer-Verlag, Berlin Hiedelberg (1992).
- 5[5] Brin Michael and Stuck Garrett, Introduction to dynamical systems, Cambridge Unversity Press (2002).
- 6[6] Devaney Robert, Introduction to chaotic dynamical systems, Addisson Wesley (1986).
- 7[7] Dirren Sebastien and Davies Huw , Combined dynamics of boundary and interior petrubations in the Eddy setting, Journal of the atmospheric Sciences , vol 61, 13 (2004) 1549-1565.
- 8[8] Gongfu Liao, Xianfeng Ma and Lidong Wang, Individual chaos implies collective chaos for weakly mixing discrete dynamical systems, Chaos, Solitons and Fractals, 32 (2007) 604-608.
