
This paper examines how properties such as shadowing properties, transitivity, and accessibility in non-autonomous discrete dynamical systems carry over to their product systems. The paper establishes a proof that the product system exhibits the pseudo-orbit shadowing property (PSP) if, and only if, both factor systems possess PSP. This relationship, which is both sufficient and necessary, also holds for the average shadowing property (ASP) and accessibility. Consequently, in practical problem scenarios, certain chaotic properties of two-dimensional systems can be simplified to those observed in one-dimensional systems. However, it should be noted that while the point-transitivity, transitivity, or mixing of the product system can be deduced from the factor systems, the reverse is not true. In particular, this paper constructs counterexamples to demonstrate that some of the theorems presented herein do not hold when considering their inverses.
Citation: Jingmin Pi, Tianxiu Lu, Jie Zhou. Shadowing properties and chaotic properties of non-autonomous product systems[J]. AIMS Mathematics, 2023, 8(9): 20048-20062. doi: 10.3934/math.20231021
[1] | Zhanjiang Ji . The research of $({\rm{G}}, {\rm{w}})$-Chaos and G-Lipschitz shadowing property. AIMS Mathematics, 2022, 7(6): 10180-10194. doi: 10.3934/math.2022566 |
[2] | Thiyam Thadoi Devi, Khundrakpam Binod Mangang, Sonika Akoijam, Lalhmangaihzuala, Phinao Ramwungzan, Jay Prakash Singh . Mean chain transitivity and almost mean shadowing property of iterated function systems. AIMS Mathematics, 2024, 9(8): 20811-20825. doi: 10.3934/math.20241012 |
[3] | 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 |
[4] | Ailing Ban . Asymptotic behavior of non-autonomous stochastic Boussinesq lattice system. AIMS Mathematics, 2025, 10(1): 839-857. doi: 10.3934/math.2025040 |
[5] | 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 |
[6] | Xiaobin Yao . Random attractors for non-autonomous stochastic plate equations with multiplicative noise and nonlinear damping. AIMS Mathematics, 2020, 5(3): 2577-2607. doi: 10.3934/math.2020169 |
[7] | 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 |
[8] | Xinyu Pan . Research on discrete differential solution methods for derivatives of chaotic systems. AIMS Mathematics, 2024, 9(12): 33995-34012. doi: 10.3934/math.20241621 |
[9] | Chunting Ji, Hui Liu, Jie Xin . Random attractors of the stochastic extended Brusselator system with a multiplicative noise. AIMS Mathematics, 2020, 5(4): 3584-3611. doi: 10.3934/math.2020233 |
[10] | Shamsa Kanwal, Saba Inam, Fahima Hajjej, Ala Saleh Alluhaidan . Securing air defense visual information with hyperchaotic Folded Towel Map-Based encryption. AIMS Mathematics, 2024, 9(11): 31217-31238. doi: 10.3934/math.20241505 |
This paper examines how properties such as shadowing properties, transitivity, and accessibility in non-autonomous discrete dynamical systems carry over to their product systems. The paper establishes a proof that the product system exhibits the pseudo-orbit shadowing property (PSP) if, and only if, both factor systems possess PSP. This relationship, which is both sufficient and necessary, also holds for the average shadowing property (ASP) and accessibility. Consequently, in practical problem scenarios, certain chaotic properties of two-dimensional systems can be simplified to those observed in one-dimensional systems. However, it should be noted that while the point-transitivity, transitivity, or mixing of the product system can be deduced from the factor systems, the reverse is not true. In particular, this paper constructs counterexamples to demonstrate that some of the theorems presented herein do not hold when considering their inverses.
Non-autonomous discrete dynamical systems (NDDSs), also known as time-varying parametric dynamical systems, are generated by a sequence of time-varying mapping iterations, which is an important part of the study of topological dynamical systems.
In 1996, Kolyada [1] first proposed the concept of NDDSs. Let N represent the set of positive integers, X denotes a compact metric Hausdorff space equipped with metric d. fn:X→X (n∈N) is a continuous mapping sequence, and denoted by f1,∞=(f1,f2,⋯)=(fn)∞n=1. This mapping sequence defines an NDDS (X,f1,∞). Under this sequence, the orbit of the point x∈X is Orbf1,∞(x)={x,f1(x),f2∘f1(x),⋯,fn1(x),⋯}(n∈N), where fn1=fn∘⋯∘f2∘f1. Likewise, fkn=fn+k−1∘⋯∘fn+1∘fn(n,k∈N). Additionally, f01 represents the identity mapping. If fi=fj(i,j∈N:i≠j), (X,f1,∞) is referred to as an autonomous discrete dynamical systems (ADDSs).
Compared to the ADDSs, the NDDSs offer greater flexibility and convenience in describing various dynamic behaviors of a system. ADDSs may struggle to capture the complexity of problems in signal processing, biology, and physics, whereas NDDSs prove to be effective in their description. Obviously, the NDDSs are natural extensions of the ADDSs, which can solve more complex practical problems. However, the dynamic behavior of NDDSs is much more complex than that of ADDSs. In fact, there has been significant research on the chaotic behavior of mappings in ADDSs, yielding substantial results. The chaoticity of NDDSs has gradually become a hot research direction of many scholars in recent years.
In 2006, Tian [2] investigated Devaney chaos in NDDSs. In 2009, Shi [3] introduced the concept of several types of chaotic properties in NDDSs, such as transitivity, sensitivity, Li-Yorke chaos, etc. In 2011, Cˊanovas [4] discussed the dynamic characteristics between topological entropy and Li-Yorke chaos on NDDSs. In 2012, Balibrea [5] examined the connection between topological entropy and weak mixing on NDDSs. Song [6] discussed the Ruelle-Takens chaotic properties of non-autonomous product dynamical systems. In 2013, Wu [7] proved that Li-Yorke sensitivity and sensitivity of sequences with the form f1,∞ are inherited under iterations. In 2015, Huang [8] extended some results of sensitivity or strong sensitivity from ADDSs to NDDSs. In 2018, Ma [9] studied the relations of sensitivity and transitivity between iterative function systems and their product systems. In 2020, Li [10] studied stronger forms of transitivity and sensitivity for NDDSs by using Furstenberg family. In 2022, Anwar [11] studied the relations of some sensitivity between iterative function systems and their product systems. Additionally, we studied the relations of some sensitivity between NDDSs and their product systems (see [12]). Some other research about chaotic properties of NDDSs are [13,14,15,16] and others.
In [17], we proved that under a specific metric, the product system having the P-property is equivalent to its factor systems also having the property of P-property, where P-property represents one of the following five properties: ¯d shadowing property, d_ shadowing property, F-shadowing property, and ergodic shadowing property. Naturally, two questions arise: first, whether the conclusion still holds for other properties, and second, whether the conclusion still holds if other metrics are used. This paper will explore these two questions.
This paper aims to examine the relationship between accessibility, transitivity, or shadowing properties of product systems and their corresponding factor systems in NDDSs.
Let f1,∞=(fn)∞n=1, g1,∞=(gn)∞n=1 be two continuous mapping sequences on compact metric spaces (X,d1) and (Y,d2), respectively. Define f1,∞×g1,∞ on X×Y as follow
(fn1×gn1)((x,y))=(fn×gn)∘⋯∘(f1×g1)(x,y)=(fn1(x),gn1(y)), |
for any (x,y)∈X×Y, n∈N. For any (x1,y1),(x2,y2)∈X×Y, define
D((x1,y1),(x2,y2))=√d21(x1,x2)+d22(y1,y2) |
is the metric on X×Y. (X×Y,D,f1,∞×g1,∞) is called the product system of (X,d1,f1,∞) and (Y,d2,g1,∞).
Let D1 and D2 be the metric on X×Y. D1 and D2 are equivalent metrics if and only if there exist b≥a>0 such that
aD1((x1,y1),(x2,y2))≤D2((x1,y1),(x2,y2))≤bD1((x1,y1),(x2,y2)) |
for any (x1,y1),(x2,y2)∈X×Y.[18]
Example 2.1. Let
D1((x1,y1),(x2,y2))=d1(x1,x2)+d2(y1,y2), |
D2((x1,y1),(x2,y2))=max{d1(x1,x2)+d2(y1,y2)}, |
for any (x1,y1),(x2,y2)∈X×Y. It is easy to get that, D1 and D2 are equivalent metric of D.
Definition 2.1. [3,19,20] Let f1,∞ be a continuous mapping sequences on X. f1,∞ or the NDDS (X,d,f1,∞)) is considered to be
(1) transitive if for any two nonempty open sets U and V in X, there exists an n∈N such that
fn1(U)∩V≠∅; |
(2) point-transitive if there is an x∈X such that ¯orbf1,∞(x)=X;
(3) accessible if for any ε>0 and two nonempty open sets U,V⊂X, there exists an n∈N and points x∈U,y∈V such that d(fn1(x),fn1(y))<ε;
(4) mixing if for any two nonempty open subsets U,V⊂X, there exists an N∈N such that the set Nf1,∞(U,V)={n∈N:fn1(U)∩V≠∅} contains any natural number n≥N.
Definition 2.2. [21,22] Let δ>0 and {xi}+∞i=0⊂X.
(1) The sequence {xi}+∞i=0⊂X is a δ pseudo-orbit of f1,∞, if d(fi+1(xi),xi+1)<δ for any i∈N0={0,1,2,⋯};
(2) The sequence {xi}+∞i=0⊂X is a δ average pseudo-orbit of f1,∞, if there exists an N∈N such that
1nn−1∑i=0d(fi+k+1(xi+k),xi+k+1)<δ |
for any k∈N0, n≥N.
Definition 2.3. [20,21] Let f1,∞ be continuous mapping sequences on X.
(1) The system (X,d,f1,∞) has pseudo-orbit shadowing property (PSP) if for any ε>0, there is a δ>0, for every δ pseudo-orbit {xi}+∞i=0 of (X,f1,∞), there exists a z∈X such that d(fi1(z),xi)<ε for any i∈N0;
(2) The system (X,d,f1,∞) has average shadowing property (ASP) if for any ε>0, there is a δ>0, for each δ average pseudo-orbits {xi}+∞i=0 of f1,∞, there exists a z∈X such that
lim supn→+∞1nn−1∑i=0d(fi1(z),xi)<ε. |
Theorem 3.1. (X×Y,ρ,f1,∞×g1,∞) has PSP if and only if (X,d1,f1,∞) and (Y,d2,g1,∞) have PSP, where ρ is any equivalent metric of D.
Proof. Since measure ρ be an equivalent measure of measure D, there exist c2≥c1>0 such that
c1⋅ρ((x1,y1),(x2,y2))≤D((x1,y1),(x2,y2))≤c2⋅ρ((x1,y1),(x2,y2)) |
for any (x1,y1),(x2,y2)∈X×Y.
(Necessity) Assume that (X×Y,ρ,f1,∞×g1,∞) has PSP. Then for any ε>0 such that every δ∗(δ∗>0) pseudo-orbit {(a∗i,b∗i)}+∞i=0 of (X×Y,f1,∞×g1,∞), there is a (a,b)∈X×Y satisfying that
ρ(fi1×gi1(a,b),(a∗i,b∗i))<ε |
for any i∈N0.
Claim: There exist {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y, for any ε>0 such that {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y are ε pseudo-orbit of (X,d1,f1,∞) and (Y,d2,g1,∞), respectively.
Proof of claim. In fact, for any a∈X, b∈Y, and δ>0, take a0=a,a1=f1(a),a2=f21(a),⋯; b0=b,b1=g1(b),b2=g21(b),⋯. Obviously, d1(fi+1(ai),ai+1)=0<ε and d2(gi+1(bi),bi+1)=0<ε for any i∈N0. So, {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y are ε pseudo-orbit of (X,d1,f1,∞) and (Y,d2,g1,∞), respectively.
Take δ=√2c12δ∗, let {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y be the δ pseudo-orbit of (X,d1,f1,∞) and (Y,d2,g1,∞), respectively. Then,
d1(fi+1(ai),ai+1)<δandd2(gi+1(bi),bi+1)<δ |
for any i∈N0. Then,
ρ(fi+1×gi+1(ai,bi),(ai+1,bi+1))≤1c1D(fi+1×gi+1(ai,bi),(ai+1,bi+1))=1c1√d21(fi+1(ai),ai+1)+d22(gi+1(bi),bi+1)<√2c1δ=δ∗, |
for any i∈N0. This means that {(ai,bi)}+∞i=0⊂X×Y is the δ∗ pseudo-orbit of (X×Y,ρ,f1,∞×g1,∞). So,
1c2D(fi1×gi1(a,b),(ai,bi))≤ρ(fi1×gi1(a,b),(ai,bi))<ε. |
It is evident that
d1(fi1(a),ai)<c2εandd2(gi1(b),bi)<c2ε. |
Thus, (X,d1,f1,∞) and (Y,d2,g1,∞) have PSP.
(Sufficiency) Assume that f1,∞ and g1,∞ have PSP, then for any ε>0, there is a δ1>0 such that every δ1 pseudo-orbit {a∗i}+∞i=0 of (X,d1,f1,∞), there is a a∈X satisfying that d1(fi1(a),a∗i)<ε; there is a δ2>0 such that every δ2 pseudo-orbit {b∗i}+∞i=0 of (Y,d2,g1,∞), there is a b∈Y conforming that d2(gi1(b),b∗i)<ε.
Let {(ai,bi)}+∞i=0⊂X×Y be the δ pseudo-orbit of (X×Y,ρ,f1,∞×g1,∞), where δ=1c2min{δ1,δ2}. Then for any i∈N0, it is obvious that
ρ(fi+1×gi+1(ai,bi),(ai+1,bi+1))<δ. |
Then
D(fi+1×gi+1(ai,bi),(ai+1,bi+1))≤c2ρ(fi+1×gi+1(ai,bi),(ai+1,bi+1))<c2δ. |
Subsequently,
d1(fn1(ai),ai+1)<c2δandd2(gn1(bi),bi+1)<c2δ. |
So, {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y are the δ∗(δ∗=c2δ) pseudo-orbit of f1,∞ and g1,∞, respectively. According to the PSP of (X,d1,f1,∞) and (Y,d2,g1,∞), then for any ε>0 and i∈N0 there exists a∈X,B∈Y, such that
d1(fi1(a),ai)<εandd2(gi1(b),bi)<ε. |
Then,
ρ(fi1×gi1(a,b),(ai,bi))≤1c1D(fi1×gi1(a,b),(ai,bi))=1c1√d21(fi1(a),ai)+d22(gi1(b),bi)<√2c1ε, |
for any i∈N0. Therefore, (X×Y,ρ,f1,∞×g1,∞) has PSP.
This complete the proof.
An illustratable example is provided below to demonstrate Theorem 3.1.
Example 3.1. Let X=[0,1]. The metric d is denoted by d(a,b)=|a−b| (∀a,b∈X). Three mappings g1(x), g2(x), and g3(x) are defined by g1(x)=√1−4(x−12)2 for x∈X, g2(x)=−4x2+4x for x∈X, and g3(x)=0 for x∈X. Let (hn)∞n=1={g1,g3,g1,g3,⋯}, (ℓn)∞n=1={g2,g3,g2,g3,⋯}.
For any x∈X, ε>0, take δ=ε3. Let
x1=max{h1(x)−ε3,0},x2=min{h1(x)+ε3,1};y1=max{ℓ1(x)−ε3,0},y2=min{ℓ1(x)+ε3,1}. |
and
a0=x,a1∈(x1,x2),a2∈[0,ε3),a3∈[0,ε3),⋯;b0=x,b1∈(y1,y2),b2∈[0,ε3),b3∈[0,ε3),⋯. |
Obviously,
d(hi+1(ai),ai+1)<δ=ε3andd(ℓi+1(bi),bi+1)<δ=ε3 |
for any i∈N. So, {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y are the δ pseudo-orbits of h1,∞ and ℓ1,∞, respectively. Since
d(hi1(x),ai)<εandd(ℓi1(x),bi)<ε |
for any i∈N. Thus, (X,d,h1,∞) and (X,d,ℓ1,∞) have PSP.
In view of
D((hi+1×ℓi+1)(ai,bi),(ai+1,bi+1))=√d2(hi+1(ai),ai+1)+d2(ℓi+1(bi),bi+1)<√2δ |
for any i∈N, then {(ai,bi)}+∞i=0⊂X×Y is a δ∗ pseudo-orbit of f1,∞×g1,∞, where δ∗=√2δ. Due to
D((fi1×gi1)(a,b),(ai,bi))=√d2(fi1(a),ai)+d2(gi1(b),bi)<√2ε |
for any i∈N0. This indicates that (X×X,D,f1,∞×g1,∞) has PSP.
Theorem 3.2. (X×Y,ρ,f1,∞×g1,∞) has ASP if and only if (X,d1,f1,∞) and (Y,d2,g1,∞) have ASP.
Proof. (Necessity) Since ρ is an equivalent metric of D, there exist c2≥c1>0 such that
c1⋅ρ((x1,y1),(x2,y2))≤D((x1,y1),(x2,y2))≤c2⋅ρ((x1,y1),(x2,y2)) |
for any (x1,y1),(x2,y2)∈X×Y.
Assume that (X×Y,ρ,f1,∞×g1,∞) has ASP, then, for any ε>0 and every δ∗ average pseudo-orbit {(a∗i,b∗i)}+∞i=0 of (X×Y,f1,∞×g1,∞), there exists a (a,b)∈X×Y such that
lim supn→+∞1nn−1∑i=0ρ(fi1×gi1(a,b),(a∗i,b∗i))<ε. |
Take δ=c12δ∗. Let {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y be δ average pseudo-orbits of f1,∞ and g1,∞, respectively. Then there exist m1,m2∈N such that
1n1n1−1∑i=0d1(fi+k+1(ai+k),ai+k+1)<δand1n2n2−1∑i=0d2(gi+k+1(bi+k),bi+k+1)<δ |
for any n1≥m1,n2≥m2, and k∈N0. Then,
1nn−1∑i=0ρ(fi+k+1×gi+k+1(ai+k,bi+k),(ai+k+1,bi+k+1))≤1c1nn−1∑i=0D(fi+k+1×gi+k+1(ai+k,bi+k),(ai+k+1,bi+k+1))=1c1nn−1∑i=0√d21(fi+k+1(ai+k),ai+k+1)+d22(gi+k+1(bi+k),bi+k+1)≤1c1nn−1∑i=0(d1(fi+k+1(ai+k),ai+k+1)+d2(gi+k+1(bi+k),bi+k+1))=1c1nn−1∑i=0d1(fi+k+1(ai+k),ai+k+1)+1c1nn−1∑i=0d2(gi+k+1(bi+k),bi+k+1)<2c1δ=δ∗, |
for any n>m=max{m1,m2}. Therefore, {(ai,bi)}+∞i=0⊂X×Y is a δ∗ average pseudo-orbit of f1,∞×g1,∞. Since f1,∞×g1,∞ has ASP, then, for any ε>0 and the δ∗ average pseudo-orbit {(ai,bi)}+∞i=0 of (X×Y,f1,∞×g1,∞), there exists a (a,b)∈X×Y such that
1c2lim supn→+∞1nn−1∑i=0D((fi1×gi1)(a,b),(ai,bi))≤lim supn→+∞1nn−1∑i=0ρ(fi1×gi1(a,b),(ai,bi))<ε. |
In consequence,
lim supn→+∞1nn−1∑i=0d1(fi1(a),ai)<c2εandlim supn→+∞1nn−1∑i=0d2(gi1(b),bi)<c2ε. |
Thus, (X,d1,f1,∞) and (Y,d2,g1,∞) have ASP.
(Sufficiency) Since (X,d1,f1,∞) and (Y,d2,g1,∞) have ASP, then for any ε>0, there exist δ1>0 and δ2>0 such that, for every δ1 average pseudo-orbit {a∗i}+∞i=0 of (X,f1,∞) and every δ2 average pseudo-orbit {b∗i}+∞i=0 of (Y,g1,∞), one can select a∈X,b∈Y satisfying
lim supn→+∞1nn−1∑i=0d1(fi1(a),a∗i)<εandlim supn→+∞1nn−1∑i=0d2(gi1(b),b∗i)<ε. |
Take δ=1c2min{δ1,δ2}. Let {(ai,bi)}+∞i=0⊂X×Y be a δ average pseudo-orbit of f1,∞×g1,∞. Then there exists an m∈N such that
1c2nn−1∑i=0D((fi+k+1×gi+k+1)(ai+k,bi+k),(ai+k+1,bi+k+1))≤1nn−1∑i=0ρ((fi+k+1×gi+k+1)(ai+k,bi+k),(ai+k+1,bi+k+1))<δ, |
for any n≥m and any k∈N0. This means that
1nn−1∑i=0d1(fi+k+1(ai+k),ai+k+1)<c2δand1nn−1∑i=0d2(gi+k+1(bi+k),bi+k+1)<c2δ. |
So, {ai}+∞i=0⊂X, {bi}+∞i=0⊂Y are the δ∗ average pseudo-orbits of f1,∞ and g1,∞, respectively, where δ∗=c2δ.
By the ASP of (X,d1,f1,∞) and (Y,d2,g1,∞), for any ε>0 and i∈N0, there exist a∈X,b∈Y such that
lim supn→+∞1nn−1∑i=0d1(fi1(a),ai)<εandlim supn→+∞1nn−1∑i=0d2(gi1(b),bi)<ε. |
Then,
lim supn→+∞1nn−1∑i=0ρ((fi1×gi1)(a,b),(ai,bi))≤1c1lim supn→+∞1nn−1∑i=0D((fi1×gi1)(a,b),(ai,bi))=1c1lim supn→+∞1nn−1∑i=0√d21(fi1(a),ai)+d22(gi1(b),bi)=1c1lim supn→+∞1nn−1∑i=0(d1(fi1(a),ai)+d2(gi1(b),bi))<2c1ε. |
Therefore, (X×Y,ρ,f1,∞×g1,∞) has ASP.
This complete the proof.
In 2022, [15] proved that some shadowing properties are sufficient conditions for being transitive or point-transitive for a NDDSs. Next, we will discuss the relations of point-transitivity between product systems and teir factor systems.
Theorem 3.3. If (X×Y,ρ,f1,∞×g1,∞) is point-transitive (resp. transitive, mixing), then (X,d1,f1,∞) and (Y,d2,g1,∞) are point-transitive (resp. transitive, mixing).
Proof. (1) Assume that (X×Y,ρ,f1,∞×g1,∞) is point-transitive. Then there is a (a,b)∈X×Y such that ¯orbf1,∞×g1,∞(a,b)=X×Y. That is, ¯{(a,b),(f1(a),g1(b)),⋯,(fn1(a),gn1(b)),⋯}=X×Y. Obviously,
¯orbf1,∞(a)=Xand¯orbg1,∞(b)=Y. |
Thus (X,d1,f1,∞) and (Y,d2,g1,∞) are point-transitive.
(2) Assume that (X×Y,ρ,f1,∞×g1,∞) is transitive. Then for any two nonempty open sets U1×V1 and U2×V2 in X×Y, there exists an n∈N such that (fn1×gn1)(U1×V1)∩(U2×V2)≠∅. To elaborate, there is a (a1,b1)∈U1×V1 such that (fn1×gn1)(a1×b1)=(fn1(a1),gn1(b1))∈U2×V2. Then,
fn1(a1)∈U2andgn1(b1)∈V2. |
So,
fn1(U1)∩U2≠∅andgn1(V1)∩V2≠∅. |
By the arbitrariness of Ui,Vi(i=1,2), (X,d1,f1,∞) and (Y,d2,g1,∞) are transitive.
(3) The proof of mixing is omitted as it follows a similar line of reasoning as that of transitivity.
This complete the proof.
The inverse of Theorem 3.3 may not hold in all cases. This illustrated through Examples 3.2 and 3.3.
Example 3.2. Let X=[0,1], the set of all rational numbers in X is denoted by {a1,a2,a3,⋯}. For any x∈[0,1], let f1(x)=a1,f2(x)=a2,⋯fn(x)=an,⋯. For f1,∞=(fn)∞n=1={f1,f2,f3,⋯}, it is obvious that ¯orbf1,∞(a)=X for any a∈X. So, (X,d,f1,∞) is point-transitive.
However, for any a,b∈X, (fn1×fn1)(a,b)=(ai,ai)(i∈N). Then, ¯orbf1,∞×f1,∞(a,b)≠X×X. So, (X×X,D,f1,∞×f1,∞) is not point-transitive.
Example 3.3. Let X=[0,1]. Two mappings ϕ(x), ω(x) be defined by ϕ(x)=x for any x∈[0,1] and
ω(x)={2x+12forx∈[0,14];−2x+32forx∈[14,12];−x+1forx∈[12,1]. |
Let (gn)∞n=1={ω,ϕ,ω,ϕ,ω,ϕ,⋯}.
The function images of g21, g31, g41, and g51 are given in Figure 1, and the image of gn1(n>5) can be inferred.
Figure 1 shows that, for any nonempty open set U∈X, there are large enough m1,m2∈N such that gm11(U)⊃(0,12), gm21(U)⊃(12,1). Then, for any nonempty open set V∈X, there is an n∈N such that fn1(U)∩V≠∅. So, (X,d,g1,∞) is transitive.
Take U1=U2=(0,12),V1=(18,14),V2=(58,78). Then (gn1×gn1)(U1×U2)⊂[(0,12)×(0,12)]∪[(12,1)×(12,1)] for any n∈N. However, (gn1×gn1)(U1×U2)∩(V1×V2)=∅. Thus (X×X,D,g1,∞×g1,∞) is not transitive.
Now, accessibility will be discussed by us.
Theorem 3.4. If (X,d,f1,∞) is mixing, then (X,d,f1,∞) is accessible.
Proof. Let any two nonempty open sets U1 and U2 be in X. For any ε>0, there is a V⊂X such that diam(V)<ε. Due to (X,d,f1,∞) is mixing, then there is an N1>0 such that fn1(U1)∩V≠∅ for all n≥N1, and there is an N2>0 such that fn1(U2)∩V≠∅ for all n≥N2.
Take N=max{N1,N2}, then, for U1, U2, and V in X, fn1(U1)∩V≠∅ and fn1(U2)∩V≠∅ for all n≥N. Then, there exist a∈U1,b∈U2 such that fn1(a)∈V and fn1(b)∈V. Since diam(V)<ε, then, d(fn1(a),fn1(b))<ε. So, (X,d,f1,∞) is accessible.
This complete the proof.
The inverse of Theorem 3.4 is not necessarily held. This is illustrated through an counterexample.
Example 3.4. Let X=[0,1],
f1(x)={2xforx∈[0,12];−2x+2forx∈[12,1], |
f2(x)={xforx∈[0,12];−x+1forx∈[12,1], |
f3(x)={12xforx∈[0,12];−12x+12forx∈[12,1], |
f4(x)={14xforx∈[0,12];−14x+14forx∈[12,1], |
⋅⋅⋅ |
fn(x)={12n−2xforx∈[0,12];−12n−2x+12n−2forx∈[12,1], |
⋅⋅⋅ |
Let (fn)∞n=1={f1,f2,⋯,fn,⋯}.
The function images of f21, f31, f41, and f51 are given in Figure 2, and the image of fn1(n>5) can be inferred.
Figure 2 shows that, fn1(U)→{0}(n→∞) for any U∈X. For any ε>0 and any a,b∈X, there is an m1∈N such that d(fn1(a),fn1(b))<ε for any n>m1. So, (X,d,f1,∞) is accessible.
Take V=[12,1], for any U∈X, there is an m2∈N such that fn1(U)∩V=∅ for any n>m2. Thus (X,d,f1,∞) is not mixing.
Theorem 3.5. (X×Y,ρ,f1,∞×g1,∞) is accessible if and only if (X,d1,f1,∞) and (Y,d2,g1,∞) are accessible.
Proof. Since metric ρ is an equivalent metric of metric D, there exist b≥a>0 such that
aρ(x1,y1),(x2,y2)≤D(x1,y1),(x2,y2)≤bρ(x1,y1),(x2,y2) |
for any (x1,y1),(x2,y2)∈X×Y.
(Necessity) Assume that (X×Y,ρ,f1,∞×g1,∞) is accessible. Then, for any ε>0 and two nonempty open sets U1×V1,U2×V2∈X×Y, there exist points (a1,b1)∈U1×V1,(a2,b2)∈U2×V2, and n∈N such that
ρ((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))=ρ((fn1(a1),gn1(b1)),(fn1(a2),gn1(b2)))<1bε. |
Then,
√d21(fn1(a1),fn1(a2))+d22(gn1(b1),gn1(b2))=D((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))≤bρ((fn1(a1),gn1(b1)),(fn1(a2),gn1(b2)))<ε. |
This means that d1(fn1(a1),fn1(a2)) and d2(gn1(b1),gn1(b2)) are less than ε. So, (X,d1,f1,∞) and (Y,d2,g1,∞) are accessible.
(Sufficiency) By contradiction, if (X×Y,ρ,f1,∞×g1,∞) is not accessible, then there exist a ε0>0 and two nonempty open sets U1×V1,U2×V2∈X×Y, for any n∈N and points (a1,b1)∈U1×V1,(a2,b2)∈U2×V2, it is obvious that
ρ((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))>ε0. |
Then,
√d21(fn1(a1),fn1(a2))+d22(gn1(b1),gn1(b2))=D((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))≥aρ((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))>aε0. |
This means that at least one of d1(fn1(a1),fn1(a2)) and d2(gn1(b1),gn1(b2)) has to be greater than √22aε0. To be more specific, at least one of (X,d1,f1,∞) and (Y,d2,g1,∞) is not accessible. Contradict to that (X,d1,f1,∞) and (Y,d2,g1,∞) are accessible. So, (X×Y,ρ,f1,∞×g1,∞) is accessible.
This complete the proof.
The following example demonstrates that, if only one of the (X,d1,f1,∞) and (Y,d2,g1,∞) is accessible, there is not necessarily follow that (X×X,ρ,f1,∞×g1,∞) is accessible.
Example 3.5. Let X=[0,1], two mappings h1(x), h2(x) be defined by h1(x)=1,h2(x)=x for x∈X. Let (fn)∞n=1={h1,h1,h1,⋯}, (gn)∞n=1={h2,h2,h2,⋯}.
Obviously, d(fn1(x1),fn1(x2))=0 for any n∈N and x1,x2∈X. So, (X,d,f1,∞) is accessible. Let U=(0,18),V=(78,1), then for any x1∈U,y1∈V, d(gn1(x1),gn1(y1))>34. Thus, (X,d,g1,∞) is not accessible. For U×U,V×V∈X×X, any (x1,x2)∈U×U,(y1,y2)∈V×V, it is obvious that
D((fn1×gn1)(x1,x2),(fn1×gn1)(y1,y2)=√d2(fn1(x1),fn1(y1))+d2(gn1(x2),gn1(y2))>34. |
Therefore, (X×X,D,f1,∞×g1,∞) is not accessible.
Theorem 3.6. Let fn(n∈N) be surjections. If the system (X,d,f1,∞) is accessible, then, for any n∈N, the system (X,d,fn,∞=(fn,fn+1,⋯)) is accessible.
Proof. To illustrate this point, it is sufficient to consider the case when n=2.
For any two nonempty open subsets U,V⊂X, taking an inverse image of each element in U and V under f1, one can get two sets U∗ and V∗ in X, separately. Since f1 is continuous surjective, then U∗ and V∗ are also nonempty open subsets of X. Due to f1,∞ is accessible, then for any ε>0, there exist points a∗∈U∗,b∗∈V∗ and n∈N such that d(fn+11(a∗),fn+11(b∗))<ε.
Given that there exist a∈U,b∈V such that f1(a∗)=a,f1(b∗)=b, then d(fn2(a),fn2(b))=d(fn+11(a∗),fn+11(b∗))<ε. So, (X,d,f2,∞) is accessible.
This complete the proof.
Theorem 3.7. Let fn(n∈N) and gn(n∈N) be surjections. If (X×Y,ρ,f1,∞×g1,∞) is accessible, then (X,d1,fn,∞) and (Y,d2,gn,∞) is accessible for any n∈N.
Proof. The result is evident by applying Theorems 3.5 and 3.6.
This complete the proof.
An appropriate example that aligns with Theorem 3.7 is presented below.
Example 3.6. Let X=[0,1]. Two mappings φ(x), ψ(x) be defined by
φ(x)={3xforx∈[0,13];−3x+2forx∈[13,23];3x−2forx∈[23,1]andψ(x)={6xforx∈[0,16];−6x+2forx∈[16,13];6x−2forx∈[13,12];−6x+4forx∈[12,23];6x−4forx∈[23,56];−6x+6forx∈[56,1]. |
Let (fn)∞n=1={φ,φ,φ,⋯}, (gn)∞n=1={ψ,ψ,ψ,⋯}.
Obviously, φ(x) and ψ(x) are triangle-tent map. Then there must exist large enough n1,n2∈N such that fn11(U)=X and gn21(U)=X for any nonempty open set U∈X. Take n=max{n1,n2}, then fn1(U)∩fn1(V)≠∅ for any nonempty open set V∈X. So, there exist points x∈U,y∈V such that d(fn1(x),fn1(y))=0. Thus, (X,d,f1,∞) and (X,d,g1,∞) are accessible.
For any two nonempty open sets U1×V1 and U2×V2 in X×X, there exists an n∈N such that (fn1×gn1)(U1×V1)=X×X. Then, (fn1×gn1)(U1×V1)∩(fn1×gn1)(U2×V2)≠∅. So, there exist points (a1,b1)∈U1×V1,(a2,b2)∈U2×V2 such that D((fn1×gn1)(a1,b1),(fn1×gn1)(a2,b2))=0 for any metric ρ of X×X. Therefore, (X×X,D,f1,∞×g1,∞) is accessible.
Corolary 3.1. If (X×Y,ρ,f1,∞×g1,∞) is mixing, then (X,d1,f1,∞) and (Y,d2,g1,∞) are accessible.
Transitivity, mixing, and accessibility are chaotic properties related to Devaney chaos. They represent a kind of ergodic state of discrete dynamical systems. While shadowing properties are often used in computer simulation. The orbit obtained by numerical calculation approximately reflects the local dynamic behavior of the system. The premise is that the difference between each iteration point and the real orbit is small enough. This paper discusses the relationship between the above properties of non-autonomous product systems and that of corresponding factor systems. The results tell us that in practical problems, the method of decreasing (or increasing) dimension is feasible. The reasons for the infeasibility are explained by counterexamples. In the future, we can combine more specific applications in physics, electronic information, or computer technology to study the chaotic properties of high-dimensional systems or low-dimensional systems.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
This work was supported by Natural Science Foundation of Sichuan Province (No. 2023NSFSC0070), the Scientific Research Project of SUSE (No. 2020RC24), and the Graduate student Innovation Fund (No. y2022189).
The authors declare no conflicts of interest regarding the publication of this paper.
[1] | S. Kolyada, L. Snoha, Topological entropy of nonautonomous dynamical systems, Random Comput. Dynam., 4 (1996), 205–233. |
[2] |
C. J. Tian, G. R. Chen, Chaos of a sequence of maps in a metric space, Chaos Solitons Fractals, 28 (2006), 1067–1075. https://doi.org/10.1016/j.chaos.2005.08.127 doi: 10.1016/j.chaos.2005.08.127
![]() |
[3] |
Y. M. Shi, G. R. Chen, Chaos of time-varying discrete dynamical systems, J. Differ. Equ. Appl., 15 (2009), 429–449. https://doi.org/10.1080/10236190802020879 doi: 10.1080/10236190802020879
![]() |
[4] |
J. S. Cˊanovas, Li-Yorke chaos in a class of non-autonomous discrete systems, J. Differ. Equ. Appl., 17 (2011), 479–486. https://doi.org/10.1080/10236190903049025 doi: 10.1080/10236190903049025
![]() |
[5] |
F. BallBrea, P. Oprocha, Weak mixing and chaos in non-autonomous discrete systems, Appl. Math. Lett., 25 (2012), 1135–1141. https://doi.org/10.1016/j.aml.2012.02.021 doi: 10.1016/j.aml.2012.02.021
![]() |
[6] | X. Q. Song, J. K. Liu, L. W. Wang, Ruelle-Takens chaos in non-autonomous dynamical systems, Eng. Math. Lett., 1 (2012), 65–74. |
[7] |
X. X. Wu, P. Y. Zhu, Chaos in a class of non-autonomous discrete systems, Appl. Math. Lett., 26 (2013), 431–436. https://doi.org/10.1016/j.aml.2012.11.003 doi: 10.1016/j.aml.2012.11.003
![]() |
[8] |
Q. L. Huang, Y. M. Shi, L. J. 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
![]() |
[9] |
C. N. Ma, P. Y. Zhu, A remark on sensitivity and Li-Yorke sensitivity of iterated function systems, Qual. Theor. Dyn. Syst., 18 (2019), 1–9. https://doi.org/10.1007/s12346-018-0270-7 doi: 10.1007/s12346-018-0270-7
![]() |
[10] |
R. S. Li, Y. Zhao, H. Q. Wang, H. H. Liang, Stronger forms of transitivity and sensitivity for nonautonomous discrete dynamical systems and Furstenberg families, J. Dyn. Control Syst., 26 (2020), 109–126. https://doi.org/10.1007/s10883-019-09437-6 doi: 10.1007/s10883-019-09437-6
![]() |
[11] |
W. Anwar, T. X. Lu, X. F. Yang, Sensitivity of iterated function systems under the product operation, Results Math., 77 (2022), 185. https://doi.org/10.1007/s00025-022-01669-6 doi: 10.1007/s00025-022-01669-6
![]() |
[12] |
J. M. Pi, T. X. Lu, Y. L. 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
![]() |
[13] |
Y. M. Shi, Chaos in non-autonomous discrete dynamical systems approached by their induced systems, Internat. J. Bifur. Chaos, 22 (2012), 1250284. https://doi.org/10.1142/S0218127412502847 doi: 10.1142/S0218127412502847
![]() |
[14] |
H. Shao, Y. M. Shi, H. Zhu, On distributional chaos in non-autonomous discrete systems, Chaos Solitons Fractals, 107 (2018), 234–243. https://doi.org/10.1016/j.chaos.2018.01.005 doi: 10.1016/j.chaos.2018.01.005
![]() |
[15] |
J. M. Pi, T. X. Lu, Y. F. Xue, Transitivity and shadowing properties of non-autonomous discrete dynamical systems, Int. J. Bifurcat. Chaos, 32 (2022), 2250246. https://doi.org/10.1142/S0218127422502467 doi: 10.1142/S0218127422502467
![]() |
[16] |
R. Vasisht, R. Das, Coneralizations of expansiveness in non-autonomous discrete systems, B. Iran. Math. Soc., 48 (2022), 417–433. https://doi.org/10.1007/s41980-020-00525-z doi: 10.1007/s41980-020-00525-z
![]() |
[17] |
Y. X. Jiang, T. X. Lu, J. M. Pi, W. Anwar, The retentivity of four kinds of shadowing properties in non-Autonomous discrete dynamical systems, Entropy, 24 (2022), 397. https://doi.org/10.3390/e24030397 doi: 10.3390/e24030397
![]() |
[18] | X. Meng, F. Yi, Some equivalence determination and application of equivalent metric, J. Shenyang Norm. Univ., 2012. |
[19] | L. D. Wang, Y. N. Li, Y. L. Gao, H. Liu, Distributional chaos of time-varying discrete dynamical systems, Ann. Pol. Math., 107 (2013), 49–57. http://doi.org/10.40642Fap107-1-3 |
[20] |
X. F. Yang, T. X. Lu, W. Anwar, Chaotic properties of a class of coupled mapping lattice induced by fuzzy mapping in non-autonomous discrete systems, Chaos Solitons Fractals, 148 (2021), 110979. https://doi.org/10.1016/j.chaos.2021.110979 doi: 10.1016/j.chaos.2021.110979
![]() |
[21] |
M. L. Blank, Metric properties of ε-trajectories of dynamical systems with stochastic behaviour, Ergod. Theor. Dyn. Syst., 8 (1988), 365–378. https://doi.org/10.1017/S014338570000451X doi: 10.1017/S014338570000451X
![]() |
[22] |
D. Dastjerdi, M. Hosseini, Sub-shadowings, Nonlinear Anal., 72 (2010), 3759–3766. https://doi.org/10.1016/j.na.2010.01.014 doi: 10.1016/j.na.2010.01.014
![]() |