Next Article in Journal
Semi-Supervised Approach for EGFR Mutation Prediction on CT Images
Next Article in Special Issue
On the Generalised Transfer Operators of the Farey Map with Complex Temperature
Previous Article in Journal
Topologies of Bihyperbolic Numbers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Collective Sensitivity, Collective Accessibility, and Collective Kato’s Chaos in Duopoly Games

1
School of Mathematics and Computer Science, Guangdong Ocean University, Zhanjiang 524025, China
2
College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
3
South Sichuan Applied Mathematics Research Center, Zigong 643000, China
4
Department of Mathematics, Zhanjiang Preschool Education College, Zhanjiang 524037, China
*
Authors to whom correspondence should be addressed.
Mathematics 2022, 10(22), 4226; https://doi.org/10.3390/math10224226
Submission received: 15 October 2022 / Revised: 3 November 2022 / Accepted: 8 November 2022 / Published: 12 November 2022
(This article belongs to the Special Issue Advances in Ergodic Theory and Its Applications)

Abstract

:
By using the uniform continuity of two onto maps, this paper further explores stronger forms of Kato’s chaos, sensitivity, and accessibility of Cournot maps. In particular, the sensitivity, the collective sensitivity, the accessibility, and the collective accessibility of the compositions of two reaction functions are studied. It is observed that a Cournot onto map H on a product space is sensitive (collectively sensitive, collectively accessible, accessible, or collectively Kato chaotic) if and only if the restriction of the map H 2 to the MPE-set is sensitive as well. Several examples are given to show the necessity of the reaction functions being continuous onto maps.
MSC:
Primary 37D45; 54H20; 37B40; Secondary 26A18; 28D20

1. Introduction

Let E , F R be closed intervals. h 1 : F E and h 2 : E F be continuous onto maps, and let H : E × F E × F be defined by H ( a , b ) = ( h 1 ( b ) , h 2 ( a ) ) for any ( a , b ) E × F . Such a map H has been posed to present a mathematical description of competition in a duopolistic market, which is called Cournot duopoly [1]. Then, the map H said to be a Cournot map, and h 1 and h 2 are said to be reaction functions which give laws to organize the production of some firms, such that they are competitors in the market. Consequently, these games which are given by Cournot maps are called duopoly games. The first definition of chaos in a mathematically rigorous way was probably provided by Li and Yorke [2]. Since then, a lot of different definitions of chaos have been presented. Each of them is used to reflect some kind of unpredictability of a given system in its evolution. Akin and Kolyada [3] gave the definitions of Li–Yorke sensitivity and spatiotemporal chaos for the first time. Schweizer and Smítal [4] gave the definition of distributional chaos. It is well known that distributional chaos is equivalent to positive topological entropy and some other definitions of chaos for some kinds of spaces [4,5], and that this equivalence relationship does not hold for higher-dimensional spaces [6] and zero-dimensional spaces [7]. In [8], Wang et al. defined distributional chaos with respect to a sequence and proved that it is equivalent to Li–Yorke chaos for continuous maps over a given closed interval. Over the past few decades, many scholars have paid very close attention to the dynamic behavior of Cournot maps [1,9,10,11,12,13]. It is known from [1,12] that there are Markov perfect equilibria processes. Concretely speaking, two fixed players move alternatively, such that each of them chooses the best reply to the previous action of another player. Put M 1 = { ( h 1 ( b ) , b ) : b F } , M 2 = { ( a , h 2 ( a ) ) : a E } and M 12 = M 1 M 2 . It is clear that H ( M 12 ) M 12 . From [9], it is known that the set M 12 is said to to be an MPE-set for H. Furthermore, in [9] the authors considered some definitions of chaos for Cournot maps, and proved that for each of the definitions they considered in [9], it is not satisfied that H is chaotic if and only if H | M 12 is also chaotic (i.e., the restriction of the map H to the set M 12 ). Inspired chaotic properties of Cournot maps in [1,12,13,14,15,16], Lu and Zhu [17] further investigated the Li–Yorke chaos, distributional chaos, sensitivity, and Li–Yorke sensitivity of such maps. In particular, they showed that H | M 12 , H 2 | M 1 and H 2 | M 2 enjoy some of the same chaotic properties. In [18], it was shown for any Cournot map H ( a , b ) = ( h 1 ( b ) , h 2 ( a ) ) on the product space E × F , the following statements are true.
(1) If H is Kato’s chaos, then at least one of M 2 | M 1 and H 2 | M 2 is Kato’s chaos.
(2) Suppose that H 2 | M 1 and H 2 | M 2 is Kato’s chaos. The maps h 1 and h 2 satisfy that, for any ε > 0 , if
( h 2 h 1 ) n ( b 1 ) ( h 2 h 1 ) n ( b 2 ) < ε
and
( h 1 h 2 ) m ( a 1 ) ( h 1 h 2 ) m ( a 2 ) < ε
for some integers n , m 1 , then there exists an integer l ( n , m , ε ) > 0 that satisfies
( h 2 h 1 ) l ( n , m , ε ) ( b 1 ) ( h 2 h 1 ) l ( n , m , ε ) ( b 2 ) < ε
and
( h 1 h 2 ) l ( n , m , ε ) ( a 1 ) ( h 1 h 2 ) l ( n , m , ε ) ( a 2 ) < ε ,
and then H is Kato’s chaos. Here, · denotes 1-norm on R , i.e. absolute value. In [19] Zhao and Li considered ( F 1 , F 2 ) -chaos (resp. strong ( F 1 , F 2 ) -chaos) for such maps and obtained the following results:
(1) H is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic) if and only if H 2 | M 1 is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic) if and only if H 2 | M 2 is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic).
(2) H is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic) if and only if H 2 | M 1 M 2 is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic).
(3) h 1 h 2 is ( F 1 , F 2 ) -chaotic (resp. strong ( F 1 , F 2 ) -chaotic) if and only if h 2 h 1 is as well.
In [20], Li and Lu discussed several chaotic properties of the s-dimensional dynamical system of the form H ( a 1 , a 2 , , a s ) = ( h s ( a s ) , h 1 ( a 1 ) , , h s 1 ( a s 1 ) ) , where a k H k for any k { 1 , 2 , , s } , s > 1 is a given integer, and H k R = ( , + ) is a closed subinterval for any k { 1 , 2 , , s } . In particular, a necessary and sufficient condition for a cyclic permutation map H ( a 1 , a 2 , , a s ) = ( h s ( a s ) , h 1 ( a 1 ) , , h s 1 ( a s 1 ) ) to be LY-chaotic (i.e., chaotic in the sense of Li–Yorke) or h-chaotic (i.e., its topological entropy is positive) or RT-chaotic (i.e., chaotic in the sense of Ruelle–Takens) or D-chaotic (i.e., chaotic in the sense of Devaney) was established. Furthermore, the LY-chaoticity, h-chaoticity, RT-chaoticity, and D-chaoticity of such a cyclic permutation map were studied. Moreover, it was verified that the topological entropy h ( H ) of such a cyclic permutation map is the same as the topological entropy of each of the following maps: h j h j 1 h 1 h s h s 1 h j + 1 if j = 1 , , s 1 and h s h s 1 h 1 , and that H is sensitive if and only if so is at least one of the coordinates maps of H s . In [21], Linero Bas and Soler López introduced the notion of a cyclically permuted direct product map and considered the (totally) topological transitivity and the (weakly) topological mixing for a cyclically permuted direct product map by studying the relationship between the dynamics of F and that of the compositions h σ ( i ) h σ m ( j ) , where j { 1 , , m } , F ( a 1 , a 2 , , a m ) = ( h σ ( 1 ) ( a σ ( 1 ) ) , h σ ( 2 ) ( a σ ( 2 ) ) , , h σ ( m ) ( a σ ( m ) ) ) said to be a cyclically permuted direct product map, which is defined from the Cartesian product X 1 × X 2 × × X m into itself (where X 1 , X 2 , , X m are general topological spaces, h σ ( i ) : X σ ( i ) X j is continuous for any j { 1 , , m } , and σ is a cyclic permutation of { 1 , 2 , , m } , m 2 ). In [22], Linero Bas and Soler López got several results on transitivity for a cyclically permuted direct product map of the Cartesian product J m , where J = [ 0 , 1 ] . In particular, it was verified that, for any integer m > 2 , the transitivity of this map F is equivalent to the total transitivity. If m = 2 , they deduced a splitting result for a transitive map. In addition, they extended well-known properties of transitivity from an interval map to a cyclically permuted direct product map. To do it, they used the strong link between the map F and the compositions φ i = h σ ( i ) h σ m ( i ) , i = { 1 , , m } . From [20,21,22], it is known that, for cyclically permuted direct product maps, if m = 2 and X 1 = X 2 = [ 0 , 1 ] , they appear associated with Cournot duopoly.
It is known that the sensitive property characterizes the unpredictability of chaotic phenomenon. This kind of property is one of the essential conditions of various definitions of a chaotic system. Hence, when is a system sensitive? In [23], Moothathu initiated a preliminary study of stronger forms of sensitivity of continuous self-maps of compact metric spaces by using large subsets of N. Mainly he discussed syndetic sensitivity and cofinite sensitivity, and proved the following: (1) The syndetical transitivity of a non-minimal map implies its syndetical sensitivity. (2) The sensitivity of a map on the interval [ 0 , 1 ] implies its cofinite sensitivity. (3) The sensitivity of a subshift of finite type implies its cofinite sensitivity. (4) The syndetical transitivity of an infinite subshift implies its syndetical sensitivity. (5) There is not a cofinitely sensitive Sturmian subshift. (6) There is a transitive, sensitive map which is not syndetically sensitive. In [24], Xu et al. observed that a mixing transformation of a manifold is sensitive and topologically transitive. In [25], He et al. obtained that for a measure-preserving map and a measure-preserving semi-flow on a metric probability space with a fully supported measure, if they are weak-mixing, then they are sensitive. In [26], M. Salman et al. defined sensitivity, multi-sensitivity, cofinite sensitivity, and syndetic sensitivity for non-autonomous dynamical systems on uniform spaces and got several sufficient conditions under which topological transitivity and dense periodic points imply sensitivity for non-autonomous systems on Hausdorff uniform spaces. Furthermore, they explored sensitivity and other stronger versions of sensitivity for the systems induced on hyperspaces and for the product of non-autonomous dynamical systems on uniform spaces. In [27], Vasisht and Ruchi Das researched a few stronger forms of transitivity in a non-autonomous discrete dynamical system ( E , h 1 , ) , where ( h 1 , ) is a sequence of continuous self-maps which converges uniformly to h. They gave notions of thick sensitivity, ergodic sensitivity and multi-sensitivity for a non-autonomous discrete dynamical system. These sensitivity properties are all stronger forms of sensitivity. Ref. [27] established that under certain conditions, if the rate of convergence at which ( h j ) converges to h is sufficiently fast, then various forms of sensitivity and transitivity for the above nonautonomous system are the same as the responding properties of the autonomous system ( E , h ) . Moreover, they presented counterexamples to support their results. In [28], Li et al. studied stronger forms of transitivity and sensitivity for a nonautonomous discrete dynamical system by using the Furstenberg family. In particular, they considered the F -transitivity, F -mixing, F -sensitivity, F -collective sensitivity, F -synchronous sensitivity, ( F 1 , F 2 )-sensitivity, and F -multi-sensitivity for a nonautonomous discrete dynamical system and extended the responding results of [27]. In [29], F. Ghane et al. considered the equicontinuity and sensitivity of iterated function systems (for short, IFSs). In particular, they discussed more general case of IFSs (in other words, the IFSs which are generated by a family of relations). Ref. [29] generalized the notions of transitivity, sensitivity, and equicontinuity to these kinds of systems. The relationships between these notions are studied. Some sufficient conditions for sensitivity of IFSs are given. Then, they defined weak topologically exactness for IFSs that are generated by a family of relations. It was shown that non-minimal weak topologically exact IFSs are sensitive. This deduces different examples of nonminimal sensitive systems which are not an M-system. Moreover, some interesting examples are presented for providing some facts about the sensitive property of IFSs. In [30], Gu studied the relationships between Kato’s chaoticity of a dynamical system ( E , h ) on a compact metric space E and Kato’s chaoticity of the set-valued discrete system ( κ ( E ) , h ¯ ) which is associated with ( E , h ) . He proved that Kato’s chaoticity of ( κ ( E ) , h ¯ ) implies the Kato’s chaoticity of ( E , h ) , and that ( E , h ) is Kato chaotic and is equivalent to ( κ ( E ) , h ¯ ) is Kato chaotic in W e -topology. Moreover, if a continuous map with a fixed point from a complete metric space without isolated point into itself is Ruelle–Takens chaotic, then it is Kato chaotic. In [31], Wang et al. introduced and investigated strong Kato’s chaos for a group action on a compact metric space. For a compact metric space E , which does not have isolated points and a topologically commutative group G over E , if the weak mixing of the dynamical system ( E , G ) deduces the chaoticity in the strong sense of Kato. In [32], Değirmenci and Koçak considered how chaos conditions on maps carry over to their products. First, they presented a counterexample which shows that the product of two Devaney chaotic maps need not be chaotic. They then showed that if two maps (or even one of them) is sensitive, then so is their product. In addition, they presented some sufficient conditions under which the product of two chaotic maps is Devaney chaotic.
Inspired by the above results, this paper will further discuss stronger forms of Kato’s chaos, sensitivity and accessibility of the chaotic properties of the above Cournot maps. The main purpose of this paper is to extend and improve the existing results for these maps by some stronger notions. In particular, it is proven that H is sensitive if and only if H 2 | M 1 and H 2 | M 2 are sensitive, where M 1 = { ( h 1 ( c 2 ) , c 2 ) : c 2 F } , M 2 = { ( c 1 , h 2 ( c 1 ) ) : c 1 E } , H is collectively sensitive if and only if H 2 | M 1 and H 2 | M 2 are collectively sensitive. Additionally, a result, in [18] is extended to collective accessibility. For an onto Cournot map H ( p , r ) = ( h 1 ( r ) , h 2 ( p ) ) on E × F , the following two new results are established.
(1) h 1 h 2 is sensitive (resp. accessible) if and only if h 2 h 1 is as well.
(2) h 1 h 2 is collectively sensitive (resp. collectively accessible) if and only if h 2 h 1 is as well.
Moreover, this paper gives a few nontrivial examples which show that it is necessary to assume that h 1 : F E and h 2 : E F are continuous onto maps.

2. Preliminaries

Let ( E , d ) be a metric space and h : E E be a continuous map.
Definition 1.
A dynamic system ( E , h ) (or the map h : E E ) is
(1) topologically transitive if for any nonempty open subsets U , V E , h n ( U ) V for some positive integer n;
(2) topologically mixing if for any nonempty open subsets U , V E , there is a positive integer n with h t ( U ) V for any integer t n ;
(3) sensitive if there is a δ > 0 , such that for any ε > 0 and any a E , there exists a point b E with d ( a , b ) < ε and d ( h n ( a ) , h n ( b ) ) > δ for some integer n 1 , where δ is called a sensitivity constant of the map h;
(4) accessible if for any ε > 0 and any two nonempty open subsets U , V E , there are two points a U and b V with d ( h n ( a ) , h n ( b ) ) < ε for some integer n 1 ; and
(5) chaotic in the sense of Ruelle and Takens if it is topologically transitive and sensitive.
Definition 2
([18]). Let ( E , h ) be a dynamical system on a metric space ( E , d ) . The system ( E , h ) is called to be accessible if for any δ > 0 and any nonempty open subsets V 1 , V 2 E , and there are v i V i ( i { 1 , 2 } ) such that d ( h n ( v 1 ) , h n ( v 2 ) ) < δ for some integer n > 0 . The system ( E , h ) or the map h is called to be Kato chaotic if h is sensitive and accessible.
It is well known that a topologically mixing dynamic system ( E , h ) or a topologically mixing map h : E E is Kato’s chaos [33].
Definition 3
([34]). Let ( E , h ) be a dynamical system on a metric space ( E , d ) . The system ( E , h ) is called to be collectively accessible, if for any δ > 0 and any nonempty open subsets V 1 ( 1 ) , V 2 ( 1 ) , , V s ( 1 ) , V 1 ( 2 ) , V 2 ( 2 ) , , V t ( 2 ) E , there exist v i ( 1 ) V i ( 1 ) for any i { 1 , 2 , , s } , v j ( 2 ) V j ( 2 ) for any j { 1 , 2 , , t } and some integer n > 0 such that one of the following holds.
(1) There is an i 0 { 1 , 2 , , s } such that d ( h n ( v i 0 ( 1 ) ) , h n ( v j ( 2 ) ) ) < δ for any j { 1 , 2 , , t } .
(2) There is a j 0 { 1 , 2 , , t } such that d ( h n ( v i ( 1 ) ) , h n ( v j 0 ( 2 ) ) ) < δ for any i { 1 , 2 , , s } .
Clearly, collective accessibility implies accessibility.
Definition 4
([34]). Let ( E , h ) be a dynamical system on a metric space ( E , d ) and δ > 0 a constant. The system ( E , h ) is called to be collectively sensitive with the collective sensitivity constant δ if for any finitely many distinct points u 1 , u 2 , , u m E and any ε > 0 , there exist m distinct points v 1 , v 2 , , v m E such that the following two conditions are satisfied:
(1) d ( u j , v j ) < ε for all 1 j m ;
(2) there exists a j 0 with 1 j 0 m such that for some integer n > 0 , d ( h n ( u j ) , h n ( v j 0 ) ) > δ or d ( h n ( u j 0 ) , h n ( v j ) ) > δ , 1 j m .
Clearly, collective sensitivity implies sensitivity.
Definition 5
([34]). Let ( E , h ) be a dynamical system on a metric space ( E , d ) . The system ( E , h ) is called to be collectively Kato-chaotic if it is collectively accessible and collectively sensitive.
Obviously, collective Kato’s chaos implies Kato’s chaos.

3. Main Results

Assume that ( E , d 1 ) and ( F , d 2 ) are compact metric spaces, and that h 1 : F E and h 2 : E F are uniformly continuous onto maps. The following Lemmas 1–4 are needed.
Lemma 1.
h 1 h 2 is sensitive if and only if so is h 2 h 1 .
Proof. 
Assume that h 1 h 2 is sensitive with sensitivity constant β . Let r F and U r , ε F be a neighbourhood of r F . Because h 2 is continuous, one can choose p h 2 1 ( { r } ) , and h 2 1 ( U r , ε ) is a neighbourhood of p E . Since h 1 h 2 is sensitive with sensitivity constant β , there are p h 2 1 ( U r , ε ) and an integer j > 0 , such that
d 1 ( ( h 1 h 2 ) j ( p ) , ( h 1 h 2 ) j ( p ) ) > β .
Because h 2 is uniformly continuous, then there is a ε > 0 such that, if d 1 ( p , p ) ε and p , p E , then
d 2 ( h 2 ( p ) , h 2 ( p ) ) ε .
Hence,
d 2 ( h 2 ( h 1 h 2 ) j ( p ) , h 2 ( h 1 h 2 ) j ( p ) ) > β
for some β > 0 . That is,
d 2 ( ( h 2 h 1 ) j ( r ) , ( h 2 h 1 ) j ( r ) ) > β ,
where r = h 2 ( p ) U r , ε . By the definition, h 2 h 1 is sensitive with sensitivity constant β . □
Similarly, one can easily verify that if h 2 h 1 is sensitive, then h 1 h 2 is sensitive.
Remark 1.
For Lemma 1, it is necessary to assume that h 1 : F E and h 2 : E F are continuous onto maps.
Example 1.
Let X = [ 0 , 1 ] and Y = [ 0 , 2 ] . h 1 : Y X is defined by h 1 ( r ) = 1 | 1 2 r | for any r Y and h 1 ( r ) = 0 for any r [ 1 , 2 ] . h 2 : X Y is defined by h 2 ( p ) = 1 | 1 2 p | for any p X , where | · | denotes absolute value. Then, the following results hold:
(1) h 1 h 2 is sensitive.
(2) h 2 h 1 is not sensitive.
Proof. 
Let λ be a tent map on [ 0 , 1 ] which is defined by λ ( x ) = 1 | 1 2 x | for any x [ 0 , 1 ] . It is known that λ is topologically mixing. Then λ 2 is topologically mixing. Consequently, λ 2 is sensitive. By the definition of h 1 and h 2 , one has h 1 h 2 = λ 2 . This implies that h 1 h 2 is sensitive. It is easily seen that h 2 h 1 is not sensitive. □
Lemma 2.
h 1 h 2 is collectively sensitive if and only if so is h 2 h 1 .
Proof. 
Assume that h 1 h 2 is collectively sensitive with collective sensitivity constant β . Let r 1 ( 1 ) , r 2 ( 1 ) , , r m ( 1 ) F are m distinct points. Because h 2 is uniformly continuous, then one can choose p 1 ( 1 ) h 2 1 ( { r 1 ( 1 ) } ) , p 2 ( 1 ) h 2 1 ( { r 2 ( 1 ) } ) , , p m ( 1 ) h 2 1 ( { r m ( 1 ) } ) satisfying p i ( 1 ) p j ( 1 ) ( i j ) , and h 2 1 ( { r 1 ( 1 ) } ) , h 2 1 ( { r 2 ( 1 ) } ) , , h 2 1 ( { r m ( 1 ) } ) are neighbourhoods of p 1 ( 1 ) , p 2 ( 1 ) , , p m ( 1 ) , respectively.
By the collective sensitivity of h 1 h 2 , for any ε > 0 , there exist m distinct points p 1 ( 2 ) , p 2 ( 2 ) , , p m ( 2 ) E , such that the following two conditions are satisfied.
(1) d 1 ( p j ( 1 ) , p j ( 2 ) ) < ε for all 1 j m ;
(2) there exists a j 0 : 1 j 0 m , such that for some integer n 1 > 0 ,
d 1 ( ( h 1 h 2 ) n 1 ( p j ( 1 ) ) , ( h 1 h 2 ) n 1 ( p j 0 ( 2 ) ) ) > β
or
d 1 ( ( h 1 h 2 ) n 1 ( p j 0 ( 1 ) ) , ( h 1 h 2 ) n 1 ( p j ( 2 ) ) ) > β , 1 j m .
Let
r 1 ( 2 ) = h 2 ( p 1 ( 2 ) ) , r 2 ( 2 ) = h 2 ( p 2 ( 2 ) ) , , r m ( 2 ) = h 2 ( p m ( 2 ) ) .
Because h 2 is uniformly continuous, then there exists a ε > 0 such that d 2 ( r j ( 1 ) , r j ( 2 ) ) < ε for all 1 j m .
Furthermore, because d 1 ( ( h 1 h 2 ) n 1 ( p j ( 1 ) ) , ( h 1 h 2 ) n 1 ( p j 0 ( 2 ) ) ) > β (or d 1 ( ( h 1 h 2 ) n 1 ( p j 0 ( 1 ) ) , ( h 1 h 2 ) n 1 ( p j ( 2 ) ) ) > β ) , then there exists a β > 0 such that
d 2 ( h 1 1 ( h 1 h 2 ) n 1 ( p j ( 1 ) ) , h 1 1 ( h 1 h 2 ) n 1 ( p j 0 ( 2 ) ) ) > β
or
d 2 ( h 1 1 ( h 1 h 2 ) n 1 ( p j 0 ( 1 ) ) , h 1 1 ( h 1 h 2 ) n 1 ( p j ( 2 ) ) ) > β .
Otherwise, it contradicts that h 1 is a uniformly continuous map.
That is to say, there is an n 1 1 N , such that
d 2 ( ( h 2 h 1 ) n 1 1 ( r j ( 1 ) ) , ( h 2 h 1 ) n 1 1 ( r j 0 ( 2 ) ) ) > β
or
d 2 ( ( h 2 h 1 ) n 1 1 ( r j 0 ( 1 ) ) , ( h 2 h 1 ) n 1 1 ( r j ( 2 ) ) ) > β .
Thus, h 2 h 1 is collectively sensitive. □
Lemma 3.
h 1 h 2 is accessible if and only if so is h 2 h 1 .
Proof. 
Assume that h 1 h 2 is accessible, and that V j F is nonempty and open for each j { 1 , 2 } . Set λ > 0 . Because h 2 is uniformly continuous, there is a λ > 0 such that if d 1 ( p 1 , p 2 ) < λ and p 1 , p 2 E , then d 2 ( h 2 ( p 1 ) , h 2 ( p 2 ) ) < λ . Write U j = h 2 1 ( V j ) for each j { 1 , 2 } . By hypothesis, h 2 is an onto map. Consequently, U j ( j { 1 , 2 } ) are nonempty open sets. Then, for each j { 1 , 2 } , there is a p j U j such that
d 1 ( ( h 1 h 2 ) m ( p 1 ) , ( h 1 h 2 ) m ( p 2 ) ) < λ
for some m { 1 , 2 , } . Then,
d 2 ( h 2 ( h 1 h 2 ) m ( p 1 ) , h 2 ( h 1 h 2 ) m ( p 2 ) ) < λ .
That is,
d 2 ( ( h 2 h 1 ) m ( r 1 ) , ( h 2 h 1 ) m ( r 2 ) ) < λ ,
where r j = h 2 ( p j ) V j for each j { 1 , 2 } . By the definition, h 2 h 1 is accessible. □
Similarly, one can easily verify that if h 2 h 1 is accessible, then h 1 h 2 is accessible.
Example 2.
Define X , Y , h 1 , and h 2 as being the same as in Example 1. Then, h 1 h 2 and h 2 h 1 are accessible.
Proof. 
As one knows, tent map λ ( p ) = 1 | 1 2 x | for any x [ 0 , 1 ] is topologically mixing. By [33], λ 2 is accessible. Clearly, in this example, one has h 1 h 2 = λ 2 . This implies that h 1 h 2 is accessible. Then, by the proof of Lemma 2.2 in [18] and the definition of accessibility, one can easily verify that h 2 h 1 is also accessible. □
Lemma 4.
h 1 h 2 is collectively accessible if and only if h 2 h 1 is as well.
Proof. 
Assume that h 1 h 2 is collectively accessible, and that V i ( 1 ) F and V j ( 1 ) F are nonempty and open for each i { 1 , 2 , , s } and each j { 1 , 2 , , t } . Write U i ( 1 ) = h 2 1 ( V i ( 1 ) ) and U j ( 2 ) = h 2 1 ( V j ( 2 ) ) for each i { 1 , 2 , , s } and each j { 1 , 2 , , t } . By hypothesis, h 2 is an onto map. So, U i ( 1 ) ( i { 1 , 2 , , s } ) and U j ( 2 ) ( j { 1 , 2 , , t } ) are nonempty open sets. Set λ > 0 . Because h 2 is uniformly continuous, then there is a λ > 0 such that if d 1 ( a , b ) < λ for a , b E , then d 2 ( h 2 ( a ) , h 2 ( b ) ) < λ . Then, by hypothesis, there are p i ( 1 ) U i ( 1 ) for each i { 1 , 2 , , s } , p j ( 2 ) U j ( 2 ) and each j { 1 , 2 , , t } , and some integer m > 0 , such that one of the following is true.
(1) There is an i 0 { 1 , 2 , , s } , such that
d 1 ( ( h 1 h 2 ) m ( p i 0 ( 1 ) ) , ( h 1 h 2 ) m ( p j ( 2 ) ) ) < λ
for every j { 1 , 2 , , t } .
(2) There is a j 0 { 1 , 2 , , t } such that
d 1 ( ( h 1 h 2 ) m ( p i ( 1 ) ) , ( h 1 h 2 ) m ( p j 0 ( 2 ) ) ) < λ
for every i { 1 , 2 , , s } . □
Then one has
d 2 ( h 2 ( h 1 h 2 ) m ( p i 0 ( 1 ) ) , h 2 ( h 1 h 2 ) m ( p j ( 2 ) ) ) < λ ( j { 1 , 2 , , t } ) ,
or
d 2 ( h 2 ( h 1 h 2 ) m ( p i ( 1 ) ) , h 2 ( h 1 h 2 ) m ( p j 0 ( 2 ) ) ) < λ ( i { 1 , 2 , , s } ) .
That is,
d 2 ( ( h 2 h 1 ) m ( r i 0 ( 1 ) ) , ( h 2 h 1 ) m ( r j ( 2 ) ) ) < λ ( j { 1 , 2 , , t } )
or
d 2 ( ( h 2 h 1 ) m ( r i ( 1 ) ) , ( h 2 h 1 ) m ( r j 0 ( 2 ) ) ) < λ ( i { 1 , 2 , , s } ) ,
where r i ( 1 ) = h 2 ( p i 1 ) V j ( 1 ) for each i { 1 , 2 , , s } and r j ( 2 ) = h 2 ( p j 2 ) V j ( 2 ) for every j { 1 , 2 , , t } . By the definition, h 2 h 1 is collectively accessible.
Similarly, by hypothesis one can easily verify that if h 2 h 1 is collectively accessible, then h 1 h 2 is collectively accessible.
Let H ( p , r ) = ( h 1 ( r ) , h 2 ( p ) ) ( p E , r F ) be a Cournot map on E × F . In [17], the authors proved that H is Li–Yorke sensitive if and only if one of the maps H 2 | M 1 and H 2 | M 2 is as well. Inspired by this result, the following conclusions are obtained.
Theorem 1.
If H is onto, then H is sensitive if and only if H 2 | M 1 and H 2 | M 2 are sensitive.
Proof. 
By Theorem 2.2 in [18], H is sensitive if and only if either H 2 | M 1 or H 2 | M 2 is sensitive. By Lemma 2.1 in [18], H is sensitive if and only if H 2 = ( h 1 h 2 ) × ( h 2 h 1 ) is sensitive. By Lemma 1 in [31], H 2 is sensitive if and only if either h 1 h 2 or h 2 h 1 is sensitive. Consequently, H is sensitive if and only if h 1 h 2 and h 2 h 1 are sensitive. By the proof of Theorem 2.2 in [18], Theorem 1 is true. □
Remark 2.
For Theorem 1, it is necessary to assume that h 1 : F E and h 2 : E F are continuous onto maps.
Example 3.
Define X , Y , h 1 , and h 2 as being the same as Example 1. Then the following conclusions hold:
(1) H 2 | M 2 is sensitive.
(2) H 2 | M 1 is not sensitive.
Proof. 
By hypothesis, the proof of Theorem 2.2 in [18] and Example 1, one can easily deduce that H 2 | M 2 is sensitive. By hypothesis, Example 1, the uniform continuity of h 1 , and the definitions of sensitivity and M 1 , one can easily prove that H 2 | M 1 is not sensitive. □
Lemma 5.
The Cournot map H is collectively sensitive if and only if H 2 is as well.
Proof. 
Clearly, if H 2 is collectively sensitive, then so is H. If H is collectively sensitive with the collective sensitivity constant λ > 0 . By the uniform continuity of H, there is a λ ( 0 , λ ) such that, d ( p 1 , p 2 ) λ for p 1 , p 2 E implies d ( H ( p 1 ) , H ( p 2 ) ) λ . By the definition, for any ε > 0 and any m distinct points p 1 ( 1 ) , p 2 ( 1 ) , , p m ( 1 ) E , there are m distinct points p 1 ( 2 ) , p 2 ( 2 ) , , p m ( 2 ) E , such that d ( p i ( 1 ) , p i ( 2 ) ) < ε for all 1 j m . Furthermore, for some integer n > 0 and any i { 1 , 2 , , m } , one has d ( H n ( p i 0 ( 1 ) ) , H n ( p i ( 2 ) ) ) > λ for some i 0 { 1 , 2 , , m } or d ( H n ( p i ( 1 ) ) , H n ( p i 0 ( 2 ) ) ) > λ for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } . Then, it is easily seen that if n = 2 m + 1 then d ( H 2 m ( p i 0 ( 1 ) ) , H 2 m ( p i ( 2 ) ) ) > λ > λ or d ( H 2 m ( p i ( 1 ) ) , H 2 m ( p i 0 ( 2 ) ) ) > λ > λ for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } , and that if n = 2 m , then d ( H 2 m ( p i 0 ( 1 ) ) , H 2 m ( p i ( 2 ) ) ) > λ or d ( H 2 m ( p i ( 1 ) ) , H 2 m ( p i 0 ( 2 ) ) ) > λ for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } . By the definition, H 2 is collectively sensitive. □
Lemma 6.
Assume that the product metric ρ on the product space E × F are defined as ρ ( ( p 1 , r 1 ) , ( p 2 , r 2 ) ) = max { | p 2 p 1 | , | r 2 r 1 | } , where | · | denotes 1-norm on R , i.e., absolute value. The product map f × g of f : E E and g : F F is defined as ( f × g ) ( p , r ) = ( f ( p ) , g ( r ) ) for any p E and any r F .
If f : E E and g : F F are not necessarily continuous maps, then the following holds.
(1) If f or g is collectively sensitive, then f × g : E × F E × F is collectively sensitive.
(2) If f × g : E × F E × F is collectively sensitive, then at least one of f and g is collectively sensitive.
Proof. 
By the definition, the method of the proofs of Lemma 1 in [32] and Lemma 5, one easily verifies that Lemma 6 is true. □
Lemma 7.
A continuous map h : E E is collectively accessible if and only if h 2 is as well.
Proof. 
By the definition, the method of the proof of Lemma 2.2 in [18] and Lemma 5, one can easily verify that Lemma 7 is true. □
Theorem 2.
H is collectively sensitive if and only if at least one of the maps H 2 | M 1 and H 2 | M 2 is collectively sensitive.
Proof. 
If H is collectively sensitive, then by Lemma 5, H 2 is collectively sensitive. Let the collective sensitivity constant of H 2 is λ > 0 . For any m distinct points ξ 1 = ( p 1 , h 2 ( p 1 ) ) , ξ 2 = ( p 2 , h 2 ( p 2 ) ) , , ξ m = ( p m , h 2 ( p m ) ) M 2 and any ε > 0 , there are m distinct points γ j = ( p j , r j ) E × F with ρ ( ξ j , γ j ) < ε ( j { 1 , 2 , , n } ) and some n N such that ρ ( H 2 n ( ξ j 0 ) , H 2 n ( γ j ) ) > λ for some integer j 0 { 1 , 2 , , m } and any j { 1 , 2 , , m } , or ρ ( H 2 n ( ξ j ) , H 2 n ( γ j 0 ) ) > λ for some integer j 0 { 1 , 2 , , m } and any j { 1 , 2 , , m } . Because H 2 = ( h 1 h 2 ) × ( h 2 h 1 ) , by Lemma 6, at least one of the maps h 1 h 2 and h 2 h 1 must be collectively sensitive. Without loss of generality, one may assume that h 1 h 2 is collectively sensitive with the collective sensitivity constant 0 < λ < λ . For any p 1 ( 1 ) , p 2 ( 1 ) , , p m ( 1 ) E and any ε > 0 , there are points p 1 ( 2 ) , p 2 ( 2 ) , , p m ( 2 ) E with | p i ( 1 ) p i ( 2 ) | < ε for any i { 1 , 2 , , m } . In addition, for some integer n > 0 , | ( h 1 h 2 ) n ( p i 0 ( 1 ) ) ( h 1 h 2 ) n ( p i ( 2 ) ) | > λ for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } , or | ( h 1 h 2 ) n ( p i ( 1 ) ) ( h 1 h 2 ) n ( p i 0 ( 2 ) ) | > λ for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } . Because h 2 is uniformly continuous, there is a ε 1 ( 0 , ε ) such that | h 2 ( a 1 ) h 2 ( a 2 ) | < ε for any a 1 , a 2 E with | a 1 a 2 | < ε 1 . Clearly, ρ ( ( p i ( 1 ) , h 2 ( p i ( 1 ) ) ) , ( p i ( 2 ) , h 2 ( p i ( 2 ) ) ) ) < ε for any i { 1 , 2 , , m } . Consequently,
ρ ( H 2 n ( p i 0 ( 1 ) , h 2 ( p i 0 ( 1 ) ) ) , H 2 n ( p i ( 2 ) , h 2 ( p i ( 2 ) ) ) ) | ( h 1 h 2 ) n ( p i 0 ( 1 ) ) ( h 1 h 2 ) n ( p i ( 2 ) ) | > λ
for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } , or
ρ ( H 2 n ( p i ( 1 ) , h 2 ( p i ( 1 ) ) ) , H 2 n ( p i 0 ( 2 ) , h 2 ( p i 0 ( 2 ) ) ) ) | ( h 1 h 2 ) n ( p i ( 1 ) ) ( h 1 h 2 ) n ( p i 0 ( 2 ) ) | > λ
for some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } . By the definition, H 2 | M 2 is collectively sensitive.
Conversely, assume that H 2 | M 2 is collectively sensitive with a collective sensitivity constant λ > 0 . By the uniform continuity of h 2 , there is a λ : 0 < λ < λ such that, for any two points a 1 , a 2 E , | a 1 a 2 | λ means | h 2 ( a 1 ) h 2 ( a 2 ) | λ . Consequently, for any i { 1 , 2 , , m } and any p i ( 1 ) , p i ( 2 ) E with | p i ( 1 ) p i ( 2 ) | λ , if
ρ ( H 2 n ( p i 0 ( 1 ) , h 2 ( p i 0 ( 1 ) ) ) , H 2 n ( p i ( 2 ) , h 2 ( p i ( 2 ) ) ) ) > λ
for some n > 0 , some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } , or
ρ ( H 2 n ( p i ( 1 ) , h 2 ( p i ( 1 ) ) ) , H 2 n ( p i 0 ( 2 ) , h 2 ( p i 0 ( 2 ) ) ) ) > λ
for some n > 0 , some i 0 { 1 , 2 , , m } and any i { 1 , 2 , , m } , then
| ( h 1 h 2 ) n ( p i 0 ( 1 ) ) ( h 1 h 2 ) n ( p i ( 2 ) ) ) | > λ
for some n > 0 , some i 0 { 1 , 2 , , m } , and any i { 1 , 2 , , m } , or
| ( h 1 h 2 ) n ( p i ( 1 ) ) ( h 1 h 2 ) n ( p i 0 ( 2 ) ) ) | > λ
for some n > 0 , some i 0 { 1 , 2 , , m } , and any i { 1 , 2 , , m } . Thus, h 1 h 2 is collectively sensitive. By Theorem 3.1 in [17] and Lemma 6, H is collectively sensitive. □
Theorem 3.
If H is onto, then H is collectively sensitive if and only if H 2 | M 1 and H 2 | M 2 are collectively sensitive.
Proof. 
By the proof of Theorem 2.2 in [18], one can easily prove that H is collectively sensitive if and only if either H 2 | M 1 or H 2 | M 2 is collectively sensitive. By the proof of Lemma 2.1 in [18], one has that H is collectively sensitive if and only if H 2 is as well. Because H 2 = ( h 1 h 2 ) × ( h 2 h 1 ) , by the proof of Lemma 1 in [31], one can easily prove that H 2 is collectively sensitive if and only if either h 1 h 2 or h 2 h 1 is collectively sensitive. By Lemma 2, H 2 is collectively sensitive if and only if h 1 h 2 and h 2 h 1 are collectively sensitive. By the proof of Theorem 2.2 in [18], Theorem 3 is true. □
Theorem 4.
(1) If H is collectively accessible, then both H 2 | M 1 and H 2 | M 2 are collectively accessible.
(2) Assume that H 2 | M 1 and H 2 | M 2 are collectively accessible. For any ε > 0 and any given integers s , t > 0 , if ( h 2 h 1 ) n ( p j ( 1 ) ) ( h 2 h 1 ) n ( p i ( 2 ) ) < ε (i.e., the absolute value of the real number ( h 2 h 1 ) n ( p j ( 1 ) ) ( h 2 h 1 ) n ( p i ( 2 ) ) ) and ( h 1 h 2 ) m ( r j ( 1 ) ) ( h 1 h 2 ) m ( r i ( 2 ) ) < ε for some integers n , m > 0 , any j { 1 , 2 , , t } , and any i { 1 , 2 , , s } implies that there is an integer l ( n , m , ε ) > 0 satisfies
( h 2 h 1 ) l ( n , m , ε ) ( p j ( 1 ) ) ( h 2 h 1 ) l ( n , m , ε ) ( p i ( 2 ) ) < ε
and
( h 1 h 2 ) l ( n , m , ε ) ( r j ( 1 ) ) ( h 1 h 2 ) l ( n , m , ε ) ( r i ( 2 ) ) < ε
for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } , then H is collectively accessible.
Proof 
(1) Assume that H is collectively accessible. U 1 ( 1 ) , U 2 1 , , U s ( 1 ) , U 1 ( 2 ) , U 2 ( 2 ) , , U t ( 2 ) E , and V 1 ( 1 ) , V 2 ( 1 ) , , V s ( 1 ) , V 1 ( 2 ) , V 2 ( 2 ) , , V t ( 2 ) F are nonempty open sets.
By the definition, one can easily prove that, for any continuous maps f : E E and g : F F , if product map f × g is collectively accessible then both f and g are collectively accessible. Consequently, for any ε > 0 , h 2 n ( p j ( 1 ) ) h 2 n ( p i ( 2 ) ) < ε and h 1 m ( r j ( 1 ) ) h 1 m ( r i ( 2 ) ) < ε for some integers n , m > 0 , any j { 1 , 2 , , t } and any i { 1 , 2 , , s } implies that there is an integer l ( n , m , ε ) > 0 that satisfies
h 2 l ( n , m , ε ) ( p j ( 1 ) ) h 2 l ( n , m , ε ) ( p i ( 2 ) ) < ε
and
h 1 l ( n , m , ε ) ( r j ( 1 ) ) h 1 l ( n , m , ε ) ( r j ( 2 ) ) < ε
for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } . Then, h 1 × h 2 is collectively accessible. By the definition, for any ε > 0 and any nonempty subsets U 1 ( 1 ) × V 1 ( 1 ) , , U s ( 1 ) × V s ( 1 ) , U 1 ( 2 ) × V 1 ( 2 ) , , U t ( 2 ) × V t ( 2 ) E × F , there are ( p 1 ( 1 ) , r 1 ( 1 ) ) U 1 ( 1 ) × V 1 ( 1 ) , , ( p s ( 1 ) , r s ( 1 ) ) U s ( 1 ) × V s ( 1 ) , ( p 1 ( 2 ) , r 1 ( 2 ) ) U 1 ( 2 ) × V 1 ( 2 ) , , ( p t ( 2 ) , r t ( 2 ) ) U t ( 2 ) × V t ( 2 ) , and some integers m , n > 0 satisfies
ρ ( ( h 1 × h 2 ) m ( p j 0 ( 1 ) , r j 0 ( 1 ) ) , ( h 1 × h 2 ) m ( p i ( 2 ) , r i ( 2 ) ) ) < ε
for some j 0 { 1 , , s } and any i { 1 , , t } or
ρ ( ( h 1 × h 2 ) m ( p j ( 1 ) , r j ( 1 ) ) , ( h 1 × h 2 ) m ( p i 0 ( 2 ) , r i 0 ( 2 ) ) ) < ε
for some i 0 { 1 , , t } and any j { 1 , , s } . Consequently, one has that h 1 m ( p j 0 ( 1 ) ) h 1 m ( p i ( 2 ) ) < ε and h 2 n ( r j 0 ( 1 ) ) h 2 n ( r i ( 2 ) ) < ε for any i { 1 , , t } , or h 1 m ( p j ( 1 ) ) h 1 m ( p i 0 ( 2 ) ) < ε and h 2 n ( r j ( 1 ) ) h 2 n ( r i 0 ( 2 ) ) < ε for any j { 1 , , s } . By the definition, h 1 and h 2 are accessible. If h 1 and h 2 are collectively accessible, then, for any nonempty open subsets U 1 ( 1 ) , , U s ( 1 ) , U 1 ( 2 ) , , U t ( 2 ) E , any nonempty open subsets V 1 ( 1 ) , , V s ( 1 ) , V 1 ( 2 ) , , V t ( 2 ) F and any ε > 0 , there are p j ( 1 ) U j ( 1 ) and r j ( 1 ) V j ( 1 ) for any j { 1 , , s } , p i ( 2 ) U i ( 2 ) and r i ( 2 ) V i ( 2 ) for any i { 1 , , t } , and two integers m , n > 0 , such that
h 1 m ( p j 1 ( 1 ) ) h 1 m ( p i ( 2 ) ) < ε and h 2 n ( r j 2 ( 1 ) ) h 2 n ( r i ( 2 ) ) < ε
for any i { 1 , , t } and some j 1 , j 2 { 1 , , s } , or
h 1 m ( p j ( 1 ) ) h 1 m ( p i 1 ( 2 ) ) < ε and h 2 n ( r j ( 1 ) ) h 2 n ( r i 2 ( 2 ) ) < ε
for some i 1 , i 2 { 1 , , t } and any j { 1 , , s } . By hypothesis,
h 1 l ( n , m , ε ) ( p j 1 ( 1 ) ) h 1 l ( n , m , ε ) ( p i ( 2 ) ) < ε and h 2 l ( n , m , ε ) ( r j 2 ( 1 ) ) h 2 l ( n , m , ε ) ( r i ( 2 ) ) < ε
for any i { 1 , , t } , or
h 1 l ( n , m , ε ) ( p j ( 1 ) ) h 1 l ( n , m , ε ) ( p i 1 ( 2 ) ) < ε and h 2 l ( n , m , ε ) ( r j ( 1 ) ) h 2 l ( n , m , ε ) ( r i 2 ( 2 ) ) < ε
for any j { 1 , , s } . Consequently,
ρ ( ( h 1 × h 2 ) l ( n , m , ε ) ( p j 1 ( 1 ) , r j 2 ( 1 ) ) , ( h 1 × h 2 ) l ( n , m , ε ) ( p i ( 2 ) , r i ( 2 ) ) ) < ε
for any i { 1 , , t } or
ρ ( ( h 1 × h 2 ) l ( n , m , ε ) ( p j ( 1 ) , r j ( 1 ) ) , ( h 1 × h 2 ) l ( n , m , ε ) ( p i 1 ( 2 ) , r i 2 ( 2 ) ) ) < ε
for any j { 1 , , s } . By the definition, h 1 × h 2 is collectively accessible.
By Lemma 7, H 2 is collectively accessible. By the above argument, h 1 h 2 and h 2 h 1 are collectively accessible. Because h 1 h 2 is collectively accessible, for any nonempty open subsets U 1 ( 1 ) , , U s ( 1 ) , U 1 ( 2 ) , , U t ( 2 ) E and V 1 ( 1 ) , , V s ( 1 ) , V 1 ( 2 ) , , V t ( 2 ) F satisfies
U j ( 1 ) × V j ( 1 ) M 2 ( j { 1 , , s } )
and
U i ( 2 ) × V i ( 2 ) M 2 ( i { 1 , , t } ) ,
one has that U j ( 1 ) h 2 1 ( V j ( 1 ) ) for any j { 1 , , s } , and that U i ( 2 ) h 2 1 ( V i ( 2 ) ) for any i { 1 , , t } . By the definition, for any λ > 0 , any j { 1 , , s } and i { 1 , , t } , there are p j ( 1 ) ( λ ) U j ( 1 ) h 2 1 ( V j ( 1 ) ) , p i ( 2 ) ( λ ) U i ( 2 ) h 2 1 ( V i ( 2 ) ) , and an integer m ( λ ) > 0 such that
| ( h 1 h 2 ) m ( λ ) ( p j 0 ( 1 ) ( λ ) ) ( h 1 h 2 ) m ( λ ) ( p i ( 2 ) ( λ ) ) | < λ
for any i { 1 , , t } and some j 0 { 1 , , s } , or
| ( h 1 h 2 ) m ( λ ) ( p j ( 1 ) ( λ ) ) ( h 1 h 2 ) m ( λ ) ( p i 0 ( 2 ) ( λ ) ) | < λ
for some i 0 { 1 , , t } and any j { 1 , , s } . By the uniform continuity of h 2 , one knows that for any λ > 0 , there is some λ > 0 with λ < λ such that | u 1 u 2 | < λ implies | h 2 ( u 1 ) h 2 ( u 2 ) | < λ . Let z j ( 1 ) ( λ ) = ( p j ( 1 ) ( λ ) , h 2 ( p j ( 1 ) ( λ ) ) ) for any j { 1 , , s } and z i ( 2 ) ( λ ) = ( p i ( 2 ) ( λ ) , h 2 ( p i ( 2 ) ( λ ) ) ) for any i { 1 , , t } . Then
z j ( 1 ) ( λ ) U j ( 1 ) × V j ( 1 ) M 2 ( j { 1 , , s } )
and
z i ( 2 ) ( λ ) U i ( 2 ) × V i ( 2 ) M 2 ( i { 1 , , t } ) .
It is clear that
| ( h 1 h 2 ) m ( λ ) ( p j 0 ( 1 ) ( λ ) ) ( h 1 h 2 ) m ( λ ) ( p i ( 2 ) ( λ ) ) | < λ < λ ( i { 1 , , t } ) ,
or
| ( h 2 h 1 ) m ( λ ) ( h 2 ( p j ( 1 ) ( λ ) ) ) ( h 2 h 1 ) m ( λ ) ( h 2 ( p i 0 ( 2 ) ( λ ) ) ) | < λ ( j { 1 , , s } ) .
Consequently,
ρ ( H 2 m ( λ ) ( z j 0 ( 1 ) ( λ ) ) , H 2 m ( λ ) ( z i ( 2 ) ( λ ) ) ) < λ ( i { 1 , , t } )
or
ρ ( H 2 m ( λ ) ( z j ( 1 ) ( λ ) ) , H 2 m ( λ ) ( z i 0 ( 2 ) ( λ ) ) ) < λ ( j { 1 , , s } ) .
This implies that H 2 | M 2 is collectively accessible. Similarly, one can prove that if h 2 h 1 is collectively accessible then so is H 2 | M 1 .
(2) Now, assume that H 2 | M 1 and H 2 | M 2 are collectively accessible, and that the maps h 1 and h 2 satisfy the conditions in the assumption.
Let H 2 | M 2 be collectively accessible. Obviously, for any nonempty open subsets U 1 ( 1 ) , , U 1 ( s ) , U 1 ( 2 ) , , U t ( 2 ) E , ( U j ( 1 ) × F ) M 2 and ( U i ( 2 ) × F ) M 2 are nonempty and open in M 2 for any i { 1 , 2 , , t } and any j { 1 , 2 , , s } . By the definition, for any λ > 0 , there are
p 1 ( 1 ) U 1 ( 1 ) , , p s ( 1 ) U s ( 1 ) , p 1 ( 2 ) U 1 ( 2 ) , , p s ( 2 ) U t ( 2 ) ,
and an integer m ( λ ) > 0 such that
ρ ( H 2 m ( λ ) ( p j 0 ( 1 ) ( λ ) , h 2 ( p j 0 ( 1 ) ( λ ) ) ) , H 2 m ( λ ) ( p i ( 2 ) ( λ ) , h 2 ( p i ( 2 ) ( λ ) ) ) ) < λ
for any i { 1 , , t } and some j 0 { 1 , , s } , or
ρ ( H 2 m ( λ ) ( p j ( 1 ) ( λ ) , h 2 ( p j ( 1 ) ( λ ) ) ) , H 2 m ( λ ) ( p i 0 ( 2 ) ( λ ) , h 2 ( p i 0 ( 2 ) ( λ ) ) ) ) < λ
for some i 0 { 1 , , t } and any j { 1 , , s } . Consequently,
| ( h 1 h 2 ) m ( λ ) ( p j 0 ( 1 ) ( λ ) ) ( h 1 h 2 ) m ( λ ) ( p i ( 2 ) ( λ ) ) | < λ
for i { 1 , , t } or
| ( h 1 h 2 ) m ( λ ) ( p j ( 1 ) ( λ ) ) ( h 1 h 2 ) m ( λ ) ( p i 0 ( 2 ) ( λ ) ) | < λ
for any j { 1 , , s } . This proves that h 1 h 2 is collectively accessible. Similarly, it can be proven that h 2 h 1 is collectively accessible. By the hypothesis, the definition, and the above argument, H 2 is collectively accessible. By Lemma 7, H is collectively accessible. □
Remark 3.
It cannot be known whether the product map h 1 × h 2 is collectively accessible under the condition that h 1 and h 2 are collectively accessible, respectively.
Theorem 5.
(1) If H is collectively Kato chaotic, then at least one of H 2 | M 1 and H 2 | M 2 is collectively Kato chaotic.
(2) Assume that H 2 | M 1 and H 2 | M 2 is collectively Kato chaotic. For any ε > 0 and any given integers s , t > 0 , if ( h 2 h 1 ) n ( p j ( 1 ) ) ( h 2 h 1 ) n ( p i ( 2 ) ) < ε and ( h 1 h 2 ) m ( r j ( 1 ) ) ( h 1 h 2 ) m ( r i ( 2 ) ) < ε for some integers n , m > 0 , any j { 1 , 2 , , t } , and any i { 1 , 2 , , s } means that there is an integer l ( n , m , ε ) > 0 satisfies
( h 2 h 1 ) l ( n , m , ε ) ( p j ( 1 ) ) ( h 2 h 1 ) l ( n , m , ε ) ( p i ( 2 ) ) < ε
and
( h 1 h 2 ) l ( n , m , ε ) ( r j ( 1 ) ) ( α h 2 ) l ( n , m , ε ) ( r i ( 2 ) ) < ε
for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } , then H is collectively Kato chaotic.
Proof. 
According to the definition of collective Kato’s chaos, Theorem 2, and Theorem 4, Theorem 5 is true. □
Example 4.
Let X = [ 0 , 1 ] and Y = [ 0 , 1 ] . h 1 : Y X is defined by h 1 ( r ) = 1 | 1 2 r | for any r X , and h 2 : X Y is h 2 ( p ) = 1 | 1 2 p | for any p X . Then, H, H 2 | M 1 and H 2 | M 2 are collectively Kato chaotic.
Proof. 
Clearly, h 1 ( = h 2 ) is a tent map. Because any tent map is topologically mixing, by Corollary 4.1 in [34], h 1 is collectively Kato chaotic. By the definition, the hypothesis, and Lemma 6, h 1 × h 2 is collectively sensitive. This implies that H 2 is collectively sensitive. By Lemma 5, H is collectively sensitive. By Theorem 2 and its proof, H 2 | M 1 and H 2 | M 2 are collectively sensitive. By Lemma 3.5 in [34] and the proof of Theorem 3.4 in [34], one can easily prove that h 1 × h 2 is collectively accessible, which implies H 2 is collectively accessible. By Lemma 7, H is collectively accessible. By hypothesis and Lemma 3.5 in [34], one can easily prove that H 2 | M 1 and H 2 | M 2 are accessible. Thus, H, H 2 | M 1 and H 2 | M 2 are collectively Kato chaotic. □
Theorem 6.
If H is onto, then H is sensitive if and only if so is H 2 | M 1 M 2 .
Proof. 
Assume that H is sensitive. By Lemma 2.1 in [18], H 2 is sensitive. Therefore, by this hypothesis, the definition of H 2 | M 1 M 2 , and the uniform continuity of h 1 and h 2 , H 2 | M 1 M 2 is sensitive.
Assume that H 2 | M 1 M 2 is sensitive. Then, by this hypothesis, the definition of H 2 | M 1 and H 2 | M 2 , the sensitivity of H 2 | M 1 and H 2 | M 2 , and Theorem 2.2 in [18], H is sensitive. □
Example 5.
Define X , Y , h 1 , and h 2 are the same as Example 1. Then the following hold:
(1) H is sensitive.
(2) H 2 | M 1 M 2 is not sensitive.
Proof. 
By hypothesis, Example 3.1, Lemma 1 in [32], and Theorem 2.2 in [18], one can easily prove that H is sensitive. By the hypothesis and Example 1, one can easily prove that H 2 | M 1 is not sensitive. Consequently, by the definitions of H 2 | M 1 , H 2 | M 2 and H 2 | M 1 M 2 , H 2 | M 1 M 2 is not sensitive. □
Remark 4.
Example 5 shows that it is necessary to assume that h 1 : F E and h 2 : E F are continuous onto maps for Theorem 3.6.
Theorem 7.
If H is onto, then H is collectively sensitive if and only if H 2 | M 1 M 2 is as well.
Proof. 
Assume that H is collectively sensitive. By Lemma 2.1 in [18], H 2 is collectively sensitive. Therefore, by the hypothesis, the definition of H 2 | M 1 M 2 , and the uniform continuity of h 1 and h 2 , H 2 | M 1 M 2 is collectively sensitive.
Assume that H 2 | M 1 M 2 is collectively sensitive. Then, by the hypothesis, the definition of H 2 | M 1 and H 2 | M 2 , H 2 | M 1 and H 2 | M 2 are collectively sensitive. By Theorem 2.2 in [18], H is collectively sensitive. □
Theorem 8.
If H is onto, and for any ε > 0 , any given integers s , t > 0 , there exist some integers n , m > 0 , such that ( h 2 h 1 ) n ( p j ( 1 ) ) ( h 2 h 1 ) n ( p i ( 2 ) ) < ε ( p j ( 1 ) , p i ( 2 ) E ) and ( h 1 h 2 ) m ( r j ( 1 ) ) ( h 1 h 2 ) m ( r i ( 2 ) ) < ε ( r j ( 1 ) , r i ( 2 ) F ) for any j { 1 , 2 , , t } and i { 1 , 2 , , s } , then there is an integer l ( n , m , ε ) > 0 satisfies
( h 2 h 1 ) l ( n , m , ε ) ( p j ( 1 ) ) ( h 2 h 1 ) l ( n , m , ε ) ( p i ( 2 ) ) < ε
and
( h 1 h 2 ) l ( n , m , ε ) ( r j ( 1 ) ) ( h 1 h 2 ) l ( n , m , ε ) ( r i ( 2 ) ) < ε
for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } , then H is collectively accessible if and only if so is H 2 | M 1 M 2 .
Proof. 
Assume that H is collectively accessible. By Lemma 2.2 in [18], H 2 is collectively accessible. Therefore, by the hypothesis, the definition of H 2 | M 1 M 2 , and the uniform continuity of h 1 and h 2 , H 2 | M 1 M 2 is collectively accessible.
Assume that H 2 | M 1 M 2 is collectively accessible. Then, by the hypothesis, the definition of H 2 | M 1 and H 2 | M 2 , one has that H 2 | M 1 and H 2 | M 2 are collectively accessible. By Theorem 4, H is collectively accessible. □
Theorem 9.
If H is onto, and for any ε > 0 , any given integers s , t > 0 , there exist some integers n , m > 0 , such that ( h 2 h 1 ) n ( p j ( 1 ) ) ( h 2 h 1 ) n ( p i ( 2 ) ) < ε ( p j ( 1 ) , p i ( 2 ) E ) and ( h 1 h 2 ) m ( r j ( 1 ) ) ( h 1 h 2 ) m ( r i ( 2 ) ) < ε ( r j ( 1 ) , r i ( 2 ) F ) for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } , then there is an integer l ( n , m , ε ) > 0 that satisfies
( h 2 h 1 ) l ( n , m , ε ) ( p j ( 1 ) ) ( h 2 h 1 ) l ( n , m , ε ) ( p i ( 2 ) ) < ε
and
( h 1 h 2 ) l ( n , m , ε ) ( r j ( 1 ) ) ( h 1 h 2 ) l ( n , m , ε ) ( r i ( 2 ) ) < ε
for any j { 1 , 2 , , t } and any i { 1 , 2 , , s } , and then H is collectively Kato chaotic if and only if so is H 2 | M 1 M 2 .
Proof. 
By Theorems 7 and 8, Theorem 9 holds. □

4. Conclusions

For an onto Cournot map H ( p , r ) = ( h 1 ( r ) , h 2 ( p ) ) ( p E , r F ) on product space E × F , h 1 h 2 is sensitive (resp. accessible, collectively sensitive, collectively accessible) if and only if h 2 h 1 is as well. H is Q -chaos if and only if H 2 | M 1 (i.e., the restriction of the map H 2 to the set M 1 ) and H 2 | M 2 (i.e., the restriction of the map H 2 to the set M 2 ) are Q -chaos. Where Q -chaos is sensitive, collectively sensitive, collectively accessible, accessible, or collectively Kato’s chaos, the set M 1 is given by { ( h 1 ( r ) , r ) : r F } , and the set M 2 is given by { ( p , h 2 ( p ) ) : p E } . Moreover, Theorems 3.7-3.9 provide the necessary and sufficient conditions of that H 2 | M 1 M 2 is Q -chaos.
The conclusions in this paper implies that, in the duopoly games, one can predict the complexity of the duopoly results of both sides by analyzing the behavior of one side of the market. Failure of either side to abide by market rules will lead to failure of cooperation.

Author Contributions

Conceptualization, Y.C.; validation, R.L. and Y.L.; formal analysis, R.L. and W.Q.; investigation, H.W.; writing original draft, H.W.; writing review and editing, T.L. and Y.C.; supervision, T.L.; funding acquisition, T.L. and R.L. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported the Project of the Department of Science and Technology of Sichuan Province (No. 2021ZYD0005), Ministry of Education Science and Technology Development center (No. 2020QT13) and Characteristic innovation project of colleges and universities in Guangdong Province in 2020 (No. 2020KTSCX351).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data sharing not applicable.

Acknowledgments

Many thanks to experts.

Conflicts of Interest

The authors declare no conflict of interest regarding the publication of this paper.

Sample Availability

Not applicable.

References

  1. Puu, T.; Sushko, I. Oligopoly Dynamics: Models and Tools; Springer: New York, NY, USA, 2002. [Google Scholar]
  2. Li, T.Y.; Yorke, J.A. Period three implies chaos. Amer. Math. Month. 1975, 82, 985–992. [Google Scholar]
  3. Akin, E.; Kolyada, S. Li-Yorke sensitivity. Nonlinearity 2003, 16, 1421–1433. [Google Scholar] [CrossRef]
  4. Schweizer, B.; Smítal, J. Measures of chaos and a spectral decomposition of dynamical systems on the interval. Trans. Amer. Math. Soc. 1994, 344, 737–754. [Google Scholar] [CrossRef]
  5. Oprocha, P.; Wilczyński, P. Shift spaces and distributional chaos. Chaos Soliton. Fract. 2007, 31, 347–355. [Google Scholar]
  6. Smítal, J.; Stefánková, M. Distributional chaos for triangular maps. Chaos Soliton. Fract. 2004, 21, 1125–1128. [Google Scholar]
  7. Pikula, R. On some notions of chaos in dimension zero. Colloq. Math. 2007, 107, 167–177. [Google Scholar] [CrossRef]
  8. Wang, L.D.; Huang, G.; Huan, S. Distributional chaos in a sequence. Nonlinear Anal. 2007, 67, 2131–2136. [Google Scholar] [CrossRef]
  9. Canovas J., S.; Ruíz Marín, M. Chaos on MPE-sets of duopoly games. Chaos Soliton. Fract. 2004, 19, 179–183. [Google Scholar]
  10. Canovas, J.S.; Ruíz Marín, M.; Soler, G. Ditributional chaos of duopoly games. Adv. Nonlinear Study 2001, 1, 79–87. [Google Scholar]
  11. Canovas, J.S. Chaos in duopoly games. Nonlinear Study 2000, 7, 97–104. [Google Scholar]
  12. Dana, R.A.; Montrucchio, L. Dynamic complexity in duopoly games. J. Econ. Theory 1986, 44, 40–56. [Google Scholar] [CrossRef]
  13. Rand, D. Exotic phenomena in games and doupoly models. J. Math. Econ. 1978, 5, 173–184. [Google Scholar] [CrossRef]
  14. Bischi, G.I.; Mammana, C.; Gardini, L. Multistability and cyclic attractors in duopoly games. Chaos Soliton. Fract. 2000, 11, 543–564. [Google Scholar] [CrossRef] [Green Version]
  15. Kopel, M. Simple and complex adjustment dynamics in Cournot duopoly games. Chaos Soliton. Fract. 1996, 7, 2031–2048. [Google Scholar]
  16. Puu, T. Chaos in duopoly pricing. Chaos Soliton. Fract. 1991, 1, 573–581. [Google Scholar]
  17. Lu, T.X.; Zhu, P.Y. Further discussion on chaos in duopoly games. Chaos Soliton. Fract. 2013, 52, 45–48. [Google Scholar]
  18. Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Soliton. Fract. 2016, 84, 69–72. [Google Scholar]
  19. Zhao, Y.; Li, R.S. Chaos in duopoly games via Furstenberg family couple. Complexity 2019, 5484629. [Google Scholar]
  20. Li, R.S.; Lu, T.X. The topological entropy of cyclic permutation maps and some chaotic properties on their MPE sets. Complexity 2020, 9379628. [Google Scholar] [CrossRef]
  21. Linero Bas, A.; Soler Lòpez, G. A note on the dynamics of cyclically permuted direct product maps. Topol. Appl. 2016, 203, 147–158. [Google Scholar]
  22. Linero Bas, A.; Soler Lòpez, G. A splitting result on transitivity for a class of n-dimensional maps. Nonlinear Dynam. 2016, 84, 163–169. [Google Scholar] [CrossRef]
  23. Moothathu, T.K.S. Stronger forms of sensitivity for dynamical systems. Nonlinearity 2007, 20, 2115–2126. [Google Scholar] [CrossRef]
  24. Xu, Z.J.; Lin, W.; Ruan, J. Decay of correlations implies chaos in the sense of Devaney. Chaos Soliton. Fract. 2004, 22, 305–310. [Google Scholar] [CrossRef]
  25. He, L.F.; Yan, X.H.; Wang, L.S. Weak-mixing implies sensitive dependence. J. Math. Anal. Appl. 2004, 299, 300–304. [Google Scholar]
  26. Salman, M.; Wu, X.X.; Das, R. Sensitivity of nonautonomous dynamical systems on uniform spaces. Int. J. Bifurcat. Chaos 2021, 31, 2150017. [Google Scholar] [CrossRef]
  27. Vasisht, R.; Das, R. On stronger forms of sensitivity in non-autonomous systems. Taiwanese J. Math. 2018, 22, 1139–1159. [Google Scholar] [CrossRef]
  28. Li, R.S.; Zhao, Y.; Wang, H.Q.; Liang, H.H. Stronger forms of transitivity and sensitivity for non-autonomous 409 discrete dynamical systems and Furstenberg families. J. Dyn. Control Syst. 2020, 26, 109–126. [Google Scholar]
  29. Ghane, F.; Rezaali, E.; Sarizadeh, A. Sensitivity of iterated function systems. J. Math. Anal. Appl. 2019, 469, 493–503. [Google Scholar]
  30. Gu, R.B. Kato’s chaos in set-valued discrete systems. Chaos Soliton. Fract. 2007, 33, 771–965. [Google Scholar]
  31. Wang, L.D.; Liang, J.H.; Chu, Z.Y. Weakly mixing property and chaos. Arch. Math. 2017, 109, 83–89. [Google Scholar] [CrossRef]
  32. Değirmenci, N.; Koçak, Ş. Chaos in product maps. Turlish J. Math. 2010, 34, 593–600. [Google Scholar]
  33. Kato, H. Everywhere chaotic homeomorphisms on manifields and k-dimensional Menger manifolds. Topol. Appl. 1996, 72, 1–17. [Google Scholar] [CrossRef] [Green Version]
  34. Li, R.S.; Lu, T.X.; Chen, G.R.; Yang, X. Further discussion on kato’s chaos in set-valued discrete systems. J. Appl. Anal. Comput. 2020, 10, 2491–2505. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, H.; Lu, T.; Li, R.; Chen, Y.; Li, Y.; Quan, W. Collective Sensitivity, Collective Accessibility, and Collective Kato’s Chaos in Duopoly Games. Mathematics 2022, 10, 4226. https://doi.org/10.3390/math10224226

AMA Style

Wang H, Lu T, Li R, Chen Y, Li Y, Quan W. Collective Sensitivity, Collective Accessibility, and Collective Kato’s Chaos in Duopoly Games. Mathematics. 2022; 10(22):4226. https://doi.org/10.3390/math10224226

Chicago/Turabian Style

Wang, Hongqing, Tianxiu Lu, Risong Li, Yuanlin Chen, Yongjiang Li, and Weizhen Quan. 2022. "Collective Sensitivity, Collective Accessibility, and Collective Kato’s Chaos in Duopoly Games" Mathematics 10, no. 22: 4226. https://doi.org/10.3390/math10224226

APA Style

Wang, H., Lu, T., Li, R., Chen, Y., Li, Y., & Quan, W. (2022). Collective Sensitivity, Collective Accessibility, and Collective Kato’s Chaos in Duopoly Games. Mathematics, 10(22), 4226. https://doi.org/10.3390/math10224226

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop