Abstract
This paper is concerned with invariance -scrambled sets under iterations. The main results are an extension of the compound invariance of Li–Yorke chaos and distributional chaos. New definitions of -scrambled sets in non-autonomous discrete systems are given. For a positive integer k, the properties and of Furstenberg families are introduced. It is shown that, for any positive integer k, for any , Furstenberg family has properties and , where denotes the family of all infinite subsets of whose upper density is not less than s. Then, the following conclusion is obtained. D is an -scrambled set of if and only if D is an -scrambled set of .
Keywords: nonautonomous discrete system, Furstenberg family, scrambled sets, chaos
MSC2010: 37B55, 37D45, 54H20
1. Introduction
Chaotic properties of a dynamical system have been extensively discussed since the introduction of the term chaos by Li and Yorke in 1975 [1] and Devaney in 1989 [2]. To describe some kind of unpredictability in the evolution of a dynamical system, other definitions of chaos have also been proposed, such as generic chaos [3], dense chaos [4], Li–Yorke sensitivity [5], and so on. An important generalization of Li–Yorke chaos is distributional chaos, which is given in 1994 by B. Schweizer and J. Smítal [6]. Then, theories related to scrambled sets are discussed extensively (see [7,8,9,10,11,12] and others). In 1997, the Furstenberg family was introduced by E. Akin [13]. J. Xiong, F. Tan described chaos with a couple of Furstenberg Families. -chaos has also been defined [14]. Moreover, -sensitivity was given in [15] and shadowing properties were discussed in [16]. Most existing papers studied the chaoticity in autonomous discrete systems . However, if a sequence of perturbations to a system are described by different functions, then there are a sequence of maps to describe them, giving rise to non-autonomous systems. Non-autonomous discrete systems were precisely introduced in [17], in connection with non-autonomous difference equations (see [18,19] and some references therein).
Let (briefly, X) be a compact metric space and consider a sequence of continuous maps , denoted by . This sequence defines a non-autonomous discrete system . The orbit of any point is given by the sequence , where for , and is the identity map.
For , define
Call a compound system of .
Also, denote by and denote for . By [5], if converges uniformly to a map f. Then, for any , the sequence converges uniformly to .
In the present work, some notions relating to Furstenberg families and properties , are recalled in Section 2 and Section 3. Section 4 states some definitions about -chaos. In Section 5, it is proved that, under the conditions of property and positive shift-invariant, is -chaos (strong -chaos, strong -chaos) implies () is -chaos (strong -chaos, strong -chaos). If the conditions property and negative shift-invariant both hold, the above conclusion can be inversed. As a conclusion, for arbitrary s and t in , for every , and can share the same -scrambled set (Theorem 3).
In this paper, it is always assumed that all the maps , , are surjective. It should be noted that this condition is needed by most papers dealing with this kind of system (for example, [20,21,22,23]). It is assumed that sequence converges uniformly. The aim of this paper is to investigate the -scrambled sets of .
2. Furstenberg Families
Let be the collection of all subsets of the positive integers set . A collection is called a Furstenberg family if it is hereditary upwards, i.e., and imply . Obviously, the collection of all infinite subsets of is a Furstenberg family, denoted by .
Define the dual family of a Furstenberg family by
It is clear that is a Furstenberg family and (see [13]).
For , , let and . Furstenberg family is positive shift-invariant if for every and any . Furstenberg family is negative shift-invariant if for every and any . Furstenberg family is shift-invariant if it is positive shift-invariant and negative shift-invariant.
The following shows a class of Furstenberg families which is related to upper density.
Let . The upper density and the lower density of F are defined as follows:
where denotes the cardinality of the set A.
For any s in , set .
Proposition 1.
For any s in , is shift-invariant Furstenberg family. And .
Proof.
- (i)
Let , then, (where ),
Thus, (i.e., ) implies (i.e., ). So, are Furstenberg families.
- (ii)
Let , that is, . Denote (where , ), then and for any .
and
So, is shift-invariant.
- (iii)
Obviously,This completes the proof.
☐
3. Properties , of Furstenberg Families
Definition 1.
Let k be a positive integer and be a Furstenberg family.
- (1)
For any , if there exists an integer such that , we say have property ;
- (2)
If , we say have property .
The following proposition is given by [24]. For completeness, we give the proofs.
Proposition 2.
For any and any , have properties and .
Proof.
- (1)
If , , , i.e., there exists an integer such that . The following will discuss the case .
If , . , , obviously, there exist such that .
If , suppose properties does not hold. Then there exists a such that for every .
For any , put which satisfied . One can find a sufficiently large number N such that, , (where denotes the cardinality of the set ). Then , where denotes the complementary set of .
Give an integer , . By the definition of , if . And if , and . Then
So,Put , then
This contradicts to .
- (2)
Similarly, just consider the case , .
Suppose properties does not hold. Then there exists an integer such that . Put which satisfied . One can find a sufficiently large number N such that, , . Give a , . By the definition of , if . And if and . Then
So,
This contradicts to .
This completes the proof.
☐
4. -Chaos in Non-Autonomous Systems
Now, we state the definition of -chaos in nonautonomous systems.
Definition 2.
Let be a compact metric space, and are two Furstenberg families. is called a -scrambled set of (briefly, ), if , the following two conditions are satisfied:
- (i)
, ;
- (ii)
, .
The pair which satisfies the above two conditions is called an -scrambled pair of .
is said to be -chaotic if there exists an uncountable -scrambled set of . If , is said to be -chaotic and is an -scrambled pair. is said to be strong -chaotic if there are some and an uncountable subset such that for any with , the following two conditions holds:
- (i)
for all ;
- (ii)
.
is said to be strong -chaos if it is strong -chaotic and .
Let us recall the definitions of Li-Yorke chaos and distributional chaos in non-autonomous systems (see [25,26]).
Definition 3.
Assume that is a non-autonomous discrete system. If with , is called a Li–Yorke pair if
The set is called a Li–Yorke scrambled set if all points with , is a Li–Yorke pair. is Li–Yorke chaotic if X contains an uncountable Li–Yorke scrambled set.
Assume that is a non-autonomous discrete system. For any pair of points , define the upper and lower (distance) distributional functions generated by as
and
respectively. Where is the characteristic function of the set , i.e., when or when .
Definition 4.
is distributionally chaotic if exists an uncountable subset such that for any pair of distinct points , we have that for all and for some .
The set D is a distributionally scrambled set and the pair a distributionally chaotic pair.
It is not difficult to obtain that the pair is a -scrambled pair if and only if is a Li–Yorke scrambled pair, and the pair is a -scrambled pair if and only if is a distributionally scrambled pair. In fact,
Then, for any and for some is equivalent to that and . for any and for some is equivalent to that and .
Hence, -chaos is Li–Yorke chaos and -chaos is distributional Chaos.
5. Main Results
Theorem 1.
Let and are two Furstenberg families with property , where k is a positive integer. is positive shift-invariant. If the system is -chaos, then the system is -chaos too.
Proof.
If D is an -scrambled set of , the following proves that D is an -scrambled set of .
- (i)
Since X is compact and are continuous, then, for any , are uniformly continuous (where are freely chosen from the sequence ). That is, for any , there exists a , , implies ().
Since D is an -scrambled set of , then, , for the above , we have
And because have property , there exists some such that
By the selection of , we put , then
Write , then .
By the positive shift-invariant of and , we have . And with the hereditary upwards of , for any , , .
- (ii)
Since D is a -scrambled set of , then, for the above , , such that . And because have property , then, there exists some such that
X is compact and are continuous, then, for any , are uniformly continuous (where are freely chosen from the sequence ). For the above , , satisfied , inequality holds.
The following will prove that .
Suppose , then
By the selection of , we put , then
So,
This contradicts .
Hence, for in (i), there exists a such that .
Combining with (i) and (ii), is -chaos.
This completes the proof.
☐
Theorem 2.
Let and are two Furstenberg families with property , where k is a positive integer. is negative shift-invariant. If the system is -chaos, then the system is -chaos too.
Proof.
If D is a -scrambled set of , the following prove that D is a -scrambled set of .
- (i)
Similar to Theorem 1, for any , are uniformly continuous (where are freely chosen from the sequence ). That is, for any , there exists a , , implies ().
For any pair of distinct points , for the above , one has
By the selection of , for , , put , then . And because have property , then
Notice that , then .
- (ii)
Since D is an -scrambled set of , then, for the above , there exist , such that .
For any , are uniformly continuous (where are freely chosen from the sequence ), then, for the above , there exist such that implies . That is, implies .
, , put , then
Since is negative shift-invariant, then . And because have property , then , i.e., . Combining with the hereditary upwards of , we have .
By (i) and (ii), D is an -scrambled set of .
This completes the proof.
☐
Similarly, the following corollaries hold.
Corollary 1.
Let and are two Furstenberg families with property , where k is a positive integer. is positive shift-invariant. If the system is -chaos (strong -chaos, or strong -chaos), then the system is -chaos (strong -chaos, or strong -chaos).
Corollary 2.
Let and are two Furstenberg families with property , where k is a positive integer. is negative shift-invariant. If the system is -chaos (strong -chaos, or strong -chaos), then the system is -chaos (strong -chaos, or strong -chaos).
Combining with Propositions 1 and 2, Theorems 1 and 2, and Corollarys 1 and 2, the following conclusions are obtained.
Theorem 3.
Let s and t are arbitrary two numbers in , then
- (1)
If D is an -scrambled set (or strong -scrambled set) of , then, for every , D is an -scrambled set(or strong -scrambled set) of .
- (2)
For some positive integer k, if D is an -scrambled set (or strong -scrambled set) of , then D is an -scrambled set (or strong -scrambled set) of .
Proof.
- (1)
By Proposition 1, is shift-invariant (obviously positive shift-invariant). And because are two Furstenberg families with property (Proposition 2). Then, according to the proof of Theorem 1, if D is an -scrambled set of , then, for every , D is an -scrambled set of .
- (2)
In the same way, (2) holds.
This completes the proof.
☐
With the preparations in Section 4, we have
Corollary 3.
- (1)
If D is a Li–Yorke scrambled set (or distributionally scrambled set) of , then, for every , D is a Li–Yorke scrambled set (or distributionally scrambled set) of .
- (2)
For some positive integer k, if D is a Li–Yorke scrambled set (or distributionally scrambled set) of , then, D is a Li–Yorke scrambled set (or distributionally scrambled set) of .
Remark 1.
In the non-autonomous systems, the iterative properties of Li–Yorke chaos and distributional chaos are discussed in [25,26] before. The conclusions in Corollary 3 remains consistent with them.
This paper has presented several properties of -chaos, strong -chaos, and strong -chaos. There are some other problems, such as generically -chaos and -sensitivity, to discuss. Moreover, property is closely related to congruence theory. Follow this line, one can consider other Furstenberg families which consist of number sets with some special characteristics.
Acknowledgments
This work was supported by National Natural Science Foundation of China (11501391, 61573010) and the Artificial Intelligence of Key Laboratory of Sichuan Province (2015RZJ01).
Author Contributions
Tianxiu Lu proposed the idea; Most of the conclusions are proved by Xiao Tang and Tianxiu Lu; Some important steps in Theorem 1 and Theorem 2 are inferred by Guanrong Chen; Tianxiu Lu wrote the paper.
Conflicts of Interest
The authors declare no conflict of interest.
References
- 1.Li T., Yorke J. Period 3 implies chaos. Am. Math. Month. 1975;82:985–992. doi: 10.2307/2318254. [DOI] [Google Scholar]
- 2.Devaney R.L. An Introduction to Chaotic Dynamical Systems. Addison Wesley; Boston, MA, USA: 1989. [Google Scholar]
- 3.Piorek J. On generic chaos of shifts in funtion spaces. Ann. Polon. Math. 1990;52:139–146. doi: 10.4064/ap-52-2-139-146. [DOI] [Google Scholar]
- 4.Snoha L. Dense chaos. Comment. Math. Univ. Carolin. 1992;33:747–752. [Google Scholar]
- 5.Akin E., Kolyada S. Li–Yorke sensitivity. Nonlinearity. 2003;16:1421–1433. doi: 10.1088/0951-7715/16/4/313. [DOI] [Google Scholar]
- 6.Schweizer B., Smital J. Measures of chaos and a spectral decomposition of dynamical systems on the interval. Trans. Am. Math. Soc. 1994;344:737–754. doi: 10.1090/S0002-9947-1994-1227094-X. [DOI] [Google Scholar]
- 7.Balibrea F., Smital J. Strong distributional chaos and minimal sets. Topol. Appl. 2009;156:1673–1678. doi: 10.1016/j.topol.2009.01.015. [DOI] [Google Scholar]
- 8.Balibrea F., Smital J., Stefankova M. On open problems concerning distributional chaos for triangular maps. Nonlinear Anal. Theor. 2011;74:7342–7346. doi: 10.1016/j.na.2011.07.052. [DOI] [Google Scholar]
- 9.Li R. A note on the three versions of distributional chaos. Commun. Nonlinear Sci. Numer. Simul. 2011;16:1993–1997. doi: 10.1016/j.cnsns.2010.08.014. [DOI] [Google Scholar]
- 10.Balibrea F., Smital J., Stefankova M. Dynamical systems generating large sets of probability distribution functions. Chaos Soliton. Fract. 2014;67:38–42. doi: 10.1016/j.chaos.2014.06.013. [DOI] [Google Scholar]
- 11.Wang L., Ou X., Gao Y. A weakly mixing dynamical system with the whole space being a transitive extremal distributionally scrambled set. Chaos Soliton. Fract. 2015;70:130–133. doi: 10.1016/j.chaos.2014.11.012. [DOI] [Google Scholar]
- 12.Shao Y., Gao Y. The scrambling index set of primitive minimally strong digraphs. Linear Algebra Appl. 2016;500:1–14. doi: 10.1016/j.laa.2016.03.008. [DOI] [Google Scholar]
- 13.Akin E. Recurrence in Topological Dynamics: Furstenberg and Ellis Action. Plenum Press; New York, NY, USA: 1997. [Google Scholar]
- 14.Tan F., Zhang R.F. On -sensitive pairs. Acta Math. Sci. 2011;31:1425–1435. [Google Scholar]
- 15.Wu X., Wang J., Chen G. -sensitivity and Multi-sensitivity of hyperspatial dynamical systems. J. Math. Anal. Appl. 2015;429:16–26. doi: 10.1016/j.jmaa.2015.04.009. [DOI] [Google Scholar]
- 16.Wu X., Oprocha P., Chen G. On various definitions of shadowing with average error in tracing. Nonlinearity. 2016;29:1942–1972. doi: 10.1088/0951-7715/29/7/1942. [DOI] [Google Scholar]
- 17.Kolyada S., Snoha L. Topological entropy of non-autonomous dynamical systems. Random Comput. Dyn. 1996;4:205–233. [Google Scholar]
- 18.Elaydi S.N. Non-autonomous difference equations: Open problems and conjectures. Fields Inst. Commum. 2004;42:423–428. [Google Scholar]
- 19.Elaydi S.N., Sacker R.J. Non-autonomous Beverton-Holt equations and the Cushing-Henson conjectures. J. Differ. Equ. Appl. 2005;11:337–346. doi: 10.1080/10236190412331335418. [DOI] [Google Scholar]
- 20.Kolyada S., Snoha L., Trofimchuk S. On minimality of non-autonomous dynamical systems. Neliniini Koliv. 2004;7:86–92. [Google Scholar]
- 21.Dvorakova J. Chaos in non-autonomous discrete dynamical systems. Commun. Nonlinear Sci. Number. Simul. 2012;17:4649–4652. doi: 10.1016/j.cnsns.2012.06.005. [DOI] [Google Scholar]
- 22.Wu X., Ding X., Lu T., Wang J. Topological dynamics of Zadeh’s extension on upper semi-continuous fuzzy sets. Int. J. Bifurc. Chaos. 2017;27:1750165. doi: 10.1142/S0218127417501656. [DOI] [Google Scholar]
- 23.Wu X., Wang X., Chen G. On the large deviations theorem of weaker types. Int. J. Bifurc. Chaos. 2017;27:1750127. doi: 10.1142/S0218127417501279. [DOI] [Google Scholar]
- 24.Li Z., Wang H., Xiong J. Some remarks on -scrambled sets. ACTA Math. Sin. (Chin. Ser.) 2010;53:727–732. [Google Scholar]
- 25.Wu X., Zhu P. Chaos in a class of non-autonomous discrete systems. Appl. Math. Lett. 2013;26:431–436. doi: 10.1016/j.aml.2012.11.003. [DOI] [Google Scholar]
- 26.Lu T., Zhu P., Wu X. Distributional chaos in non-autonomous discrete systems. Acta Math. Sci. (Chin. Ser.) 2015;35:558–566. [Google Scholar]