
Let (X,d) be a metric space and H(X) represent all non-empty, compact subsets of X. The expansivity of the multivalued map sequence ˉf1,∞:H(X)→H(X), including expansivity, positive ℵ0-expansivity, were investigated. Also, stronger forms of sensitivities, such as multi-sensitivity and syndetical sensitivity, were explored. This research demonstrated that some chaotic properties can be mutually derived between (f1,∞,X) and (ˉf1,∞,H(X)), showing fundamental similarities between these systems. Conversely, the inability to derive other properties underlined essential differences between them. These insights are crucial for simplifying theoretical models and enhancing independent research. Lastly, the relationship between expansivity and sensitivity was discussed and the concept of topological conjugacy to the system (ˉf1,∞,H(X)) was extended.
Citation: Jie Zhou, Tianxiu Lu, Jiazheng Zhao. The expansivity and sensitivity of the set-valued discrete dynamical systems[J]. AIMS Mathematics, 2024, 9(9): 24089-24108. doi: 10.3934/math.20241171
[1] | Xiaofang Yang, Tianxiu Lu, Waseem Anwar . Transitivity and sensitivity for the $ p $-periodic discrete system via Furstenberg families. AIMS Mathematics, 2022, 7(1): 1321-1332. doi: 10.3934/math.2022078 |
[2] | Risong Li, Tianxiu Lu, Xiaofang Yang, Yongxi Jiang . Sensitivity for topologically double ergodic dynamical systems. AIMS Mathematics, 2021, 6(10): 10495-10505. doi: 10.3934/math.2021609 |
[3] | Abdul Qadeer Khan, Zarqa Saleem, Tarek Fawzi Ibrahim, Khalid Osman, Fatima Mushyih Alshehri, Mohamed Abd El-Moneam . Bifurcation and chaos in a discrete activator-inhibitor system. AIMS Mathematics, 2023, 8(2): 4551-4574. doi: 10.3934/math.2023225 |
[4] | Doaa Filali, Mohammad Dilshad, Mohammad Akram . Generalized variational inclusion: graph convergence and dynamical system approach. AIMS Mathematics, 2024, 9(9): 24525-24545. doi: 10.3934/math.20241194 |
[5] | Junsoo Lee, Wassim M. Haddad . On finite-time stability and stabilization of nonlinear hybrid dynamical systems. AIMS Mathematics, 2021, 6(6): 5535-5562. doi: 10.3934/math.2021328 |
[6] | Huiting He, Chungen Liu, Jiabin Zuo . Periodic solutions of a class of non-autonomous second-order discrete Hamiltonian systems. AIMS Mathematics, 2024, 9(2): 3303-3319. doi: 10.3934/math.2024161 |
[7] | Hamidou Tembine . Mean-field-type games. AIMS Mathematics, 2017, 2(4): 706-735. doi: 10.3934/Math.2017.4.706 |
[8] | Jingmin Pi, Tianxiu Lu, Jie Zhou . Shadowing properties and chaotic properties of non-autonomous product systems. AIMS Mathematics, 2023, 8(9): 20048-20062. doi: 10.3934/math.20231021 |
[9] | Ali Al Khabyah, Rizwan Ahmed, Muhammad Saeed Akram, Shehraz Akhtar . Stability, bifurcation, and chaos control in a discrete predator-prey model with strong Allee effect. AIMS Mathematics, 2023, 8(4): 8060-8081. doi: 10.3934/math.2023408 |
[10] | Rou Lin, Min Zhao, Jinlu Zhang . Random uniform exponential attractors for non-autonomous stochastic Schrödinger lattice systems in weighted space. AIMS Mathematics, 2023, 8(2): 2871-2890. doi: 10.3934/math.2023150 |
Let (X,d) be a metric space and H(X) represent all non-empty, compact subsets of X. The expansivity of the multivalued map sequence ˉf1,∞:H(X)→H(X), including expansivity, positive ℵ0-expansivity, were investigated. Also, stronger forms of sensitivities, such as multi-sensitivity and syndetical sensitivity, were explored. This research demonstrated that some chaotic properties can be mutually derived between (f1,∞,X) and (ˉf1,∞,H(X)), showing fundamental similarities between these systems. Conversely, the inability to derive other properties underlined essential differences between them. These insights are crucial for simplifying theoretical models and enhancing independent research. Lastly, the relationship between expansivity and sensitivity was discussed and the concept of topological conjugacy to the system (ˉf1,∞,H(X)) was extended.
Discrete dynamical systems use iterative functions to model dynamic changes in both natural and engineering contexts. Within these systems, chaotic systems form a distinctive category, notable for their sensitivity to initial conditions, which is often summarized by the adage "small discrepancies lead to significant divergences" [1].
Based on whether the iterative mapping varies, dynamical systems can be divided into two categories: autonomous dynamical systems (abbreviated as ADDSs) [2] and non-autonomous dynamical systems (abbreviated as NDDSs) [3]. ADDSs were initially the primary focus of the study. They feature invariant evolutionary rules, with their behavior dictated by the constant equation xn+1=f(xn), reflecting a process dependent exclusively on the state. In contrast, NDDSs adapt to time-dependent changes such as daily and seasonal variations, placing them at the forefront of research into dynamic processes. Expansivity, characterized by a system's acute sensitivity to initial conditions, is a pivotal concept in the study of dynamical systems, thoroughly examined in references [4,5]. This concept has evolved into various broader forms such as n-expansivity, ℵ0-expansivity, continuous expansivity, and sparse expansivity, which are discussed in detail by [6,7,8,9,10,11,12].
Sensitivity in chaos theory, on the other hand, deals with how dynamical systems respond over time. The sensitivity of dynamical systems is discussed in [13,14,15,16,17], while the concept of Li-Yorke sensitivity is elaborated in [18,19,20]. The study of (H(X),ˉf1,∞) (a non-autonomous set-valued discrete dynamical system) has emerged as a significant advancement in understanding the behaviors of complex systems. These systems are characterized by mappings between sets rather than mere point-to-point transitions and have become a crucial area of research. Their dynamic properties such as transitivity and chaotic behavior have been scrutinized in [21,22,23,24]. Discussions on various chaotic dynamics in set-valued systems can be found in [25,26,27,28], with specific focus on the chaotic properties associated with the Furstenberg families detailed in [29,30]. Furthermore, their topological entropy is explored in [31,32,33,34].
In section 3 of this article, we delve into various expansivities of the space (H(X),ˉf1,∞). Moving to section 4, the discussion shifts to examining a range of sensitivities that manifest within the framework of (H(X),ˉf1,∞). Section 5 focuses on analyzing the interplay between expansivity and sensitivity. Section 6 further extends the exploration to include the concept of topological conjugacy, specifically applied to (H(X),ˉf1,∞).
In mathematical terms, an NDDS is a compact metric space X with a series of time-dependent maps fn:X→X, defining (X,f1,∞). The orbit of x is
Orbf1,∞(x)={x,f1(x),(f2∘f1)(x),…,fn1(X)…}, |
where fn1=fn∘⋯∘f1 for n≥1, and f01 serves as the identity.
Let H(X) denote the collection of all compact and non-empty subsets in X. Given A,B∈H(X), the Hausdorff metric between them is designated as
dH(A,B)=max{supa∈Ainfb∈Bd(a,b),supb∈Binfa∈Ad(b,a)}. |
For A∈H(X), the ϵ-ball in the dH is denoted as B(A,ϵ). The dilation by δ of the set A is defined by
N(A,δ)={x∈X∣d(x,A)<δ}. |
Consider a set-valued NDDS governed by (ˉf1,∞,H(X)), with state evolution,
An+1=ˉfn(An),n∈N. |
To enhance the rigor of the analysis, this study ensures that the sequence (ˉf1,∞,H(X)) preserves the topological properties such as continuity, compactness, and openness, and each fn is a homeomorphism.
Definition 2.1. ([21]) Let C be a subset of X, defining the extension of C within H(X) as
e(C)={K∈H(X)∣K⊆C}. |
Lemma 2.1. Let C be a subset of X. The following properties are established.
(1) The set e(C) is non-empty if and only if C is non-empty;
(2) e(C) forms an open subset within H(X) when A itself is open in X;
(3) e(C∩D)=e(C)∩e(D);
(4) ˉfi(e(C))⊆e(ˉfi(C)) with i=1,2,3...;
(5) The operation ¯fn1=ˉfn1 holds for all n in N.
Proof. The argument for this lemma closely mirrors that presented for Lemma 3.5 in [21].
Theorem 2.1. If (f1,∞,X) exhibits uniform continuity, it follows that (ˉf1,∞,H(X)) also maintains uniform continuity.
Proof. Since X is compact and each fn is uniformly continuous, consider all ϵ>0. There exists a δ>0 such that for each x,y∈X and n∈N, if d(x,y)<δ, then d(fn(x),fn(y))<ϵ. For any compact sets A,B within H(X), we calculate the following formulation for the Hausdorff distance between ˉfn(A) and ˉfn(B).
dH(ˉfn(A),ˉfn(B))=max{supa∈Ainfb∈Bd(fn(a),fn(b)),supb∈Binfa∈Ad(fn(b),fn(a))}. |
Given ϵ>0, select δ>0 due to the uniform continuity of ˉf1,∞. If dH(A,B)<δ, then for every a∈A and n∈N, one can find a b∈B:d(a,b)<δ and consequently,
d(fn(a),fn(b))<ϵ. |
Since a can take any point in A, this demonstrates that
supa∈Ainfb∈Bd(fn(a),fn(b))<ϵ. |
Similarly, for every b∈B, one can find an a∈A that satisfies
d(fn(b),fn(a))<ϵ. |
This demonstrates that
supb∈Binfa∈Ad(fn(b),fn(a))<ϵ. |
Combining the results
supa∈Ainfb∈Bd(fn(a),fn(b))<ϵandsupb∈Binfa∈Ad(fn(b),fn(a))<ϵ, |
it is easy to obtain that
H(ˉfn(A),ˉfn(B))<ϵ, |
which shows that ˉfn maintains uniform continuity across H(X).
Definition 3.1. ([8,10,11,27]) A map sequence (or system (X,f1,∞)) is said to be
(1) expansive if there exists a sequence of real constants {λn}∞n=1 with each λn>1(n∈N) such that, for all x,y∈X and for each n∈N,
d(fn(x),fn(y))≥λnd(x,y). |
(2) positively expansive if an expansivity constant ρ>0 is found such that, for any two distinct points x,y in X, there exists an n∈N that satisfies
d(fn1(x),fn1(y))≥ρ. |
(3) n-expansive if a constant c>0 is designated as an n-expansivity constant, whereby for each x∈X, the set {y∈X:d(fi1(x),fi1(y))≤c,i∈N} contains no more than n elements.
(4) ℵ0-expansive if a constant c>0 (designated as an ℵ0-expansivity constant) exists such that for any x∈X, the set {y∈X:d(fi1(x),fi1(y))≤c,i∈N} is countable.
Lemma 3.1. Let x and y be two distinct points in the space X, and d(x,y)=δ>0. Then for any ϵ>0, dH(Bϵ({x}),Bϵ({y}))=δ.
For this, a simple example in the two-dimensional plane can be given (see Figure 1). Consider two circles with the same radius (AG=BH=δ), and centers are designated as A and B, respectively. The distance between A and B is ϵ units. The points C, A, E, F, B, and D lie on the same straight line.
Now, let X be a two-dimensional space with x=A and y=B. According to our assumption, d(x,y)=d(A,B)=δ. In accordance with the defined properties of the dH and the given illustration, one can readily derive that the dH between Bϵ(x) and Bϵ(y) is
dH(Bϵ({x}),Bϵ({y})=max{CF,ED}. |
Since the radii of the two circles are the same, then CF=ED=δ. Hence, dH(Bϵ({x}),Bϵ({y}))=δ.
Theorem 3.1. f1,∞ is expansive for space X if and only if ˉf1,∞ is expansive for the space H(X).
Proof. (Necessity) Assume that f1,∞ is expansive for the space X. For any two sets A,B∈H(X), the images under fn(n∈N) are denoted by ˉfn(A) and ˉfn(B). In accordance with the definition of the dH, one has
dH(ˉfn(A),ˉfn(B))=max{supa∈Ad(fn(a),fn(B)),supb∈Bd(fn(b),fn(A))}. |
By the expansivity of f1,∞, for each a∈A and b∈B, one finds that
d(fn(a),fn(B))≥λnd(a,B)andd(fn(b),fn(A))≥λnd(b,A). |
Therefore,
supa∈Ad(fn(a),fn(B))≥λnsupa∈Ad(a,B)andsupb∈Bd(fn(b),fn(A))≥λnsupb∈Bd(b,A), |
which implies
max{supa∈Ad(fn(a),fn(B)),supb∈Bd(fn(b),fn(A))}≥λnmax{supa∈Ad(a,B),supb∈Bd(b,A)}, |
so
dH(ˉfn(A),ˉfn(B))≥λndH(A,B). |
This completes the proof that ˉf1,∞ is expansive for H(X) endowed with the dH.
(Sufficiency) Let us posit a sequence of real constants {λn}∞n=1 with λn>1 for all n∈N such that ˉf1,∞ is expansive, that is, for any two sets A,B∈H(X) and for every n∈N,
dH(ˉfn(A),ˉfn(B))≥λndH(A,B). |
Based on the expansivity of the system ˉf1,∞ for two distinct sets x,y∈X, consider them as single-element sets in H(X). In terms of the dH definition, dH({x},{y})=d(x,y). Since ˉf1∞ is expansive,
dH(ˉfn({x}),ˉfn({y}))≥λndH({x},{y}). |
This implies that
dH({fn(x)},{fn(y)})≥λnd(x,y), |
which reduces to
d(fn(x),fn(y))≥λnd(x,y). |
Hence, f1,∞ is expansive.
Remark. ˉf1,∞ being n-expansive with constant c does not necessarily imply that f1,∞ is n-expansive with the same constant.
In fact, if ˉf1,∞ is n-expansive, for any x∈X, consider Ax={x}. By the n-expansivity, for each x∈X and i∈N, there exist infinitely many points y∈X such that d(fi(x),fi(y))≤c. Hence f1,∞ is not n-expansive with constant c.
However, since the set-valued system acts on finite compact subsets, let
HF(X)={K∈H(X)∣K is finite}, |
thus, if ˉf1,∞ is n-expansive, one can infer that f1,∞ is also n-expansive.
Theorem 3.2. If (HF(X),ˉf1,∞) is n-expansive, then X,(f1,∞) is n′-expansive for some n′≥n.
Proof. (HF(X),ˉf1,∞) exhibits n-expansivity. For any x∈X, consider Ax={x}. Since n-expansivity implies that for every A∈HF(X), there exist at most n(n∈N) finite compact subsets {M}n1∈HF(X) such that
dH(ˉfi(A),ˉfi(Mj))≤c,∀i∈N,j=1,…,n. |
For Ax, this means that there exist at most n(n∈N) finite compact subsets {M}n1∈HF(X) characterized by
dH(ˉfi(Ax),ˉfi(Mj))≤c,∀i∈N,j=1,…,n. |
If the maximum number of points in all M is m, let n′=m⋅n, and one can find that for each x∈X, there are at most n′ points {y}n′1∈X whereby
d(fi(x),fi(yj))≤c,∀i∈N,j=1,…,n′. |
This demonstrates f1,∞ is n′-sensitive with the constant c.
It should be noted that the converse of Theorem 3.2 is not valid for the reason that n-expansivity for f1,∞ does not imply n-expansivity for ˉf1,∞.
In fact, given (X,f1,∞) is n-expansive, then, for all x∈X,
|{y∈X:∀i∈N,d(fi(x),fi(y))≤c}|≤n. |
Being n-expansive implies that for every x∈X, at most n(n∈N) finite points {y}n1∈X exist whereby
d(fi(x),fi(yj))≤c,∀i∈N,j=1,…,n. |
Let us denote these n points as {y}n1. For any yj, it holds that
d(fi(x),fi(yj))≤c,j=1,2,⋯,n. |
However, for Ax=x, it is possible to find infinitely many sets {B1,B2…} such that
dH(ˉfi(Ax),ˉfi(Bm))=d(fi(x),fi(ym))≤c,∀i,m∈N,ym∈Bm. |
Therefore, ˉf1,∞ is not n-expansive.
Theorem 3.3. If (HF(X),ˉf1,∞) is ℵ0-expansive with expansivity constant c, then (X,f1,∞) is also ℵ0-expansive with the same constant.
Proof. Assume that (HF(X),ˉf1,∞) is ℵ0-expansive. For each point x∈X, let us define the singleton set Ax={x} in H(X). Due to the ℵ0-expansivity of (HF(X),ˉf1,∞), the collection of sets
ˉNc(Ax)={B∈H(X):dH(ˉfi1(Ax),ˉfi1(B))≤c,∀i∈N} |
is at most countable.
Continuing further, write the countable sets in ˉNc(Ax) as {Bm}∞i=m, and for any given m∈N, since Bm is a finite compact subset, the number of points in Bm is finite.
Let the cardinality of {Bm}∞i=1 be ℵ′, and the maximum cardinality of Bm(m∈N) be ℵ″. Let ℵ=ℵ′×ℵ″.
Since both ℵ′ and ℵ″ are countable, then ℵ is also countable. Therefore, in point systems, one can only find some countable number of points y1,y2,… such that the elements in
Nc(x)={yj∈X:d(fi1(x),fi1(yj))≤c,∀i∈N} |
are fewer than ℵ.
Hence, the system (X,f1,∞) is ℵ0-expansive.
Unfortunately, similar to n-expansivity, even if (HF(X),ˉf1,∞) is ℵ0-expansive, it still does not imply that f1,∞ is ℵ0-expansive. The proof is analogous to the case with n-expansivity.
Theorem 3.4. If (H(X),ˉf1,∞) is positively expansive, then (X,f1,∞) is also positively expansive.
Proof. Assume that ˉf1,∞ on the compact set space H(X) is positively expansive, meaning that a positive constant ρ can be identified such that, for any two distinct compact sets A,B∈H(X), there exists some n∈N whereby
dH(ˉfn(A),ˉfn(B))≥ρ, |
where dH denotes the Hausdorff distance.
To prove that f1,∞ is also positively expansive on X, we consider any two distinct points x,y∈X. The ϵ-neighborhoods of x and y are denoted by N(x,ϵ) and N(y,ϵ). Let ¯N(x,ϵ)=Kx and ¯N(y,ϵ)=Ky denote their closures, respectively.
By the positive expansivity of the set-valued system, for these two compact spaces Kx,Ky, an n1∈N can be found for which
dH(ˉfn1(Kx),ˉfn1(Ky))≥ρ. |
Due to the special structure of Kx,Ky, applying Lemma 3.1 one can get that
dH(Kx,Ky)=d(x,y). |
Due to the continuous nature of ˉf1,∞, then
dH(ˉfn(Kx),ˉfn(Ky))=d(fn(x),fn(y))≥ρ. |
Thus, (X,f1,∞) is also positively expansive.
Theorem 3.5. If f1,∞ is expansive, then f1,∞ being positively expansive implies ˉf1,∞ is also positively expansive.
Proof. Consider any two distinct non-empty compact sets A,B∈H(X). For any a∈A and b∈B, by the positive expansivity of f1,∞, there exists an n0∈N, such that
d(fn01(a),fn01(b))≥ρ. |
Since f1,∞ is also expansive, for any n1∈N:n1>n0, one has
d(fn1n0(a),fn1n0(b))>d(fn0(a),fn0(b))≥ρ. |
Then, it can be concluded that
d(fn11(a),fn11(b))>ρ. |
Hence, one can find a suitable n∈N ensuring that, for any two different points x,y∈X, regardless of how x and y vary, there exists some n∈N ensuring that
d(fn(x),fn(y))≥ρ. |
According to the defined properties of the dH and the fact that fn1 is continuous, then, for all two non-empty compact sets, given the continuity of ˉfn1, it consequently follows that
dH(ˉfn1(A),ˉfn1(B))=max{supa∈Ainfb∈Bd(fn1(a),fn1(b)),supb∈Binfa∈Ad(fn1(b),fn1(a))}≥ρ. |
This means that ˉf1,∞ is positively expansive.
Definition 4.1. ([16]) The mapping sequence (or (X,f1,∞)) is called sensitive if there exists an η>0 such that, for any a∈X and any ϵ>0, one can find b∈B(a,ϵ) and n∈N satisfying d(fn1(a),fn1(b))>η.
Definition 4.2. ([14]) The sequence of mappings (or system (X,f1,∞)) is designated as collectively sensitive if there exists an η>0 such that, for each ϵ>0 and every set of distinct finite points a1,a2,…,ak within X, there are k distinct points b1,b2,…,bk∈X meeting the following conditions:
(1) d(ai,bi)<ϵ for each 1≤i≤k;
(2) there exists 1≤i0,j0≤k and an integer greater than zero n∈N whereby
d(fn1(ai0),fn1(bj0))>ηord(fn1(aj0),fn1(bi0))>η. |
Definition 4.3. ([18]) f1,∞ is defined as Li-Yorke sensitive if an ϵ>0 exists such that, for every x∈X and any neighborhood U(x) of x, there can be found y∈U(x) where the pair (x,y) is proximal but its orbit is frequently at least ϵ apart. That is, the subsequent conditions are satisfied:
lim infn→∞d(fn1(x),fn1(y))=0 |
and
lim supn→∞d(fn1(x),fn1(y))>ϵ. |
Definition 4.4. ([14]) A set S⊆N is said to be
(1) syndetic if k is a positive integer that can be established so that for any j∈N, the intersection {j,j+1,…,j+k}∩S is non-empty.
(2) thick if, for each n∈N, one can identify an m∈N such that the set {m,m+1,m+2,…,m+n} forms a subset of S.
(3) thickly syndetic if, for every l∈N, an m∈N can be found such that {m+j:0≤j≤l}⊆S, where S is syndetic.
Denote
Nf1,∞(V,δ)={n∈N:there exist x,y∈U satisfying d(fn1(x),fn1(y))>δ} |
for any non-empty open subset V in X.
Definition 4.5. Consider an NDDS (X,f1,∞). The system can exhibit various types of sensitivity, and (X,f1,∞) is said to be
(1) multi-sensitive if a δ>0, designated as a multi-sensitivity constant, can be identified, whereby for any n∈N and each group of non-empty open subsets V1,V2,…,Vn in X, the intersection ⋂ni=1Nf1,∞(Vi,δ) remains non-empty;
(2) syndetically sensitive if for some δ>0, it holds that for every non-empty open subset V of X, the set Nf1,∞(V,δ) is syndetic for some δ>0;
(3) thickly sensitive if for any non-empty open subset V of X, the set Nf1,∞(V,δ) is thick for some δ>0;
(4) thickly syndetically sensitive if for each non-empty open subset V of X, the set Nf1,∞(V,δ) is thickly syndetic for some δ>0;
(5) cofinitely sensitive if there exists a constant δ>0, termed a sensitive constant, whereby for every non-empty relative open subset V within X, there is an N≥1 such that Nf1,∞(V,δ) includes [N,+∞)∩N.
Theorem 4.1. The system (H(X),ˉf1,∞) exhibits multi-sensitivity if and only if the system (X,f1,∞) demonstrates multi-sensitivity.
Proof. (Necessity) Consider every group of open subsets that are not empty V1,V2,…,Vn in X. For each Vi, e(Vi) represents the ensemble of all compact subsets within Vi. Assume (H(X),ˉf1,∞) exhibits multi-sensitivity with sensitivity constant δ>0. Then, for every collection of open sets e(V1),e(V2),…,e(Vn) in H(X), one can identify an n in N whereby
n⋂i=1Nˉf1,∞(e(Vi),δ)≠∅. |
So for any i=1,…,n, there are two sets M,N∈Vi whereby
dH(ˉfn1(M),ˉfn1(N))>δ. |
According to the definition of dH and the continuity of ˉf1,∞, one can certainly find two points x∈M⊂Vi, y∈N⊂Vi whereby
d(fn1(x),fn1(y))>δ. |
Thus, regarding any collection of open sets V1,V2,…,Vn in X, there exists an n∈N such that the intersection
n⋂i=1Nf1,∞(Vi,δ)≠∅. |
Therefore, f1,∞ is also multi-sensitive.
(Sufficiency) Assume that (X,f1,∞) exhibits multi-sensitivity. That is, regarding any assembly of open subsets that are not empty {Vi}mi=1 in X, one can identify an n∈N such that for at least one i, there are points x,y∈Vi satisfying d(fn1(x),fn1(y))>δ.
For points x,y in Vi that satisfy d(fn1(x),fn1(y))>δ, construct Kx and Ky as follows
(1) Choose ϵ-neighborhoods Bϵ(x) and Bϵ(y) in e(Vi), where ϵ is small enough such that ¯Bϵ(x) and ¯Bϵ(y) are entirely contained within e(Vi). Let ¯Bϵ(x)=Kx and ¯Bϵ(y)=Ky.
(2) Due to the multi-sensitivity of f1,∞, for the chosen n∈N, one has
d(fn1(x),fn1(y))>δ. |
Let d(x,y)=δ1 (δ1>δ), then by the continuity of ˉf1,∞ and Lemma 3.1, one can easily obtain that
dH(ˉfn1(Kx),ˉfn1(Ky))=δ1>δ. |
This means that
n⋂i=1Nˉf1,∞(e(Vi),δ)≠∅. |
Therefore, ˉf1,∞ is also demonstrated to be multi-sensitive.
Theorem 4.2. The system (H(X),ˉf1,∞) demonstrates syndetic sensitivity with a specified sensitivity constant δ>0 if and only if the system (X,f1,∞) also exhibits syndetic sensitivity.
Proof. (Necessity) Assuming the system (H(X),ˉf1,∞) is syndetically sensitive, for some δ>0, it holds that for each open subset V⊆X that is not empty, the set
Nˉf1,∞(e(V),δ)={n∈N:∃K1,K2∈e(V),dH(ˉfn(K1),ˉfn(K2))>δ} |
is syndetic, where e(V)={K∈H(X):K⊆V}.
For any k∈Nˉf1,∞(e(V),δ), define {x}=K1⊂V, then there exists a K2⊂V such that
dH(ˉfn1(K1),ˉfn1(K2))=dH(ˉfn1({x}),ˉfn1(K2))>δ. |
By the compactness of V and the continuity of ˉf1,∞, there exists a y0∈K2 such that:
dH(ˉfk1({x}),ˉfk1(K2))=d(fk1(x),fk1(y0))>δ. |
Therefore
Nf1,∞(V,δ)={n∈N:∃x,y∈V,d(fn(x),fn(y))>δ} |
is syndetic. Hence (X,f1,∞) is syndetically sensitive.
(Sufficiency) Assuming that the system (X,f1,∞) exhibits syndetic sensitivity, it follows that a constant δ>0 exists, ensuring that for every non-empty open set V⊂X, the set
Nf1,∞(V,δ)={n∈N:∃x,y∈V,d(fn1(x),fn1(y))>δ} |
is syndetic. This means that a k can be found within N such that for each j∈N, the intersection {j,j+1,…,j+k}∩Nf1,∞(V,δ) is non-empty.
For each index n∈Nf1,∞(V,δ), there are points x,y∈V for which d(fn1(x),fn1(y))>δ. To demonstrate syndetic sensitivity of (H(X),ˉf1,∞), consider any open set that is not empty e(V) in H(X). Let e(V)={K∈H(X):K⊆V}. Thus, for the compact sets Kx={x} and Ky={y}, one has
dH(ˉfn1(Kx),ˉfn1(Ky))=d(fn1(x),fn1(y))>δ. |
Given the same k, one can observe that the set {j,j+1,…,j+k}∩Nˉf1,∞(e(U),δ) is not empty. Consequently, Nˉf1,∞(e(U),δ) is syndetic, which confirms that (H(X),ˉf1,∞) exhibits syndetic sensitivity.
Theorem 4.3. The system (H(X),ˉf1,∞) is thickly sensitive if and only if the system (X,f1,∞) is also thickly sensitive.
Proof. (Necessity) Assume that the set-valued system (H(X),ˉf1,∞) is thickly sensitive with a sensitivity constant δ>0, and it implies that for any open set e(V)={K∈H(X):K⊂V} in H(X), the set
Nˉf1,∞(e(V),δ)={n∈N:∃K1,K2∈e(V),dH(ˉfn1(K1),ˉfn1(K2))>δ} |
is thick.
To prove that the point dynamical system (X,f1,∞) is also thickly sensitive, we consider any open set V⊂X.
For all pairs x,y in set V, should there exist an n∈N such that d(fn1(x),fn1(y))>δ, given Kx={x} and Ky={y} as elements in e(V), for every n∈Nˉf1,∞(e(V),δ), one has
dH(ˉfn1(Kx),ˉfn1(Ky))=d(fn1(x),fn1(y))>δ. |
This ensures that
Nf1,∞(V,δ)={n∈N:∃x,y∈V,d(fn1(x),fn1(y))>δ} |
is thick. So (X,f1,∞) exhibits thick sensitivity as well.
(Sufficiency) The methodology of this proof closely mirrors that of necessity.
Theorem 4.4. The system (H(X),ˉf1,∞) exhibits thickly syndetic sensitivity if and only if the system (X,f1,∞) exhibits thickly syndetic sensitivity behavior.
Proof. (Necessity) Assume that the system (H(X),ˉf1,∞) is thickly syndetically sensitive and equipped with a sensitivity constant δ>0. For every open set V⊂X, the corresponding open set e(V)∈H(X).
The thickly syndetically sensitive nature of (H(X),ˉf1,∞) implies that for every length l∈N, a natural number m can be identified such that, for each k within the set {m,m+1,…,m+l}, Nˉf1,∞(e(V),δ) is syndetic. Specifically, there exist two subsets M,N∈e(V) such that, for any k∈{m,m+1,…,m+l},
dH(ˉfk1(M),ˉfk1(N))>δ. |
By the definition of dH and the continuity of ˉf1,∞, for the aforementioned k, there exist points x∈M⊂V, y∈N⊂V ensuring that
d(fk1(x),fk1(y))>δ. |
By the arbitrariness of k,
{m,m+1,…,m+l}⊆Nf1,∞(V,δ), |
where Nf1,∞(V,δ) demonstrates syndetic properties. Consequently, the system (X,f1,∞) exhibits thickly syndetic sensitivity.
(Sufficiency) Given that the system (X,f1,∞) exhibits thickly syndetic sensitivity, for each open subset V of X, one has a sensitivity constant δ>0. This implies that there exists a thickly syndetic set S⊆N for which, there are points x,y∈V satisfying d(fn1(x),fn1(y))>δ for every n∈S.
To construct corresponding compact sets K1 and K2 in e(V)={K∈H(X):K⊆V}, we select small enough neighborhoods around x and y, denoted as Bϵ(x) and Bϵ(y), and take their closures to form K1=¯Bϵ(x) and K2=¯Bϵ(y).
By the compactness of K1 and K2, along with the continuity of ˉf1,∞, according to Lemma 3.1 and the definition of dH, it is straightforward to deduce that
dH(ˉfn1(K1),ˉfn1(K2))=d(fn1(x),fn1(y))>δ. |
For every n∈S, it holds that
dH(ˉfn1(K1),ˉfn1(K2))>δ, |
which satisfies the condition of thick syndetic sensitivity for (H(X),ˉf1,∞).
Theorem 4.5. (X,f1,∞) is cofinitely sensitive if and only if the system (H(X),ˉf1,∞) exhibits the same property.
Proof. The proof method follows closely with that of Theorem 4.4.
Theorem 4.6. The system (H(X),ˉf1,∞) exhibits collective sensitivity with a sensitivity constant η>0 if and only if the system (X,f1,∞) also exhibits collective sensitivity with the same sensitivity constant.
Proof. (Necessity) Assume that (H(X),ˉf1,∞) exhibits collective sensitivity, implying that for each ϵ>0, and any finite collection of compact sets {A1,A2,…,Ak} in H(X), there exists a corresponding collection {B1,B2,…,Bk} in H(X) satisfying:
(1) dH(Ai,Bi)<ϵ holds for every 1≤i≤k,
(2) there exist indices 1≤i0,j0≤k and n∈N such that dH(ˉfn1(Ai0),ˉfn1(Bj0))>η.
Considering any finite distinct points {a1,a2,…,ak} in X, where ai∈Ai for all 1≤i≤k, for each point ai, select a point bi∈Bi satisfying d(ai,bi)<ϵfor all1≤i≤k.
If there exist indices 1≤i1,j1≤k and n∈N such that
dH(ˉfn1(Ai1),ˉfn1(Bj1))>η, |
then for B(xi1,δ)=Ai1 and B(yj1,δ)=Bj1, one has
d(fn1(xi1),fn1(yj1))=dH(ˉfn1(Ai1),ˉfn1(Bj1))>η. |
Thus,
(1) each pair (ai,bi) satisfies d(ai,bi)<ϵ for all 1≤i≤k;
(2) there exists at least one pair of indices 1≤i0,j0≤k and an n∈N such that
d(fn1(ai0),fn1(bj0))>ηord(fn1(aj0),fn1(bi0))>η. |
Therefore, (X,f1,∞) exhibits collective sensitivity.
(Sufficiency) For all ϵ>0 and each finite collection of compact sets {A1,A2,…,Ak} in H(X), there exists a corresponding collection {B1,B2,…,Bk} in H(X) satisfying
dH(Ai,Bi)<ϵfor all1≤i≤k. |
According to the definition of the dH, one can find ai∈Ai and bi∈Bi (1≤i≤k) satisfying
d(ai,bi)<ϵfor all1≤i≤k. |
Since f1,∞ is collectively sensitive, then one can ascertain the existence of at least one pair of indices 1≤i0,j0≤k and an n∈N such that
d(fn1(ai0),fn1(bj0))>ηord(fn1(aj0),fn1(bi0))>η. |
Due to the continuity of f1,∞ and the compactness of Ai0 and Bj0 for any m∈N, there always exist fixed x∈Ai0 and y∈Bj0 such that
dH(ˉfm1(Ai0),ˉfm1(Bj0))=d(fm1(x),fn1(y)). |
Therefore, there always exists an m0∈N such that
d(fm01(x),fm01(y))>η. |
That is to say,
dH(ˉfm1(Ai0),ˉfm1(Bj0))=d(fm01(x),fm01(y))>η. |
Thus, (H(X),ˉf1,∞) also exhibits collective sensitivity.
Theorem 4.7. If the system (H(X),ˉf1,∞) exhibits Li-Yorke sensitivity, then the system (X,f1,∞) is also Li-Yorke sensitive.
Proof. Assume that (H(X),ˉf1,∞) demonstrates Li-Yorke sensitivity. Then, for any given point y∈X and for each δ>0, one can find a compact set K⊂X such that the dH H({y},K) is less than δ, and the pair ({y},K) forms an ϵ-Li-Yorke sensitive pair under the map sequence ˉf1,∞.
This implies that, for any ϵ>0 and point y∈X, the Li-Yorke sensitivity of ˉf1,∞ guarantees the existence of a point y′ within X such that the orbit of y′ intermittently approaches and recedes from that of x, that is,
lim infn→∞d(fn1(y),fn1(y′))=0 |
and
lim supn→∞d(fn1(y),fn1(y′))>ϵ. |
Consequently, the system (X,f1,∞) exhibits Li-Yorke sensitivity.
The example below demonstrates that Li-Yorke sensitivity in f1,∞ does not automatically confer Li-Yorke sensitivity in ˉf1,∞, if X is a linear space containing 23 of the closed convex subsets therein. Let
Hc(X)={K∈H(X)∣K is convex and contains 23}. |
Example 4.1. Examine the mapping of the interval f:[0,1]→[0,1] defined by
f(x)={2xif x∈[0,12];2(1−x)if x∈(12,1]. |
This function is commonly referred to as the tent map. It is topologically transitive on (0,1), contains periodic points, and exhibits Li-Yorke sensitivity. For every point x∈(0,1), an interval neighborhood U(x) can be found whereby, for some y∈U(x), the duo (x,y) constitutes a Li-Yorke pair. That is,
lim infn→∞d(fn1(x),fn1(y))=0 |
and
lim supn→∞d(fn1(x),fn1(y))>ϵ. |
However, the point x=23 is a fixed point of f. Now, let K, a subset that is both compact and convex, reside within [0,1], which contains the fixed point 23. It follows that if K, a compact and convex subset, is contained within the interval [0,1], consequently, ˉf(K), resulting from the function application, remains a subset that is both compact and convex within the interval [0,1] and contains the fixed point 23. Therefore, ˉf can extend as a map ˉf:Hc([0,1])→Hc([0,1]), where Hc([0,1]) denotes the assembly of all subsets that are both compact and convex of the interval [0,1]. H23c([0,1]) denotes the collection of all subsets of [0,1] that are compact and convex that contain the point 23.
For the compact convex set {23}∈H23c([0,1]) and its neighborhood B({23},15), for any M∈B({23},15) containing 23 and i∈N, one has that
dH(ˉfi1({23}),ˉfi1(M))<25 |
fails to meet one of the conditions for Li-Yorke sensitivity. Specifically, it does not satisfy the requirement that for any ϵ>0,
lim supn→∞d(ˉfn1({23}),ˉfn1(M))>ϵ. |
Hence, ˉf|H23c([0,1]):H23c([0,1])→ H23c([0,1]) is not Li-Yorke sensitive.
In ADDSs, expansive implies sensitive (see Theorem 5.1).
Theorem 5.1. f being expansive implies that ˉf is sensitive.
Proof. Define f:X→X as an expansive function within the metric space (X,d). Then, for each pair of distinct points x,y in X, the distance between their images under f expands by a factor λ>1, i.e.,
d(f(x),f(y))≥λ⋅d(x,y). |
For any point x∈X and any ϵ>0, it is possible to identify a point y∈X and a natural number n∈N such that
d(x,y)<ϵ. |
For a given δ>0, by choosing an n∈N sufficiently large to satisfy λnϵ>δ, it follows that
d(fn(x),fn(y))≥δ. |
This demonstrates that f is sensitive. In fact, since the expansivity guarantees that after n iterations, the separation between the trajectories of x and y exceeds δ, specifically,
d(fn(x),fn(y))≥λnd(x,y)>δ. |
Hence, f exhibits sensitivity.
However, in NDDSs, expansivity does not necessarily imply sensitivity. Here is a counterexample.
Example 5.1. Consider the metric space X=R equipped with the metric d(a,b)=∣a−b∣, a non-autonomous system is structured with a sequence of functions {fn}, where fn(x)=(1+110n)x (n∈N). The expansivity factor for this system is λn=1+110n, which satisfies the expansivity definition.
As shown in the images (see Figure 2), after 1,000,000 iterations, the distance between the trajectories of two points x0=1.00 and y0=1.05 has not significantly increased. This indicates that the function lacks sensitivity.
This example illustrates that despite the system being expansive by definition, the particular nature of the non-autonomous expansivity factors {λn} approaching 1 prevents the system from exhibiting sensitivity to initial conditions in the long term. For more complex NDDSs, this conclusion needs to be slightly modified so that λn>1 does not converge to 1 as time varies. Even though the function changes over time, expansivity still implies sensitivity. Below is a simple proof (Theorem 5.1′).
Theorem 5.1′. Let λn>1 and assume it does not converge to 1. If the dynamical system f1,∞ is expansive, then it is also sensitive.
Proof. The premise that λn>1 and does not converge to 1 guarantees that for each pair of points x,y within X, a certain condition holds, such as d(x,y)<ϵ for some ϵ>0. For all n∈N, one has
d(fn(x),fn(y))≥λnd(x,y). |
Based on the proof approach for ADDSs, we have proved the sensitivity.
This property can be naturally applied to (H(X),ˉf1,∞).
Theorem 5.2. Suppose that the expansivity constant λn>1 does not converge to 1. If ˉf1,∞ is expansive under this condition, then ˉf1,∞ is also sensitive.
Proof. Suppose there exists a series of real constants {λn}∞n=1 where λn>1 for all n∈N, and that the map ˉf1,∞ is expansive in the context that for each pair of sets A and B that belong to H(X), and for all n∈N,
dH(ˉfn(A),ˉfn(B))≥λndH(A,B). |
To show sensitivity, let ϵ>0 and consider any set A∈H(X). Choose any set B∈H(X) such that the dH D(A,B)<ϵ. Given the expansivity condition, for any given η>0, one can find a suitable n0 such that
λ1∘λ2∘⋯∘λn0D(A,B)>η, |
ensuring that
dH(ˉfn01(A),ˉfn01(B))≥λ1∘λ2∘⋯∘λn0dH(A,B)>η, |
thereby proving that ˉf1,∞ is sensitive.
Topological conjugacy is crucial in dynamical systems analysis because it preserves key properties such as periodicity, chaoticity, and stability.
Definition 6.1. Let (X,d1) and (Y,d2) each be defined as a metric space. Consider sequences f1,∞ and g1,∞ of time-varying homeomorphisms on X and Y, respectively. f1,∞ and g1,∞ are called conjugate with respect to a homeomorphism T if there exists a homeomorphism T from X to Y such that
T∘fn=gn∘T |
for all n∈N.
Conjugation can naturally be expanded to include the context of set values.
Suppose f1,∞ and g1,∞ are sequences of mappings where ˉf1,∞:H(X)→H(X) and ˉg1,∞:H(Y)→H(Y).
The sequences are said to be conjugate with respect to a set-valued homeomorphism T, satisfying
T(ˉfn(A))=ˉgn(T(A)) |
for all A∈H(X) and for all n∈N.
Theorem 6.1. Suppose ˉf1,∞ and ˉg1,∞ are mappings on H(X) and H(Y), conjugate via T. If the function ˉf1,∞ exhibits expansivity, then the function ˉg1,∞ also exhibits expansivity, and vice versa.
Proof. Given that ˉf1,∞ and ˉg1,∞ are conjugate, a homeomorphism T can be found ensuring that T∘ˉfn=ˉgn∘T holds for every n∈N. This relationship further implies that the inverse T−1 satisfies T−1∘ˉgn=ˉfn∘T−1 for each n∈N, demonstrating the bijective nature of the conjugacy.
(Necessity) Assume the function ˉf1,∞ exhibits expansivity on the compact sets H(X), characterized by an expansive constant ϵ>0. Then for each pair of distinct sets A and B within H(X), an n∈N can be identified such that d1(ˉfn(A),ˉfn(B))>ϵ.
Given two distinct sets C,D∈H(Y), since T is a homeomorphism, then T−1(C) and T−1(D) are distinct sets in H(X). By the expansivity of ˉf1,∞, for some n∈N, it holds that
d1(ˉfn(T−1(C)),ˉfn(T−1(D)))>ϵ. |
According to the definition of conjugacy, for all n∈N, one has
ˉgn=TˉfnT−1. |
This implies that
d2(TˉfnT−1(C),TˉfnT−1(D))>ϵ. |
Since T is a bijective homeomorphism, applying T and T−1 to ˉfn(T−1(C)) and ˉfn(T−1(D)) in (Y,d2) yields
d2(ˉgn(C),ˉgn(D))=d2(TˉfnT−1(C),TˉfnT−1(D))>ϵ. |
This proves that ˉg1,∞ is expansive on H(Y).
(Sufficiency) Conversely, if ˉg1,∞ is expansive on H(Y), there exists ϵ>0 ensuring for distinct C,D∈H(Y), there is an n∈Z such that
d2(ˉgn(C),ˉgn(D))>ϵ. |
By the conjugacy definition,
ˉfn=T−1ˉgnT(∀n∈N), |
which implies
d1(T−1ˉgnT(A),T−1ˉgnT(B))>ϵ. |
Since T is a continuous bijection, applying T and T−1 to ˉgn(T(A)) and ˉgn(T(B)) in (X,d1), one can get
d1(ˉfn(A),ˉfn(B))=d1(T−1ˉgnT(A),T−1ˉgnT(B))>ϵ. |
Thus, the expansivity of ˉg1,∞ on Y ensures that of ˉf1,∞ on H(X).
Theorem 6.2. Let ˉf1,∞ and ˉg1,∞ be on H(X) and H(Y), conjugate via T. If ˉg1,∞ is sensitive to initial conditions, then so is ˉg1,∞, and vice versa.
Proof. We are given that ˉf1,∞ and ˉg1,∞ are conjugate via T, indicating ˉgn1=Tˉfn1T−1 for all n∈N.
(Necessity) Assume δ>0 for the sensitivity of ˉf1,∞ on H(X). For any A∈H(X) and any ϵ>0, one can find a set B∈H(X) such that dH1(A,B)<ϵ.
Given the uniform continuity of T, one can select ϵ′>0 sufficiently small enough such that dH2(T(A),T(B))<ϵ. For this pair A and B, it is possible to identify an n in N whereby
dH1(ˉfn1(A),ˉfn1(B))>δ. |
Applying the conjugacy mapping T, one has
dH2(T(ˉfn1(A)),T(ˉfn1(B)))=dH2(ˉgn1(T(A)),ˉgn1(T(B)))>δ, |
thus demonstrating that ˉg1,∞ also exhibits sensitivity.
(Sufficiency) Conversely, assume δ>0 for the sensitivity of ˉg1,∞ on H(Y). For any C∈H(Y) and any ϵ>0, one can find a set D∈H(Y) such that dH2(C,D)<ϵ.
Given the uniform continuity of T−1, one can choose ϵ′>0 small enough such that dH1(T−1(C),T−1(D))<ϵ. For this pair C and D, one can identify an n in N whereby
dH2(ˉgn1(C),ˉgn1(D))>δ. |
Applying the inverse conjugacy mapping T−1, one has
dH1(T−1(ˉgn1(C)),T−1(ˉgn1(D)))=dH1(ˉfn1(T−1(C)),ˉfn1(T−1(D)))>δ, |
thus demonstrating that ˉf1,∞ also exhibits sensitivity on H(X).
The conjugate invariance of sensitivity and expansivity in set-valued systems are proved above. Similarly, for the chaos properties mentioned, such as positive expansivity, n-expansivity, and ℵ0-expansivity, as well as multi-sensitivity and syndetic sensitivity, one can also demonstrate using the same method that these properties remain invariant under topological conjugacy. This demonstrates a fundamental characteristic of dynamical systems, showing that certain complex behaviors, when transformed through a topological conjugacy, preserve their intrinsic chaotic nature. This invariance under topological conjugacy is crucial for understanding the robustness and universality of chaotic dynamics across different mathematical models.
This study explores the expansive and sensitive properties of (ˉf1,∞,H(X)), detailing through comprehensive analysis how various forms of expansivity and sensitivity, from basic expansivity to complex concepts like ℵ0-expansivity and multi-sensitivity, fundamentally characterize the dynamical behavior and shed light on the underlying topological and dynamical complexities. Our investigations reveal the intricate relationship between expansivity and sensitivity in NDDSs, showing that under certain conditions, expansivity also implies sensitivity. Additionally, we extend the concept of topological conjugacy to (ˉf1,∞,H(X)), demonstrating that dynamical properties are preserved under topologically conjugate transformations.
J.Z.(Zhou): conceptualization, validation, writing original draft; T.L.(Lu): writing review and editing, supervision, funding acquisition; J. Z.(Zhao): formal analysis, investigation. All authors have read and approved the final version of the manuscript for publication.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work was supported by Sichuan Science and Technology Program (No. 2023NSFSC0070), the Scientific Research and Innovation Team Program of Sichuan University of Science and Engineering (No. SUSE652B002), and the Graduate Student Innovation Fundings (No. Y2024335).
The authors declare no conflicts of interest regarding the publication of this paper.
[1] | E. N. Lorenz, Deterministic nonperiodic flow, J. Atmos. Sci., 20 (1963), 130–141. https://doi.org/10.1175/1520-0469(1963)020<0130:DNF>2.0.CO;2 |
[2] | J. T. Sandefur, Discrete dynamical systems: theory and applications, United States: Clarendon Press, 1990. |
[3] |
X. Yang, T. Lu, A. Waseem, Chaotic properties of a class of coupled mapping lattice induced by fuzzy mapping in non-autonomous discrete systems, Chaos Soliton. Fract., 148 (2021), 110979. https://doi.org/10.1016/j.chaos.2021.110979 doi: 10.1016/j.chaos.2021.110979
![]() |
[4] |
H. Kato, Continuum-wise expansive homeomorphisms, Can. J. Math., 45 (1993), 576–598. https://doi.org/10.4153/CJM-1993-030-4 doi: 10.4153/CJM-1993-030-4
![]() |
[5] |
B. Carvalho, W. Cordeiro, N-expansive homeomorphisms with the shadowing property, J. Differ. Equ., 261 (2016), 3734–3755. https://doi.org/10.1016/j.jde.2016.06.003 doi: 10.1016/j.jde.2016.06.003
![]() |
[6] |
R. Vasisht, R. Das, Specification and shadowing properties for non-autonomous systems, J. Dyn. Control Syst., 28 (2022), 481–492. https://doi.org/10.1007/s10883-021-09535-4 doi: 10.1007/s10883-021-09535-4
![]() |
[7] |
A. Artigue, Dendritations of surfaces, Ergod. Theory Dyn. Syst., 38 (2018), 2860–2912. https://doi.org/10.1017/etds.2017.14 doi: 10.1017/etds.2017.14
![]() |
[8] |
R. Vasisht, R. Das, Generalizations of expansivity in non-autonomous discrete systems, Bull. Iran. Math. Soc., 48 (2022), 417–433. https://doi.org/10.1007/s41980-020-00525-z doi: 10.1007/s41980-020-00525-z
![]() |
[9] |
J. Li, R. Zhang, Levels of generalized expansivity, J. Dyn. Differ. Equat., 29 (2017), 877–894. https://doi.org/10.1007/s10884-015-9502-6 doi: 10.1007/s10884-015-9502-6
![]() |
[10] |
B. Carvalho, W. Cordeiro, N-expansive homeomorphisms with the shadowing property, J. Differ. Equations, 261 (2016), 3734–3755. https://doi.org/10.1016/j.jde.2016.06.003 doi: 10.1016/j.jde.2016.06.003
![]() |
[11] |
D. Richeson, J. Wiseman, Positively expansive dynamical systems, Topol. Appl., 154 (2007), 604–613. https://doi.org/10.1016/j.topol.2006.08.009 doi: 10.1016/j.topol.2006.08.009
![]() |
[12] |
B. Carvalho, W. Cordeiro, Positively N-expansive homeomorphisms and the L-shadowing property, J. Dyn. Differ. Equat., 31 (2019), 1005–1016. https://doi.org/10.1007/s10884-018-9698-3 doi: 10.1007/s10884-018-9698-3
![]() |
[13] |
J. Li, S. M. Tu, Density-equicontinuity and density-sensitivity, Acta Math. Sin.-English Ser., 37 (2021), 345–361. https://doi.org/10.1007/s10114-021-0211-2 doi: 10.1007/s10114-021-0211-2
![]() |
[14] |
J. Pi, T. Lu, Y. Chen, Collective sensitivity and collective accessibility of non-autonomous discrete dynamical systems, Fractal Fract., 6 (2022), 535. https://doi.org/10.3390/fractalfract6100535 doi: 10.3390/fractalfract6100535
![]() |
[15] |
E. H. Sandoval, F. Anstett-Collin, M. Basset, Sensitivity study of dynamic systems using polynomial chaos, Reliab. Eng. Syst. Safe., 104 (2012), 15–26. https://doi.org/10.1016/j.ress.2012.04.001 doi: 10.1016/j.ress.2012.04.001
![]() |
[16] |
D. Ruelle, Sensitive dependence on initial condition and turbulent behavior of dynamical systems, Ann. N.Y. Acad. Sci., 316 (1979), 408–416. https://doi.org/10.1111/j.1749-6632.1979.tb29485.x doi: 10.1111/j.1749-6632.1979.tb29485.x
![]() |
[17] |
A. Fedeli, Topologically sensitive dynamical systems, Topol. Appl., 248 (2018), 192–203. https://doi.org/10.1016/j.topol.2018.09.004 doi: 10.1016/j.topol.2018.09.004
![]() |
[18] |
E. Akin, S. Kolyada, Li–Yorke sensitivity, Nonlinearity, 16 (2003), 1421–1433. https://doi.org/10.1088/0951-7715/16/4/313 doi: 10.1088/0951-7715/16/4/313
![]() |
[19] |
H. Shao, Y. Shi, H. Zhu, Relationships among some chaotic properties of non-autonomous discrete dynamical systems, J. Differ. Equ. Appl., 24 (2018), 1055–1064. https://doi.org/10.1080/10236198.2018.1458101 doi: 10.1080/10236198.2018.1458101
![]() |
[20] |
Q. Huang, Y. Shi, L. Zhang, Sensitivity of non-autonomous discrete dynamical systems, Appl. Math. Lett., 39 (2015), 31–34. https://doi.org/10.1016/j.aml.2014.08.007 doi: 10.1016/j.aml.2014.08.007
![]() |
[21] |
H. Román-Flores, A note on transitivity in set-valued discrete systems, Chaos Soliton. Fract., 17 (2003), 99–104. https://doi.org/10.1016/S0960-0779(02)00406-X doi: 10.1016/S0960-0779(02)00406-X
![]() |
[22] |
J. Zhou, T. Lu, J. Zhao, Chaotic characteristics in Devaney's framework for set-valued discrete dynamical systems, Axioms, 13 (2023), 20. https://doi.org/10.3390/axioms13010020 doi: 10.3390/axioms13010020
![]() |
[23] |
R. Li, T. Lu, G. Chen, G. Liu, Some stronger forms of topological transitivity and sensitivity for a sequence of uniformly convergent continuous maps, J. Math. Anal. Appl., 494 (2021), 124443. https://doi.org/10.1016/j.jmaa.2020.124443 doi: 10.1016/j.jmaa.2020.124443
![]() |
[24] |
J. Pi, T. Lu, Y. Xue, Transitivity and shadowing properties of nonautonomous discrete dynamical systems, Int. J. Bifurcat. Chaos, 32 (2022), 2250246. https://doi.org/10.1142/S0218127422502467 doi: 10.1142/S0218127422502467
![]() |
[25] |
A. Peris, Set-valued discrete chaos, Chaos Soliton. Fract., 26 (2005), 19–23. https://doi.org/10.1016/j.chaos.2004.12.039 doi: 10.1016/j.chaos.2004.12.039
![]() |
[26] |
Y. Zhao, L. Wang, N. Wang, Devaney chaos of a set-valued map and its inverse limit, Chaos Soliton. Fract., 172 (2023), 113454. https://doi.org/10.1016/j.chaos.2023.113454 doi: 10.1016/j.chaos.2023.113454
![]() |
[27] |
H. Román-Flores, Y. Chalco-Cano, Robinson's chaos in set-valued discrete systems, Chaos Soliton. Fract., 25 (2005), 33–42. https://doi.org/10.1016/j.chaos.2004.11.006 doi: 10.1016/j.chaos.2004.11.006
![]() |
[28] |
R. Li, T. Lu, G. Chen, X. Yang, Further discussion on Kato's chaos in set-valued discrete systems, J. Appl. Anal. Comput., 10 (2020), 2491–2505. https://doi.org/10.11948/20190388 doi: 10.11948/20190388
![]() |
[29] |
H. Fu, Z. Xing, Mixing properties of set-valued maps on hyperspaces via Furstenberg families, Chaos Soliton. Fract., 45 (2012), 439–443. https://doi.org/10.1016/j.chaos.2012.01.003 doi: 10.1016/j.chaos.2012.01.003
![]() |
[30] |
X. Yang, Y. Jiang, T. Lu, Chaotic properties in the sense of Furstenberg families in set-valued discrete dynamical systems, Open J. Appl. Sci., 11 (2021), 343–353. https://doi.org/10.4236/ojapps.2021.113025 doi: 10.4236/ojapps.2021.113025
![]() |
[31] |
J. Li, C. Liu, S. Tu, T. Yu, Sequence entropy tuples and mean sensitive tuples, Ergod. Theory Dyn. Sys., 44 (2024), 184–203. https://doi.org/10.1017/etds.2023.5 doi: 10.1017/etds.2023.5
![]() |
[32] |
D. Kwietniak, P. Oprocha, Topological entropy and chaos for maps induced on hyperspaces, Chaos Soliton. Fract., 33 (2007), 76–86. https://doi.org/10.1016/j.chaos.2005.12.033 doi: 10.1016/j.chaos.2005.12.033
![]() |
[33] |
M. Lampart, P. Raith, Topological entropy for set valued maps, Nonlinear Anal., 73 (2010), 1533–1537. https://doi.org/10.1016/j.na.2010.04.054 doi: 10.1016/j.na.2010.04.054
![]() |
[34] |
X. Wang, Y. Zhang, Y. Zhu, On various entropies of set-valued maps, J. Math. Anal. Appl., 524 (2023), 127097. https://doi.org/10.1016/j.jmaa.2023.127097 doi: 10.1016/j.jmaa.2023.127097
![]() |