Abstract
Several chaotic properties of cyclic permutation maps are considered. Cyclic permutation maps refer to p-dimensional dynamical systems of the form where (), is an integer, and () are compact subintervals of the real line . and are continuous maps. Necessary and sufficient conditions for a class of cyclic permutation maps to have Li–Yorke chaos, distributional chaos in a sequence, distributional chaos, or Li–Yorke sensitivity are given. These results extend the existing ones.
MSC:
54H20; 18F60; 91B55; 26A18
1. Introduction
It is well known that Li and Yorke [1] first proposed the mathematical definition of chaos. Since then, many different rigorous concepts of chaos have been given to depict different kinds of unpredictability in the evolution of a system. A very important generalization is distributional chaos, which was defined by Schweizer and Smital [2], mainly because it is equivalent to positive topological entropy and some other notions of chaos for some spaces (see [2,3]). It is noted that this equivalence does not transfer to higher dimensions. For example, positive topological entropy does not imply distributional chaos for triangular maps of the unit square [4] (the same happens when the dimension is zero [5]). In [6], Wang et al. defined distributional chaos in a sequence and showed that it is equivalent to Li–Yorke chaos for continuous interval maps.
During the last few years, many researchers have paid attention to the chaotic behavior of Cournot maps [7,8,9,10,11,12,13]. Let and be continuous maps of the compact subintervals B and C of , and let be a continuous map defined as for any . This aims to provide a mathematical description of competition in a duopolistic market, which is called Cournot duopoly ([7]). So, is called a Cournot map. u and v are called reaction functions; that is, u and v give laws to organize the production of some firms which are competitors in a market. According to [7,11], it also called Markov perfect equilibria (MPE henceforth) processes. Only one player moves at each discrete time: that is, the two players move alternatively, each choosing the best reply to the previous action of the other player. Markov perfect equilibria occurs when the phase point in the space belongs alternatively to the graphs of the reaction cures and . This condition is satisfied when the initial condition belongs to a reaction curve (i.e., (player 1 moves first) or (player 2 moves first)). Let and . The set represents the union of the graphs of the two reaction function and is -invariant, i.e., . Cáovas and Marín called the set a MPE set for ([8]). Moreover, they considered some kinds of chaos of a Cournot map and showed that for Devaney chaos, RT chaos, topological chaos, and Li–Yorke chaos, ‘ is chaotic’ is not equivalent to so is . Chaotic properties of a Cournot map have been studied in the literature [14,15,16,17] also. In 2013, Lu and Zhu studied the dynamical properties of the maps , and [12]. In 2016, Bas and Lopez [18] introduced the concept of a cyclically permuted direct product map and discussed the topics of transitivity and mixing by studying the relationship between the dynamics of G and that of the compositions , where is an integer, , is said to be a cyclically permuted direct product map. For any ( are topological spaces), every map is continuous and is a cyclic permutation of . The authors in [18] also obtained several results on transitivity for cyclically permuted direct product maps of the Cartesian product , where . In particular, for any integer , the transitivity of G is equivalent to the total transitivity. And then, they extended several well-known properties of transitivity from interval maps to cyclically permuted direct product maps [19]. These maps appear associated with a certain economical model: the so-called Cournot duopoly ([8,9,10,20], etc.). One can also find them in age-structured population models, as in [21], where it is called the Leslie model and analyzed. In [22], we considered and obtained several chaotic properties of a cyclic permutation map. Necessary and sufficient conditions for a cyclic permutation map to be LY-chaotic, h-chaotic, RT-chaotic, or D-chaotic were established. Moreover, we showed that the topological entropy of such a cyclic permutation map is the same as the topological entropy of each of the coordinates maps and that it is sensitive if and only if so is at least one of the coordinates maps.
Obviously, up to now, research on the relationship between the chaotic properties of cyclic permutation maps on high-dimensional spaces and their chaotic properties limited to subsets of the spaces has been very rare. Regarding the traditional Cournot map, scholars have only studied some of its chaotic properties in two-dimensional space and obtained its chaotic properties limited to MPE sets. In order to study cyclic permutation maps on higher-dimensional spaces, we first generalize the definition of a Cournot map. Let , where for any , is an integer. and are continuous. represents compact subintervals of the real line . Such mappings are called generalized Cournot maps on p-dimensional spaces.
Motivated by [8,12], this paper discusses the dynamical properties of the above p-dimensional dynamical system. Particularly, the necessary and sufficient conditions for a generalized Cournot map to be Li–Yorke chaotic, distributional chaotic (in a sequence), Li–Yorke sensitive, or sensitive dependence on the initial conditions (briefly, sensitive) are obtained. Our results extend the existing ones on low-dimensional dynamical systems.
In Section 2, we reviewed some notations and concepts, and we defined generalized Cournot maps (which are all cyclic permutation maps) as well as some closed subsets covered in this paper. In Section 3, we investigated the relationship between some chaotic properties of generalized Cournot maps and the corresponding chaotic properties restricted to some closed subsets. The results obtained are generalizations or improvements of some known results in the corresponding literature. In Section 4, we briefly summarized the results of this research and proposed future research directions.
2. Preliminaries
In this paper, let U be a metric space with metric d.
Definition 1
([1]). Let u be a continuous map over a metric space . For any and any , is said to be a Li–Yorke pair of modulus λ if
and
A subset is said to be a Li–Yorke chaotic set if for any two points , is a Li–Yorke pair. A dynamic system or a map is called to be Li–Yorke chaotic if U contains an uncountable Li–Yorke chaotic set. The set of Li–Yorke pairs of modulus is written by LY, and the set of Li–Yorke pairs is written by LY.
Let be a strictly increasing sequence of positive integers; for any two different points and any , we set
and
where denotes the characteristic function of the set .
Definition 2
([6]). Let be a strictly increasing sequence of positive integers and u be a continuous map on a metric space . A subset is a distributional chaotic set in the sequence if for any two different points satisfying that for any , and that for some . A dynamic system or a map is called to be distributional chaotic in a sequence if it has an uncountable distributional chaotic set in a sequence. If a dynamic system or a map is called to be distributional chaotic in the sequence , then it is called to be distributional chaotic.
Definition 3
([8]). A dynamic system or a map is called to be transitive if for any nonempty open sets B and C of X, there is an integer such that .
Definition 4
([8]). A dynamic system or a map is called to be sensitive if there is an such that for any nonempty open set B of U, there are points with for some integer , where ε is said to be a sensitive constant of u.
Definition 5
([8]). A dynamic system or a map is called to be chaotic in the sense of Devaney (or D-chaotic, for short) if u is transitive and sensitive with , where denotes the closure of the set B.
Definition 6
([23]). Let u be a continuous map over a metric space . A dynamic system or a map is called to be Li–Yorke sensitive if there is such that for any and any , there exists some with and LY.
Let be a compact interval of the real line for any and endowed with the product metric , which is given by
for any
For a generalized Cournot map
where
let
and
where . Let be the MPE-set for .
3. Main Results
In this paper, -chaotic denotes one of the five properties: Li–Yorke chaos, distributional chaos in a sequence, Li–Yorke sensitivity, sensitivity, or distributional chaos. Meanwhile, denotes one of three properties: Li–Yorke chaos, distributional chaos in a sequence, or distributional chaos.
Lemma 1
([12]). A dynamical system is -chaotic if and only if so is for any integer .
Lemma 2
([12]). Assume that and are two compact metric spaces. and are continuous maps. Then, is -chaotic if and only if so is .
Lemma 3.
For a cyclic permutation map
is -chaotic if and only if so is for some integer .
Proof.
By using the mathematical inductive method, the definitions, and Lemma 2, one can easily prove Lemma 3. □
Lemma 4
([12]). Assume that and are two compact subintervals. and are continuous. Then, is -chaotic if and only if either or is -chaotic.
Lemma 5.
Assume that is a compact subinterval for any . is continuous for any . Then, is -chaotic if and only if is -chaotic for some .
Proof.
It is easy to prove this lemma by using Proposition 2 of Reference [3] in [12], Theorem 3 of Reference [13] in [12], Theorem 3.5 of [15], and mathematical induction. □
Remark 1.
Lemma 5 is a generalization of Theorem 3.1 in [12].
Theorem 1.
For a cyclic permutation map
the following conditions are equivalent.
- (1)
- φ is -chaotic;
- (2)
- is -chaotic;
- (3)
- is -chaotic for some ;
- (4)
- is -chaotic for any .
Proof.
It is clear that
Since the proof is similar for any integer , to be succinct, we only consider .
(i) Li–Yorke chaos.
By the definition, one can easily show that (4)⇒ (2)⇒ (1) and (3)⇒ (2)⇒ (1). So, it is enough to prove that (1)⇒ (3) and (1)⇒ (4). Since is Li–Yorke chaotic, then is Li–Yorke chaotic for any . Assume that D is an uncountable Li–Yorke chaotic set of and that . It is obvious that and is uncountable.
Now, we show that is a Li–Yorke chaotic set of . Let
with . Then, one has that
Since
by the definition, there is an increasing positive integer sequence satisfying
Since and are uniformly continuous, one has that
and
Consequently,
This means that is Li–Yorke chaotic.
Similarly, one can easily prove that and are Li–Yorke chaotic.
(ii) Distributional chaos in a sequence.
By the definition, one can easily prove that (4)⇒ (2)⇒ (1) and (3)⇒ (2)⇒ (1). Therefore, it is enough to show that (1)⇒ (3) and (1)⇒ (4). Since is distributional chaotic in a sequence, by Lemmas 1 and 5, is distributional chaotic in a sequence for any . Assume that D is an uncountable distributional chaotic set of in a sequence and that . It is obvious that and is uncountable.
The following shows that is a distributional chaotic set of in the sequence . Let
By hypothesis and the definition, there is some such that
It is clear that
for any integer . This implies that
Since and are uniformly continuous, for any , there is some satisfying that and for any . Therefore,
Consequently, is distributional chaotic. Similarly, one can easily show that and are distributional chaotic in the sequence .
(iii) Distributional chaos
The proof is similar to that of (ii). □
Remark 2.
Theorem 1 is a generalization of Theorem 3.2 in [12].
Theorem 2.
For a cyclic permutation map
the following conditions are equivalent.
- (1)
- φ is Li–Yorke sensitive;
- (2)
- is Li–Yorke sensitive for some .
Proof.
Assume that is Li–Yorke sensitive. By Lemma 1, is Li–Yorke sensitive. By the definition and the above argument, there is some satisfying that, for any and any , there is a and LY. By the Li–Yorke sensitivity of and Lemma 5, one can deduce that , , or is Li–Yorke sensitive. Without loss of generality, one can assume that is Li–Yorke sensitive. By the definition, there is some satisfying that for any and any , there is a and LY. Since and are uniformly continuous, for the above and any , there exists some satisfying that,
implies
and
Therefore,
and
Similarly, it is easy to verify that
This shows that LY By the arbitrariness of and , is Li–Yorke sensitive.
On the contrary, assume that is Li–Yorke sensitive. Since and are uniformly continuous, one can easily prove that for any and any LY, there is some such that LY. By the above argument, the definition, and the Li–Yorke sensitivity of , is Li–Yorke sensitive. By Lemma 1 and Lemma 5, is Li–Yorke sensitive. □
Remark 3.
Theorem 2 is a generalization of Theorem 3.3 in [12].
Theorem 3.
For a cyclic permutation map
the following statements are equivalent.
- (1)
- φ is sensitive;
- (2)
- is sensitive for some .
Proof.
Assume that is sensitive. By Theorem 31 in [23], is sensitive. Then, by Theorem 3.1 in [24], one can see that , , or is sensitive. Without loss of generality, assume that is sensitive. By the definition, there exists a sensitivity constant of such that for any point and any , there is a and
for some integer . Since and are uniformly continuous, there is a such that
for any and for any
Clearly,
This shows that is sensitive.
On the contrary, assume that is sensitive with a sensitivity constant . By the uniform continuity of and , for the above and any , there exist some ; satisfying that, implies
Therefore, for any and if
for some integer , then
This means that is sensitive. By Theorem 3.1 in [24], is sensitive. By Theorem 31 in [23], is sensitive. □
Remark 4.
Theorem 3 is a generalization of Theorem 2.2 in [17].
Remark 5.
By using the uniform continuity of the mappings involved in this paper, the results of the above three theorems can be extended to any nonempty invariant compact subset of the space.
4. Conclusions
Some preliminary discussions on the relationship between cyclic permutation maps on high-dimensional spaces and the chaotic properties limited to their spatial subsets are presented. Specifically, for generalized Cournot maps, we have demonstrated that Li–Yorke chaoticity, distributional chaoticity, and the sensitivity of cyclic permutation maps is equivalent to the maps limited in MPE sets. These conclusions extend the ones for Cournot maps in duopoly games. The issue of the relationship between cyclic permutation maps on high-dimensional spaces and their chaotic properties restricted to other subsets is still open and requires further in-depth research in the future.
Author Contributions
Conceptualization, Y.Z. and W.A.; validation, R.L. and T.L.; formal analysis, R.L. and W.A.; investigation, Y.Z. and Z.M.; writing—original draft, Y.Z.; writing—review and editing, T.L. and R.L.; supervision, Z.M.; funding acquisition, Y.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work was supported by the NSF of Guangdong Province (No. 2015A030313615), the NSF of Sichuan Province (No. 2023NSFSC0070), the Scientific Research Project of Sichuan University of Science and Engineering (No. 2020RC24), the Opening Project of Bridge Non-destruction Detecting and Engineering Computing Key Laboratory of Sichuan Province (No. 2018QZJ03), and the Opening Project of Artificial Intelligence Key Laboratory of Sichuan Province (No. 2018RZJ03).
Data Availability Statement
The data that support the findings of this study are available from the corresponding author upon reasonable request.
Acknowledgments
Many thanks to experts.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Li, T.Y.; Yorke, J.A. Period three implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar] [CrossRef]
- 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. [Google Scholar] [CrossRef]
- Oprocha, P.; Wilczynski, P. Shift spaces and distributional chaos. Chaos Solit. Fract. 2007, 31, 347–355. [Google Scholar] [CrossRef]
- Smital, J.; Stefankova, M. Distributional chaos for triangular maps. Chaos Solit. Fract. 2004, 21, 1125–1128. [Google Scholar] [CrossRef]
- Pikula, R. On some notions of chaos in dimension zero. Colloq. Math. 2007, 107, 167–177. [Google Scholar] [CrossRef]
- Wang, L.D.; Huang, G.F.; Huan, S.M. Distributional chaos in a sequence. Nonlinear Anal. 2007, 67, 2131–2136. [Google Scholar] [CrossRef]
- Puu, T.; Sushko, I. Oligopoly Dynamics: Models and Tools; Springer: New York, NY, USA, 2002. [Google Scholar]
- Canovas, J.S.; Ruiz Marin, M. Chaos on MPE-sets of duopoly games. Chaos Solit. Fract. 2004, 19, 179–183. [Google Scholar] [CrossRef]
- Jean-Pierre, A.; Chen, L.X.; Désilles, A. Cournot maps for intercepting evader evolutions by a pursuer. Dyn. Games Appl. 2015, 5, 275–296. [Google Scholar]
- Yua, W.S.; Yu, Y. The stability of Bayesian Nash equilibrium of dynamic Cournot duopoly model with asymmetric information. Commun Nonlinear Sci. Numer. Sim. 2018, 63, 101–116. [Google Scholar] [CrossRef]
- Dana, R.A.; Montrucchio, L. Dynamic complexity in duopoly games. J. Econ. Theory 1986, 44, 40–56. [Google Scholar] [CrossRef]
- Lu, T.X.; Zhu, P.Y. Further discussion on chaos in duopoly games. Chaos Solit. Fract. 2013, 52, 45–48. [Google Scholar] [CrossRef]
- Askar, S.S. On the dynamics of Cournot duopoly game with governmental taxes. Complexity 2022, 2022, 5195337. [Google Scholar] [CrossRef]
- Zhu, Y.L.; Zhou, W.; Chu, T.; Li, W.N. Complex dynamic analysis of the duopoly game under management delegation. J. Shandong Univ. 2021, 56, 32–45. [Google Scholar]
- Canovas, J.S. Chaos in duopoly games. Nonlinear Stud. 2000, 7, 97–104. [Google Scholar]
- Du, J.G.; Fan, Y.Q.; Sheng, Z.H.; Hou, Y.Z. Dynamics analysis and chaos control of a duopoly game with heterogeneous players and output limiter. Econ. Model. 2013, 33, 507–516. [Google Scholar] [CrossRef]
- Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Solit. Fract. 2016, 84, 69–72. [Google Scholar] [CrossRef]
- Linero Bas, A.; Soler Lopez, G. A note on the dynamics of cyclically permuted direct product maps. Topol. Appl. 2016, 203, 147–158. [Google Scholar] [CrossRef]
- Linero Bas, A.; Soler Lopez, G. A splitting result on transitivity for a class of n-dimensional maps. Nonlinear Dyn. 2016, 84, 163–169. [Google Scholar] [CrossRef]
- Askar, S.S.; Alshamrani, A.M.; Alnowibet, K. The arising of cooperation in Cournot duopoly games. Appl. Math. Comput. 2016, 273, 535–542. [Google Scholar] [CrossRef]
- Franke, J.E.; Yakubu, A.-A. Attenuant cycles in periodically forced discrete-time age-structured population models. J. Math. Anal. Appl. 2006, 316, 69–86. [Google Scholar] [CrossRef]
- Li, R.S.; Lu, T.X. The topological entropy of cyclic permutation maps and some chaotic properties on their MPE sets. Complexity 2020, 2020, 9379628. [Google Scholar] [CrossRef]
- Akin, E.; Kolyada, S. Li-Yorke sensitivity. Nonlinearity 2003, 16, 1421–1433. [Google Scholar] [CrossRef]
- Li, R.S.; Shi, Y.M. Stronger gorms of sensitivity for measure-preserving maps and semiflows on probability spaces. Abstr. Appl. Anal. 2014, 2014, 769523. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).