Some criteria of chaos in non-autonomous discrete systems
Hua Shao, Guanrong Chen, Yuming Shi

TL;DR
This paper develops new criteria for chaos in non-autonomous discrete systems, extending existing results for autonomous systems and relaxing assumptions, with applications to Li-Yorke and distributional chaos.
Contribution
It introduces novel criteria for chaos in non-autonomous systems, broadening the theoretical understanding and applicability compared to prior autonomous system results.
Findings
Criteria for strong Li-Yorke chaos established
Distributional chaos criteria in sequences derived
Conditions for chaos induced by coupled-expansion identified
Abstract
This paper establishes some criteria of chaos in non-autonomous discrete systems. Several criteria of strong Li-Yorke chaos are given. Based on these results, some criteria of distributional chaos in a sequence are established. Moreover, several criteria of distributional chaos induced by coupled-expansion for an irreducible transition matrix are obtained. Some of these results not only extend the existing related results for autonomous discrete systems to non-autonomous discrete systems, but also relax the assumptions of the counterparts. One example is provided for illustration.
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
TopicsMathematical Dynamics and Fractals · Nonlinear Dynamics and Pattern Formation · Chaos control and synchronization
**Some criteria of chaos in non-autonomous discrete systems
**
Hua Shao*†, Guanrong Chen†, Yuming Shi‡*
† Department of Electronic Engineering, City University of Hong Kong,
Hong Kong SAR, P. R. China
‡ Department of Mathematics, Shandong University
Jinan, Shandong 250100, P. R. China
Abstract. This paper establishes some criteria of chaos in non-autonomous discrete systems. Several criteria of strong Li-Yorke chaos are given. Based on these results, some criteria of distributional chaos in a sequence are established. Moreover, several criteria of distributional chaos induced by coupled-expansion for an irreducible transition matrix are obtained. Some of these results not only extend the existing related results for autonomous discrete systems to non-autonomous discrete systems, but also relax the assumptions of the counterparts. One example is provided for illustration.
Keywords: non-autonomous discrete system; strong Li-Yorke chaos; distributional chaos; coupled-expansion; irreducible transition matrix.
2010 Mathematics Subject Classification: 37B55, 37D45, 37B10.
1. Introduction
Chaos of the non-autonomous discrete system (briefly, NDS)
[TABLE]
has attracted considerable attention recently [1, 2, 7, 10, 11, 12, 14, 16, 17, 19, 21, 25, 26], where is a sequence of maps from to , with being a metric space. Many complex systems of real-world problems in the fields of biology, physics, chemistry and engineering, are indeed non-autonomous, putting the model (1.1) into focus. The positive orbit of system (1.1) starting from an initial point is given by , where , .
Coupled-expansion is always associated with chaos [1, 3, 4, 5, 6, 8, 10, 13, 14, 15, 16, 20, 21, 22, 23]. In 2009, the concept of coupled-expansion for a transition matrix was extended to NDSs, for which a criterion of strong Li-Yorke chaos was established in [14]. Later, the assumptions in this result were weakened in [10], where some new criteria of strong Li-Yorke chaos were established via coupled-expansion for an irreducible transition matrix in bounded and closed subsets of a complete metric space, and in compact subsets of a metric space, respectively. Then, a new concept of weak coupled-expansion for a transition matrix was introduced for NDSs, and several criteria of chaos induced by weak coupled-expansion for an irreducible transition matrix were established in [21]. Recently, Li-Yorke -chaos for some and distributional -chaos in a sequence for some were proved to be equivalent for system (1.1) in the case that is a compact metric space and are continuous maps for all [11]. Consequently, those criteria of strong Li-Yorke chaos can be regarded as criteria of distributional chaos in a sequence for system (1.1). It arouses our interest to investigate the relationship of coupled-expansion for a transition matrix and distributional chaos in a sequence for system (1.1). In the present paper, we establish some new criteria of strong Li-Yorke chaos for system (1.1), which not only relax the assumptions of the counterparts in the literature, but also can be regarded as criteria of distributional chaos in a sequence under certain conditions.
Recall that distributional chaos is a special kind of distributional chaos in a sequence in the case that the sequence is the set of all nonnegative integers. However, generally it is stronger than distributional chaos in a sequence. In 2015, one criterion of distributional chaos induced by coupled-expansion for a transition matrix was established for autonomous discrete systems [6]. Motivated by this result, here we are interested in finding some criteria of distributional chaos induced by weak coupled-expansion for a transition matrix for the non-autonomous system (1.1).
The rest of the present paper is organized as follows. Section 2 presents some basic concepts and useful lemmas. In Section 3, two criteria of strong Li-Yorke chaos for system (1.1) are obtained, which relax the assumptions of the counterparts in the literature (see Remark 3.1). Moreover, other two criteria of strong Li-Yorke chaos are derived by applying the relationship of Li-Yorke chaos between system (1.1) and its induced system. In Section 4, some criteria of distributional chaos in a sequence are established for system (1.1) by the results obtained in Section 3. Furthermore, several criteria of distributional chaos induced by weak coupled-expansion for an irreducible transition matrix are obtained. Finally, an example is provided in Section 5 for illustration.
2. Preliminaries
In this section, some basic concepts and useful lemmas are presented.
For convenience, denote and , , . Let be nonempty subsets of . The boundary of is denoted by ; the diameter of is denoted by ; and the distance between and is denoted by . The set of all nonnegative integers and positive integers are denoted by and , respectively.
Definition 2.1 ([14], Definition 2.7). System (1.1) is said to be Li-Yorke -chaotic for some if it has an uncountable Li-Yorke -scrambled set in ; that is, for any ,
[TABLE]
Further, it is said to be chaotic in the strong sense of Li-Yorke if all the orbits starting from the points in are bounded.
Definition 2.2 ([11], Definitions 2.1 and 2.2). System (1.1) is said to be distributionally -chaotic in a sequence for some if it has an uncountable distributionally -scrambled set in ; that is, for any and any ,
[TABLE]
where is the characteristic function defined on the set . Further, if , then system (1.1) is said to be distributionally -chaotic.
The relationship between Li-Yorke chaos and distributional chaos in a sequence for system (1.1) is shown below.
Lemma 2.1 ([11], Theorem 3.6). Let be compact and be continuous in , . Then, system (1.1) is Li-Yorke -chaotic for some if and only if it is distributionally -chaotic in a sequence for some .
A matrix () is said to be a transition matrix if or for all ; for all ; and for all , . A transition matrix is said to be irreducible if, for each pair , there exists such that , where denotes the entry of matrix . A finite sequence is said to be an allowable word of length for if , , where , . For convenience, the length of is denoted by and , .
The one-sided sequence space is a metric space with the metric , where , if , and if , . Note that is a compact metric space. Define the shift map by . This map is continuous and is called the one-sided symbolic dynamical system on symbols. For a given transition matrix , denote
[TABLE]
is a compact subset of and invariant under . The map is said to be a subshift of finite type for matrix . For more details about symbolic dynamical systems and subshifts of finite type, see [9, 24].
The following two lemmas will also be useful in the sequel.
Lemma 2.2 ([18], Lemma 2.2). * has an uncountable subset such that for any different points , for infinitely many and for infinitely many .*
Lemma 2.3 ([22], Theorem 2.2). Let be an irreducible transition matrix with for some . Then
- (i)
for any and any , there exists at least one allowable word for such that ;
- (ii)
for any given allowable word for , if , then there exists another different allowable word for with and .
Next, the definition of weak coupled-expansion for a transition matrix is introduced.
Definition 2.3. Let be a transition matrix. If there exists a sequence of nonempty subsets of with () for any and such that
[TABLE]
then system (1.1) is said to be (strictly) weakly -coupled-expanding in , . In the special case that for all and , it is said to be (strictly) -coupled-expanding in , .
Remark 2.1. Definition 2.3 is a slight revision of Definition 2.4 in [21].
3. Some criteria of strong Li-Yorke chaos
In this section, two criteria of strong Li-Yorke chaos for system (1.1) are established. Further, other two criteria of strong Li-Yorke chaos are given by applying the relationship of Li-Yorke chaos between system (1.1) and its induced system.
The following result can be easily verified.
Lemma 3.1. Let be a transition matrix and , , be disjoint nonempty compact subsets of . Assume that is continuous in , , and is a sequence of nonempty closed subsets of , . Then, is compact and satisfies that for all and all , where
[TABLE]
Further, for any and .
Theorem 3.1. Let all the assumptions of Lemma 3.1 hold and suppose that is irreducible with for some . If
- (i)
* for all and all , where is specified in (3.1);*
- (ii)
there exist , an increasing subsequence , and , such that , , and converges to [math] as for all increasing subsequence ;
then system (1.1) is chaotic in the strong sense of Li-Yorke.
Proof. Since is a transition matrix, there exist such that . By Lemma 2.3, there exist four allowable words for matrix :
[TABLE]
where , with , and (if , then set with length ). Denote
[TABLE]
Then is uncountable. Note that , , since . For any , set
[TABLE]
Clearly, and if and only if . By assumption (i) and Lemma 3.1, one has that is nonempty, compact, and satisfies that , . Thus . Fix one point , and denote
[TABLE]
It follows from Lemma 3.1 that if and only if , which holds if and only if . So, is uncountable.
Next, it will be shown that is a Li-Yorke -scrambled set for system (1.1), where . For any , one has that . By (3.1)-(3.3), there exist an infinite sequence and such that and , . So,
[TABLE]
Thus,
[TABLE]
On the other hand, by (3.3), one has that for any , where
[TABLE]
Then, , . Thus, , , implying that
[TABLE]
This, together with assumption (ii), yields that
[TABLE]
So,
[TABLE]
Hence, is an uncountable -scrambled set of system (1.1) by (3.4) and (3.5). Moreover, for any , its positive orbit by (3.1) and (3.3). Thus, all the orbits starting from the points in are bounded. Therefore, system (1.1) is chaotic in the strong sense of Li-Yorke. The proof is complete.
Remark 3.1. It can be easily verified that the weak -coupled-expansion in , , implies the condition in assumption (i) of Theorem 3.1. However, the converse is not true in general, even in the special case that and , , (see Example 3.1.1 in [4]). Hence, assumption (i) of Theorem 3.1 here is strictly weaker than assumption of Theorems 3.2 and 3.3 in [21]. Moreover, both assumption of Theorem 3.2 and assumption of Theorem 3.3 in [21] imply assumption (ii) of Theorem 3.1 above (see, for example, the proof of Corollary 4.1 below). Hence, Theorems 3.2 and 3.3 in [21] are corollaries of Theorem 3.1 here.
The following result is a direct consequence of Theorem 3.1.
Corollary 3.1. Let all the assumptions of Theorem 3.1 hold except that assumption (i) is replaced by that system (1.1) is weakly -coupled-expanding in , . Then, system (1.1) is chaotic in the strong sense of Li-Yorke.
Let be an increasing subsequence. The following system:
[TABLE]
is called the induced system by system (1.1) through [16], where
[TABLE]
Let be the orbit of system (1.1) starting from and be the orbit of the induced system (3.6) starting from . Then, , , and thus the orbit of system (3.6) is a part of the orbit of system (1.1) starting from the same initial point .
Next, recall the relationship of (strong) Li-Yorke chaos between systems (1.1) and (3.6).
Lemma 3.2 ([16], Theorem 3.1). If system (3.6) is Li-Yorke -chaotic for some through , so is system (1.1). Further, if system (3.6) is chaotic in the strong sense of Li-Yorke through , so is system (1.1) in the case that is bounded.
The following result follows directly from Theorem 3.1 and Lemma 3.2.
Theorem 3.2. Assume that there exists an increasing subsequence such that all the assumptions of Theorem 3.1 hold for system (3.6). Then system (1.1) is Li-Yorke -chaotic for some . Further, system (1.1) is chaotic in the strong sense of Li-Yorke in the case that is bounded.
Applying Lemma 3.2 to Corollary 3.1, one obtains the following result.
Corollary 3.2. Assume that there exists an increasing subsequence such that all the assumptions of Corollary 3.1 hold for system (3.6). Then, system (1.1) is Li-Yorke -chaotic for some . Further, system (1.1) is chaotic in the strong sense of Li-Yorke in the case that is bounded.
4. Some criteria of distributional chaos in a sequence and distributional chaos
In this section, several criteria of distributional chaos in a sequence and of distributional chaos are established for system (1.1), respectively.
Applying Lemma 2.1 to Theorems 3.1 and 3.2 and Corollaries 3.1 and 3.2, respectively, the following result can be obtained.
Theorem 4.1. Let all the assumptions of Theorem 3.1 or Corollary 3.1 or Theorem 3.2 or Corollary 3.2 hold. If is compact and is continuous in for all , then system (1.1) is distributionally -chaotic in a sequence for some .
The next result gives a criterion of distributional chaos for system (1.1), which is induced by weak coupled-expansion for an irreducible transition matrix.
Theorem 4.2. Let all the assumptions of Lemma 3.1 hold, be equi-continuous in , and be irreducible with for some . If
system (1.1) is weakly -coupled-expanding in , ;
there exists a periodic point such that uniformly converges to [math] with respect to as ;
then system (1.1) is distributionally -chaotic for some .
Proof. Since is a transition matrix, there exist such that . By Lemma 2.3, one has that there exist three allowable words for matrix :
[TABLE]
where and . Let be the set satisfying the property in Lemma 2.2. For any , set
[TABLE]
where , for ; for ; and for any , if , and otherwise, , while the fact that there exists an allowable word for the matrix since is irreducible has been used in the case that . Clearly, and if and only if . By assumption (i) and Lemma 3.1, is nonempty, compact, and satisfies that , . Thus, . Fix one point , and denote
[TABLE]
Using Lemma 3.1 again, one has that if and only if , which holds if and only if . Hence, is uncountable since is uncountable.
In the following, it will be shown that is a distributionally -scrambled subset for system (1.1), where . Fix any with . Then, . Suppose that and . Thus, there exists an increasing subsequence such that , , by Lemma 2.2. Set
[TABLE]
Then,
[TABLE]
Denote
[TABLE]
For any and any , set
[TABLE]
It is evident that
[TABLE]
By (4.1) and (4.3), one has that
[TABLE]
This, together with (4.2), implies that
[TABLE]
which yields that
[TABLE]
On the other hand, denote
[TABLE]
Thus,
[TABLE]
Fix any . It is claimed that there exists such that, for all ,
[TABLE]
where is the period of . For simplicity, only consider the case of . The general cases can be proved in a similar way. Since is equi-continuous in , there exists such that, for any with ,
[TABLE]
By assumption (ii), there exists such that, for any ,
[TABLE]
Fix any and . By assumption (i), one has that
[TABLE]
It follows from (4.9) that, for any , there exist such that and . By (4.8), one has that
[TABLE]
This, together with (4.7), implies that
[TABLE]
Thus,
[TABLE]
Hence, (4.6) follows from (4.8) and (4.10) in the case of . By (4.1) and (4.6), one has that
[TABLE]
This, together with (4.5), implies that
[TABLE]
So,
[TABLE]
Hence, is an uncountable distributionally -scrambled subset for system (1.1) by (4.4) and (4.11). Therefore, system (1.1) is distributionally -chaotic. The proof is complete.
Remark 4.1. Theorem 4.2 extends Theorem 3.2 in [6] from autonomous to non-autonomous systems.
Corollary 4.1. Let all the assumptions of Theorem 4.2 hold, except that assumption (ii) is replaced by
there exists a constant such that
[TABLE]
then system (1.1) is distributionally -chaotic for some .
Proof. It can be shown that uniformly converges to [math] with respect to as for all . Indeed, it follows from (4.11) that, for any ,
[TABLE]
implying that
[TABLE]
Thus,
[TABLE]
This, together with the assumption that , yields that uniformly converges to [math] with respect to as . Hence, all the assumptions of Theorem 4.2 hold. Therefore, system (1.1) is distributionally -chaotic for some . This completes the proof.
The following result is somewhat better since it only requires be expanding in distance in one subset for all .
Corollary 4.2. Let all the assumptions of Theorem 4.2 hold, except that assumption (ii) is replaced by
there exist an integer and a constant such that and
[TABLE]
then system (1.1) is distributionally -chaotic for some .
Proof. With a similar proof to that of Corollary 4.1, one can show that for , uniformly converges to [math] with respect to as . Hence, all the assumptions of Theorem 4.2 hold. Therefore, system (1.1) is distributionally -chaotic for some . The proof is complete.
5. An example
In this section, an example is provided to illustrate the theoretical results.
Example 5.1. Consider the following non-autonomous logistic system:
[TABLE]
governed by the maps , , where , , and is a constant. It can be easily verified that
[TABLE]
Thus,
[TABLE]
which yields that is equi-continuous in . Set
[TABLE]
It is evident that and are disjoint nonempty compact subsets of , and
[TABLE]
Since , , one can see that
[TABLE]
which implies that system (5.1) is strictly -coupled-expanding in and , where with , , and thus is irreducible with , . On the other hand, one has that
[TABLE]
which yields that
[TABLE]
Therefore, all the assumptions in Theorem 3.1 hold for system (1.1) with , satisfying by (5.3) that uniformly converges to [math] with respect to as . By Theorem 3.1, system (1.1) is chaotic in the strong sense of Li-Yorke.
Moreover, all the assumptions in Corollary 4.2 hold for system (1.1) with , satisfying assumption by (5.2) and (5.3). By Corollary 4.2, system (1.1) is distributionally -chaotic for some .
Remark 5.1. System (5.1) is an important model in biology, which describes the population growth under certain conditions. Comparing to Example 5.1 in [14], here it not only proves that system (5.1) is chaotic in the strong sense of Li-Yorke, but also proves that system (5.1) is distributionally -chaotic for some .
Finally, it is worth noting here that Theorem 4.2 and its corollaries still hold true when is replaced by that with compact subsets for any .
Acknowledgments
This research was supported by the Hong Kong Research Grants Council (GRF Grant CityU11200317) and the NNSF of China (Grant 11571202).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. S. Cánovas, Li-Yorke chaos in a class of non-autonomous discrete systems, J. Differ. Equ. Appl. 17 (2011) 479–486.
- 2[2] Q. Huang, Y. Shi, L. Zhang, Sensitivity of non-autonomous discrete dynamical systems, Appl. Math. Lett. 39 (2015) 31–34.
- 3[3] H. Ju, H. Shao, Y. Choe, Y. Shi, Conditions for maps to be topologically conjugate or semi-conjugate to subshifts of finite type and criteria of chaos, Dyn. Syst. 31 (2016) 496–505.
- 4[4] H. Ju, C. Kim, Y. Choe, M. Chen, Conditions for topologically semi-conjugacy of the induced systems to the subshift of finite type, Chaos Solit. Fract. 98 (2017) 1–6.
- 5[5] J. Kennedy, J. A. Yorke, Topological horseshoes, Trans. Am. Math. Soc. 353 (2001) 2513–2530.
- 6[6] C. Kim, H. Ju, M. Chen, P. Raith, A 𝐴 A -Coupled-expanding and distributional chaos, Chaos Solit. Fract. 77 (2015) 291–295.
- 7[7] S. Kolyada, L. Snoha, Topological entropy of non-autononous dynamical systems, Random Comp. Dyn. 4 (1996) 205–233.
- 8[8] M. Kulczycki, P. Oprocha, Coupled-expanding maps and matrix shifts. Int. J. Bifurcat. Chaos 23 (2013) 1–6.
