Next Article in Journal
Portfolio Selection Models Based on Interval-Valued Conditional Value-at-Risk (ICVaR) and Case Study on the Data from Stock Markets
Next Article in Special Issue
A Novel Implementation of Mönch’s Fixed Point Theorem to a System of Nonlinear Hadamard Fractional Differential Equations
Previous Article in Journal
On Benford’s Law and the Coefficients of the Riemann Mapping Function for the Exterior of the Mandelbrot Set
Previous Article in Special Issue
New Adaptive Finite-Time Cluster Synchronization of Neutral-Type Complex-Valued Coupled Neural Networks with Mixed Time Delays
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Collective Sensitivity and Collective Accessibility of Non-Autonomous Discrete Dynamical Systems

1
College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
2
South Sichuan Applied Mathematics Research Center, Zigong 643000, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2022, 6(10), 535; https://doi.org/10.3390/fractalfract6100535
Submission received: 2 September 2022 / Revised: 16 September 2022 / Accepted: 19 September 2022 / Published: 22 September 2022

Abstract

:
The concepts of collectively accessible, collectively sensitive, collectively infinitely sensitive, and collectively Li–Yorke sensitive are defined in non-autonomous discrete systems. It is proved that, if the mapping sequence h 1 , = ( h 1 , h 2 , ) is W -chaotic, then h n , = ( h n , h n + 1 , ) ( n N = { 1 , 2 , } ) would also be W -chaotic. W -chaos represents one of the following five properties: collectively accessible, sensitive, collectively sensitive, collectively infinitely sensitive, and collectively Li–Yorke sensitive. Then, the relationship of chaotic properties between the product system ( H 1 × H 2 , f 1 , × g 1 , ) and factor systems ( H 1 , f 1 , ) and ( H 2 , g 1 , ) was presented. Furthermore, in this paper, it is also proved that, if the autonomous discrete system ( X , h ^ ) induced by the p-periodic discrete system ( H , h 1 , ) is W -chaotic, then the p-periodic discrete system ( H , f 1 , ) would also be W -chaotic.

1. Introduction

As a natural extension of autonomous discrete dynamical systems (ADDSs), non-autonomous discrete dynamical systems (NDDSs), are an important part of topological dynamical systems. Compared with classical dynamical systems (ADDSs), NDDSs can describe various dynamical behaviors more flexibly and conveniently.
NDDSs, firstly introduced by Kolyada [1] in 1996, are equivalent to some non-autonomous differential equations (see [2,3]). Chaos in NDDSs has become a hot research topic since the beginning of the 21st century. In 2011, Canovas [4] studied the limit behavior of sequences with the form f n f 1 ( x ) ( x [ 0 , 1 ] , n N ) , and discussed whether the simplicity (respectively chaoticity) of f implies the simplicity (respectively chaoticity) of f 1 , , where f 1 , = { f n } n = 1 converges uniformly to f. In 2012, Huang [5] studied the sensitivity of a special non-autonomous discrete system (named periodical discrete system). In 2015, Huang [6] extended the results of the sensitivity and strong sensitivity of ADDSs to NDDSs, and the conditions are weaker than those of ADDSs. In 2019, Vasisht [7] discussed the sensitivity of stronger forms via Furstenberg families in NDDSs, among which some examples are provided to illustrate the conclusions. In 2020, Kumar [8] studied the approximate controllability of specific non-autonomous second-order nonlinear differential problems with finite delay in the infinite dimensional space. Li [9] extended the general transitivity and sensitivity of non-autonomous systems to strong transitivity and strong sensitivity. Shao [10,11] established several criteria for strong Li–Yorke chaos and distributional chaos in non-autonomous discrete systems. Some other research about chaos or non-autonomous discrete systems includes [12,13,14,15,16,17,18], and others.
In this paper, collectively accessible, collectively sensitive, collectively infinitely sensitive, and collectively Li–Yorke sensitive classes of NDDSs are discussed, and some equivalence relations are presented. The main results are in Section 3, Section 4 and Section 5.

2. Preliminaries

Let N = { 1 , 2 , } . h n : H H ( n N , ( H , ρ ) is a compact metric space) be a continuous mapping sequence denoted by h 1 , = ( h 1 , h 2 , ) = ( h n ) n = 1 . This mapping sequence defines a non-autonomous discrete dynamical system ( H , h 1 , ) . Under this sequence, the orbit of the point x H is Orb h 1 , ( x ) = { x , h 1 ( x ) , h 2 h 1 ( x ) , , h 1 n ( x ) , } ( n N ) , where h 1 n = h n h 2 h 1 . Similarly, h n m = h m h n + 1 h n ( m n ) , and h 1 0 is the identity mapping.
In this section, the definitions related to sensitivity and accessibility will be given.
Definition 1.
The system ( H , h 1 , ) is called collectively accessible, if for any ε > 0 and any nonempty open subsets A 1 , A 2 , , A k , B 1 , B 2 , , B k H , there exist a i A i for any i { 1 , 2 , , k } and b j B j for any j { 1 , 2 , , k } such that one of the following holds:
 (i) 
there is an i 0 { 1 , 2 , , k } such that ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) < ε for any j { 1 , 2 , , k } and some integer n > 0 ;
 (ii) 
there is a j 0 { 1 , 2 , , k } such that ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) < ε for any i { 1 , 2 , , k } and some integer n > 0 .
Definition 2.
Let ( H , h 1 , ) be a non-autonomous discrete dynamical system. Then h 1 , is said to be
 (1) 
sensitive if there is a η > 0 , for any a H and any ε > 0 , there exist a b B ( a , ε ) and n N , such that ρ ( h 1 n ( a ) , h 1 n ( b ) ) > η .
 (2) 
collectively sensitive if there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , the existence of k distinct points b 1 , b 2 , , b k H makes the following two conditions true:
 (i) 
ρ ( a i , b i ) < ε for any 1 i k ;
 (ii) 
there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) > η ( 1 i k ) o r ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) > η ( 1 j k ) .
 (3) 
collectively infinitely sensitive if there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , the existence of k distinct points b 1 , b 2 , , b k H makes the following two conditions true:
 (i) 
ρ ( a i , b i ) < ε for any 1 i k ;
 (ii) 
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) > η ( 1 i k ) o r lim sup n ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) > η ( 1 j k ) .
 (4) 
collectively Li–Yorke sensitive if there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , the existence of k distinct points b 1 , b 2 , , b k H makes the following two conditions true:
 (i) 
ρ ( a i , b i ) < ε for any 1 i k ;
 (ii) 
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) > η a n d lim inf n ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) = 0 ( 1 i k )  
or
lim sup n ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) > η a n d lim inf n ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) = 0 ( 1 j k ) .
Remark 1.
Obviously, when k = 1 , collectively sensitive is equivalent to sensitive. If h 1 , is collectively sensitive, then h 1 , must be sensitive.

3. Chaos of Mapping Sequences h 1 , and h n ,

In this section, it is always assumed that h n ( n N ) are surjections.
Theorem 1.
If the mapping sequence h 1 , = ( h 1 , h 2 , ) is W -chaotic, then the mapping sequence h n , = ( h n , h n + 1 , ) is W -chaotic for any n N , where W -chaos represents one of the following five properties: collectively accessible, sensitive, collectively sensitive, collectively infinitely sensitive, and collectively Li–Yorke sensitive.
Proof. 
In this case, it only needs to prove that n = 2 .
 (1) 
collectively accessible
Let any finite nonempty open subsets A 1 , A 2 , , A k , B 1 , B 2 , , B k H . Since h 1 is surjective, taking an inverse image of each element in A i ( i { 1 , 2 , , k } ) and B j ( j { 1 , 2 , , k } ) under h 1 , one can obtain A i * ( i { 1 , 2 , , k } ) and B j * ( j { 1 , 2 , , k } ) separately. Since h 1 , is collectively accessible, then for any ε > 0 and finite nonempty open subsets A 1 * , A 2 * , , A k * , B 1 * , B 2 * , , B k * H , there exist a i * A i * for any i { 1 , 2 , , k } and b j * B j * for any j { 1 , 2 , , k } such that one of the following holds:
(i)
there is an i 0 { 1 , 2 , , k } such that ρ ( h 1 n ( a i 0 * ) , h 1 n ( b j * ) ) < ε for any j { 1 , 2 , , k } and some integer n > 0 ;
(ii)
there is a j 0 { 1 , 2 , , k } such that ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) < ε for any i { 1 , 2 , , k } and some integer n > 0 .
Assume that condition (i) is held (the second condition is similar). Then there exist a i 0 A i and b j B j such that h 1 ( a i 0 * ) = a i 0 and h 1 ( b j * ) = b j for any j ( j { 1 , 2 , , k } ) . So, for any ε > 0 and any nonempty open subsets A 1 , A 2 , , A k , B 1 , B 2 , , B k H , there exist a i A i for any i { 1 , 2 , , k } , b j B j for any j { 1 , 2 , , k } , and i 0 { 1 , 2 , , k } such that
ρ ( h 2 n ( a i 0 ) , h 2 n ( b j ) ) = ρ ( h 1 n ( a i 0 * ) , h 1 n ( b j * ) ) < ε
for any j { 1 , 2 , , k } and some integer n > 0 .
Thus, h 2 , is collectively accessible.
 (2) 
sensitive
Similar to the proof of collectively sensitive.
 (3) 
collectively sensitive
Let any k ( k N ) different points a 1 , a 2 , , a k H . Since h 1 is a surjective, then there exists a i * H , such that h 1 ( a i * ) = a i , for any 1 i k . Since h 1 , is collectively sensitive, then there is an η > 0 , for any ε > 0 , and the finite number of points a 1 * , a 2 * , , a k * H , there exist k points b 1 * , b 2 * , , b k * H such that:
(i)
ρ ( a i * , b i * ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) > η ( 1 i k ) or ρ ( h 1 n ( a i 0 * ) , h 1 n ( b j * ) ) > η ( 1 j k ) .
Without loss of generality, assume that there exist 1 i 0 , j 0 k , and positive integer n N such that ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) > η ( 1 i k ) .
Claim. Q = { n N ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) > η ( 1 i k ) } is an infinite set.
Hypothesis Q is a finite set, then there must be an m N such that m m a x { Q } . Since h n ( n N ) are continuous maps on a compact metric space, then h n ( n N ) is uniformly continuous on H. So h 1 i ( i { 1 , 2 , , m } ) is uniformly continuous on H. Then, for any ε > 0 , there is a δ > 0 such that, for any x , y H : ρ ( x , y ) < δ , ρ ( h 1 i ( x ) , h 1 i ( y ) ) < ε for any i { 1 , 2 , , m } . Thus,
when i = 1 , there is a δ 1 > 0 such that ρ ( h 1 ( x ) , h 1 ( y ) ) < ε for any x , y H : ρ ( x , y ) < δ 1 ;
when i = 2 , there is a δ 2 > 0 such that ρ ( h 1 2 ( x ) , h 1 2 ( y ) ) < ε for any x , y H : ρ ( x , y ) < δ 2 ;
when i = m , there is δ m > 0 such that ρ ( h 1 m ( x ) , h 1 m ( y ) ) < ε for any x , y H : ρ ( x , y ) < δ m .
These contradict that h 1 , is collectively sensitive. So, Q is an infinite set.
Thus, there exist b j H such that h 1 ( b j * ) = b j for any 1 j k . Since h 1 is a continuous mapping on a compact metric space H, then h 1 is uniformly continuous on H. By the definition of continuous, ρ ( h 1 ( a i * ) , h 1 ( b i * ) ) = ρ ( a i , b i ) < ε for any 1 i k and, because ρ ( h 2 n ( a i ) , h 2 n ( b j ) ) = ρ ( h 1 n ( a i * ) , h 1 n ( b j * ) for any 1 i , j k , then there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , there exist k distinct points b 1 , b 2 , , b k H such that:
(i)
ρ ( a i , b i ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ ( h 2 n ( a i ) , h 2 n ( b j 0 ) ) > η ( 1 i k ) or ρ ( h 2 n ( a i 0 ) , h 2 n ( b j ) ) > η ( 1 j k ) .
Therefore, h 2 , is collectively sensitive.
 (4) 
collectively infinitely sensitive
Similar to the proof below.
 (5) 
collectively Li–Yorke sensitive
Let any finite number of different points a 1 , a 2 , , a k H . Since h 1 is surjective, then there exist a i * H such that h 1 ( a i * ) = a i for any 1 i k . And because h 1 , is collectively Li–Yorke sensitive, then there is an η > 0 , for any ε > 0 and the finite number of points a 1 * , a 2 * , , a k * H , the existence of k points b 1 * , b 2 * , , b k * H makes the following two conditions true:
(i)
ρ ( a i * , b i * ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) > η and lim inf n ρ ( h 1 n ( a i * ) , h 1 n ( b j 0 * ) ) = 0 ( 1 i k )
or
lim sup n ρ ( h 1 n ( a i 0 * ) , h 1 n ( b j * ) ) > η and lim inf n ρ ( h 1 n ( a i 0 * ) , h 1 n ( b j * ) ) = 0 ( 1 j k ) .
Then, there exist b j H such that h 1 ( b j * ) = b j for any 1 j k . Due to h 1 is uniformly continuous on H, then ρ ( h 1 ( a i * ) , h 1 ( b i * ) ) = ρ ( a i , b i ) < ε for any 1 i k . And because ρ ( h 2 n ( a i ) , h 2 n ( b j ) = ρ ( h 1 n ( a i * ) , h 1 n ( b j * ) for any 1 i , j k , then there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , the existence of k distinct points b 1 , b 2 , , b k H makes the following two conditions true:
(i)
ρ ( a i , b i ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( h 2 n ( a i ) , h 2 n ( b j 0 ) ) > η and lim inf n ρ ( h 2 n ( a i ) , h 2 n ( b j 0 ) ) = 0 ( 1 i k )
or
lim sup n ρ ( h 2 n ( a i 0 ) , h 2 n ( b j ) ) > η and lim inf n ρ ( h 2 n ( a i 0 ) , h 2 n ( b j ) ) = 0 ( 1 j k ) .
Thus, h 2 , is collectively Li–Yorke sensitive.
The proof is completed. □
The inverse of Theorem 1 should be considered. It is found that only the collective accessibility is valid, while the other four properties are not. An example is used to illustrate this conclusion.
Example 1.
Let H = [ 0 , 1 ] ,
h 1 ( x ) = 4 x f o r x 0 , 1 4 1 f o r x 1 4 , 1 2 2 x + 2 f o r x 1 2 , 1
h ( x ) = 3 x f o r x 0 , 1 3 3 x + 2 f o r x 1 3 , 2 3 3 x 2 f o r x 2 3 , 1
for any n N . h 1 , = ( h 1 , h , h , h , ) .
Obviously, h is a triangle-tent map, the images of h n oscillate between 0 and 1. The larger the n N , the denser the oscillation interval. Then for any nonempty open set U H , there is a large enough positive integer n such that h 1 n ( U ) covers [ 0 , 1 ] . Especially, for any a H and ε > 0 , there is an n N such that [ 0 , 1 ] is covered by h 1 n ( B ( a , ε ) ) . That is to say, there exist an η > 0 and a b B ( a , ε ) such that ρ ( h 1 n ( a ) , h 1 n ( b ) ) > η . Then, h is sensitive. Thus, h 2 , is sensitive.
Take a = 1 3 and ε = 1 16 . For any b B ( a , ε ) , and n N , one can deduce that ρ ( h 1 n ( a ) , h 1 n ( b ) ) = 0 . So, h 1 , is not sensitive.
Theorem 2.
If the mapping sequence h n , = ( h n , h n + 1 , ) is collectively accessible, then the mapping sequence h 1 , = ( h 1 , h 2 , ) is collectively accessible for any n N .
Proof. 
Take any finite nonempty open subsets A 1 , A 2 , , A k , B 1 , B 2 , , B k of H. Since h 1 is surjective, taking an image of each element in A i ( i { 1 , 2 , , k } ) and B j ( j { 1 , 2 , , k } ) under f 1 , one can obtain A i * ( i { 1 , 2 , , k } ) and B j * ( j { 1 , 2 , , k } ) separately. Since h 2 , is collective accessibility, then for any ε > 0 and for finite nonempty open subsets A 1 * , A 2 * , , A s * , B 1 * , B 2 * , , B k * H , there exist a i * A i * for any i { 1 , 2 , , k } and b j * B j * for any j { 1 , 2 , , k } such that one of the following holds:
(i)
there is an i 0 { 1 , 2 , , k } such that ρ ( h 2 n ( a i 0 * ) , h 2 n ( b j * ) ) < ε for any j { 1 , 2 , , k } and some integer n > 0 ;
(ii)
there is a j 0 { 1 , 2 , , k } such that ρ ( h 2 n ( a i * ) , h 2 n ( b j 0 * ) ) < ε for any i { 1 , 2 , , k } and some integer n > 0 .
The case that condition (i) was held is going to be proved.
In fact, there exist a i 0 A i and b j B j such that h 1 ( a i 0 ) = a i 0 * and h 1 ( b j ) = b j * for each j ( j { 1 , 2 , , k } ) . So, for any ε > 0 and any nonempty open subsets A 1 , A 2 , , A k , B 1 , B 2 , , B k H , there exist a i A i for any i { 1 , 2 , , k } , b j B j for any j { 1 , 2 , , k } , and i 0 { 1 , 2 , , k } such that
ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) = ρ ( h 2 n ( a i 0 * ) , h 2 n ( b j * ) ) < ε
for any j { 1 , 2 , , k } and some integer n > 0 .
Thus, h 1 , is collectively accessible. □
According to the proof of Theorems 1 and 2, the following corollary can be obtained.
Corollary 1.
Let ( h n ) n = 1 = ( h 1 , h 2 , , h n , ) be a mapping sequence on metric space ( H , ρ ) . If h 1 , is W -chaotic, then there exists an n N such that h n , is W -chaotic.
Corollary 2.
Let ( h n ) n = 1 = ( h 1 , h 2 , , h n , ) be a mapping sequence on metric space ( H , ρ ) . If h n , is collectively accessible, then there exists an n N such that h 1 , is collectively accessible.

4. Chaos of the Product System ( H 1 × H 2 , f 1 , × g 1 , )

Let f 1 , = ( f n ) n = 1 , g 1 , = ( g n ) n = 1 be the continuous mapping sequences on compact metric spaces ( H 1 , ρ 1 ) and ( H 2 , ρ 2 ) , respectively, where ( H 1 , ρ 1 ) and ( H 2 , ρ 2 ) are compact metric spaces. ( H 1 × H 2 , f 1 , × g 1 , ) is called the product of ( H 1 , f 1 , ) and ( H 2 , g 1 , ) . For any ( x 1 , y 1 ) , ( x 2 , y 2 ) H 1 × H 2 , define
ρ ( ( x 1 , y 1 ) , ( x 2 , y 2 ) ) = max { ρ 1 ( x 1 , x 2 ) , ρ 2 ( y 1 , y 2 ) }
as the metric on H 1 × H 2 .
Theorem 3.
If f 1 , × g 1 , is collectively accessible, then f 1 , and g 1 , are collectively accessible.
Proof. 
Assume that f 1 , × g 1 , is collectively accessible, then for any ε > 0 and any nonempty open subsets A 1 × B 1 , A 2 × B 2 , , A k × B k , A 1 * × B 1 * , A 2 * × B 2 * , , A k * × B k * H 1 × H 2 , there exist ( a i , b i ) A i × B i for any i { 1 , 2 , , k } and ( a j * , b j * ) A j * × B j * for any j { 1 , 2 , , k } such that one of the following holds:
(i) there is an i 0 { 1 , 2 , , k } such that ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) < ε for any j { 1 , 2 , , k } and some integer n > 0 .
(ii) there is a j 0 { 1 , 2 , , k } such that ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) < ε for any i { 1 , 2 , , k } and some integer n > 0 .
Without loss of generality, it is only necessary to deal with the case that condition (i) is held (the second case is similar). Since
ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) = max { ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) ) , ρ 2 ( g 1 n ( b i 0 ) , g 1 n ( b j * ) ) } < ε
for any j { 1 , 2 , , k } and some integer n > 0 , then,
ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) ) < ε a n d ρ 2 ( g 1 n ( b i 0 ) , g 1 n ( b j * ) ) < ε .
Thus, for any ε > 0 and any nonempty open subsets A 1 , A 2 , , A k , A 1 * , A 2 * , , A k * H 1 , there exist a i A i for any i { 1 , 2 , , k } , a j * A j * for any j { 1 , 2 , , k } and an i 0 { 1 , 2 , , k } such that ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) < ε for any j { 1 , 2 , , k } and some integer n > 0 . Therefore f 1 , is collectively accessible. And by the same discussion, g 1 , is collectively accessible. So, f 1 , and g 1 , is collectively accessible.
The proof is completed. □
Theorem 4.
If f 1 , × g 1 , is sensitive (resp., collectively sensitive, collectively infinitely sensitive, collectively Li–Yorke sensitive), then f 1 , or g 1 , is sensitive (resp., collectively sensitive, collectively infinitely sensitive, collectively Li–Yorke sensitive).
Proof. 
(1) sensitive
Similar to the proof of collectively sensitive.
 (2) 
collectively sensitive
Assume that f 1 , × g 1 , is collectively sensitive, then there is an η > 0 , for any ε > 0 and any finite number of different points ( a 1 , b 1 ) , ( a 2 , b 2 ) , , ( a k , b k ) H 1 × H 2 , there exist k distinct points ( a 1 * , b 1 * ) , ( a 2 * , b 2 * ) , , ( a k * , b k * ) H 1 × H 2 such that:
(i)
ρ ( ( a i , b i ) , ( a i * , b i * ) ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ ( f 1 n × g 1 n ( a i , b i ) , f 1 n × g 1 n ( a j 0 * , b j 0 * ) ) > η ( 1 i k )
or
ρ ( f 1 n × g 1 n ( a i 0 , b i 0 ) , f 1 n × g 1 n ( a j * , b j * ) ) > η ( 1 j k ) .
Then
ρ ( ( a i , b i ) , ( a i * , b i * ) ) = max { ρ 1 ( a i , a i * ) , ρ 2 ( b i , b i * ) } < ε .
That is to say, ρ 1 ( ( a i , a i * ) < ε and ρ 2 ( b i , b i * ) ) < ε for any 1 i k . And by (ii), one has
ρ ( f 1 n × g 1 n ( a i , b i ) , f 1 n × g 1 n ( a j 0 * , b j 0 * ) ) = max { ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) , ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) } > η
or
ρ ( f 1 n × g 1 n ( a i 0 , b i 0 ) , f 1 n × g 1 n ( a j * , b j * ) ) = max { ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) ) , ρ 2 ( g 1 n ( b i 0 ) , g 1 n ( b j * ) ) } > η .
So, there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) > η o r ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) > η ( 1 i k ) ;
ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) ) > η o r ρ 2 ( g 1 n ( b i 0 ) , g 1 n ( b j * ) ) > η ( 1 j k ) .
Thus, f 1 , or g 1 , is collectively sensitive.
 (3) 
collectively infinitely sensitive
Similar to the proof below.
 (4) 
collectively Li–Yorke sensitive
Assume that f 1 , × g 1 , is collectively Li–Yorke sensitive, then there is an η > 0 , for any ε > 0 and any finite number of different points ( a 1 , b 1 ) , ( a 2 , b 2 ) , , ( a k , b k ) H 1 × H 2 , the existence of k distinct points ( a 1 * , b 1 * ) , ( a 2 * , b 2 * ) , , ( a k * , b k * ) H 1 × H 2 makes the following two conditions true:
(i)
ρ ( ( a i , b i ) , ( a i * , b i * ) ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) > η
and
lim inf n ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) = 0 ( 1 i k ) ,
or
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) > η
and
lim inf n ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) = 0 ( 1 j k ) .
Then,
ρ ( ( a i , b i ) , ( a i * , b i * ) ) = max { ρ 1 ( a i , a i * ) , ρ 2 ( b i , b i * ) } < ε .
So, ρ 1 ( ( a i , a i * ) < ε and ρ 2 ( b i , b i * ) ) < ε for any 1 i k .
According to (ii),
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) = lim sup n max { ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) , ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) } > η
and
lim inf n ρ ( f 1 n × g 1 n ( a i , b i ) , f 1 n × g 1 n ( a j 0 * , b j 0 * ) ) = lim inf n max { ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) , ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) } = 0 .
So, there exist 1 i 0 , j 0 k , and positive integer n N such that
lim sup n ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) > η a n d lim inf n ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) = 0 ,
or
lim sup n ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) > η a n d lim sup n ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) = 0 .
Thus, f 1 , or g 1 , is collectively Li–Yorke sensitive.
The proof is completed.
The inverse of Theorem 4 should be considered.
Theorem 5.
If f 1 , or g 1 , is sensitive (resp., collectively sensitive, collectively infinitely sensitive), then f 1 , × g 1 , is sensitive (resp., collectively sensitive, collectively infinitely sensitive).
Proof. 
 (1) sensitive
Similar to the proof of collectively sensitive.
 (2) 
collectively sensitive
Assume that f 1 , is collectively sensitive. Then there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H 1 , there exist k distinct points a 1 * , a 2 * , , a k * H 1 such that:
(i)
ρ 1 ( a i , a i * ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k , and positive integer m N such that
ρ 1 ( f 1 m ( a i ) , f 1 m ( a j 0 * ) ) > η ( 1 i k ) or ρ 1 ( f 1 m ( a i 0 ) , f 1 m ( a j * ) ) > η ( 1 j k ) .
For any finite number of different points b 1 , b 2 , , b k H 2 , there exist k points b 1 * , b 2 * , , b k * H 2 such that ρ 2 ( b i , b i * ) < ε for any 1 i k . Then,
ρ ( ( a i , b i ) , ( a i * , b i * ) ) = max { ρ 1 ( a i , a i * ) , ρ 2 ( b i , b i * ) } < ε
for any 1 i k .
Take n = m , then
ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) = max { ρ 1 ( f 1 n ( a i ) , f 1 n ( a j 0 * ) ) , ρ 2 ( g 1 n ( b i ) , g 1 n ( b j 0 * ) ) } > η .
Similarly, ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) η ( 1 j k ) can be obtained.
Therefore, for any ε > 0 and any finite number of different points ( a 1 , b 1 ) , ( a 2 , b 2 ) , , ( a k , b k ) H 1 × H 2 , there exist ( a 1 * , b 1 * ) , ( a 2 * , b 2 * ) , , ( a k * , b k * ) H 1 × H 2 such that:
(i)
ρ ( ( a i , b i ) , ( a i * , b i * ) ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k , and positive integer n N such that
ρ ( f 1 n × g 1 n ( a i , b i ) , f 1 n × g 1 n ( a j 0 * , b j 0 * ) ) > η ( 1 i k )
or
ρ ( f 1 n × g 1 n ( a i 0 , b i 0 ) , f 1 n × g 1 n ( a j * , b j * ) ) > η ( 1 j k ) .
So, f 1 , × g 1 , is collectively sensitive.
 (3) 
collectively infinitely sensitive
Assume that f 1 , is collectively infinitely sensitive. Then there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H 1 , the existence of k distinct points a 1 * , a 2 * , , a k * H 1 makes the following two conditions true:
(i)
ρ 1 ( a i , a i * ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ 1 ( f 1 m ( a i ) , f 1 m ( a j 0 * ) ) > η or lim sup n ρ 1 ( f 1 m ( a i 0 ) , f 1 m ( a j * ) ) > η .
For any finite number of different points b 1 , b 2 , , b k H 2 , there exist k points b 1 * , b 2 * , , b k * H 2 such that ρ 2 ( b i , b i * ) < ε for any 1 i k . Then,
ρ ( ( a i , b i ) , ( a i * , b i * ) ) = max { ρ 1 ( a i , a i * ) , ρ 2 ( b i , b i * ) } < ε
for any 1 j k .
Take n = m , then
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) = lim sup n max { ρ 1 ( f 1 n ( a i 0 ) , f 1 n ( a j * ) ) , ρ 2 ( g 1 n ( b i 0 ) , g 1 n ( b j * ) ) } > η .
Therefore, for any ε > 0 and any finite number of different points ( a 1 , b 1 ) , ( a 2 , b 2 ) , , ( a k , b k ) H 1 × H 2 , the existence of k points ( a 1 * , b 1 * ) , ( a 2 * , b 2 * ) , , ( a k * , b k * ) H 1 × H 2 makes the following two conditions true:
(i)
ρ ( ( a i , b i ) , ( a i * , b i * ) ) < ε for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i , b i ) , ( f 1 n × g 1 n ) ( a j 0 * , b j 0 * ) ) > η
or
lim sup n ρ ( ( f 1 n × g 1 n ) ( a i 0 , b i 0 ) , ( f 1 n × g 1 n ) ( a j * , b j * ) ) > η .
So, f 1 , × g 1 , is collectively sensitive.
The proof is completed. □

5. Chaos of the p -Periodic Discrete System ( H , f 1 , )

If an NDDS satisfies:
h n + p ( x ) = h n ( x ) , x H , n 0 , p N ,
then ( H , h 1 , ) is called a p-periodic discrete system. Particularly, if p = 1 , ( H , h 1 , ) is an autonomous discrete system. Let h ^ = h p h 1 , then ( H , h ^ ) is said to be an ADDS induced by the p-periodic discrete system ( H , h 1 , ) (see [5]).
Theorem 6.
The autonomous discrete system ( X , h ^ ) induced by the p-periodic discrete system ( H , h 1 , ) is W -chaotic, then the p-periodic discrete system ( H , f 1 , ) is W -chaotic, where W -chaos represents one of the following five properties: collectively accessible, sensitive, collectively sensitive, collectively infinitely sensitive, and collectively Li–Yorke sensitive.
Proof. 
In fact, for a p-periodic discrete system, using h 1 n p = ( h 1 p ) n , these conclusions can be easily obtained. The proof of collectively Li–Yorke sensitivity is given below, and the proofs of other chaotic properties are similar.
Assume that ( H , h ^ ) is collectively Li–Yorke sensitive, then there is an η > 0 , for any ε > 0 and any finite number of different points a 1 , a 2 , , a k H , the existence of k distinct points b 1 , b 2 , , b k H makes the following two conditions true:
(i)
such that ρ ( a i , b i ) < ε , for any 1 i k ;
(ii)
there exist 1 i 0 , j 0 k such that
lim sup n ρ ( h ^ 1 n ( a i ) , h ^ 1 n ( b j 0 ) ) > η and lim inf n ρ ( h ^ 1 n ( a i ) , h ^ 1 n ( b j 0 ) ) = 0 ( 1 i k ) ,
or
lim sup n ρ ( h ^ 1 n ( a i 0 ) , h ^ 1 n ( b j ) ) > η and lim inf n ρ ( h ^ 1 n ( a i 0 ) , h ^ 1 n ( b j ) ) = 0 ( 1 j k ) .
Since
lim sup n ρ ( h ^ 1 n ( a i ) , h 1 n ( b j ) ) = lim sup n ρ ( h 1 n p ( a i ) , h 1 n p ( b j ) ) lim sup n ρ ( h 1 n ( a i ) , h 1 n ( b j ) )
and
lim inf n ρ ( h ^ 1 n ( a i ) , h 1 n ( b j ) ) = lim inf n ρ ( h 1 n p ( a i ) , h 1 n p ( b j ) ) lim inf n ρ ( h 1 n ( a i ) , h 1 n ( b j ) )
for any i , j { 1 , 2 , , k } , then
lim sup n ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) > η and lim inf n ρ ( h 1 n ( a i ) , h 1 n ( b j 0 ) ) = 0 ( 1 i k ) ,
or
lim sup n ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) > η and lim inf n ρ ( h 1 n ( a i 0 ) , h 1 n ( b j ) ) = 0 ( 1 j k ) .
Thus ( H , h 1 , ) is collectively Li–Yorke sensitive.
The proof is completed. □
Example 2.
Let H = [ 0 , 1 ] . Two mappings ϕ ( x ) , h(x) be defined by ϕ ( x ) = 4 x ( 1 x ) for x [ 0 , 1 ] and h(x) = 3 x f o r x 0 , 1 3 3 x + 2 f o r x 1 3 , 2 3 3 x 2 f o r x 2 3 , 1
Let ( g n ) n = 1 = { ϕ , h , ϕ , h , ϕ , h , } then g ^ = g 2 g 1 . The function images of g ^ and g ^ 2 are in Figure 1. Then the following conclusion (Proposition 1) can be obtained.
Proposition 1.
The mapping g ^ is sensitive.
Proof. 
From Figure 1 (The function image of g ^ n can be inferred), it can be seen that, for any a H and ε > 0 , there is an n N such that [ 0 , 1 ] is covered by g ^ n ( B ( a , ε ) ) . So, there exists an η > 0 and a b B ( a , ε ) such that ρ ( g ^ n ( a ) , g ^ n ( b ) ) > η (similar to the proof of Example 1). Thus, g ^ is sensitive. □
The numerical simulation diagram of g ^ is shown in Figure 2. The green dots and red dots represent the trajectories of 5000 iterations under the initial values x 1 = 0.50001 and x 2 = 0.50002 , respectively.
After iteration, it can be seen from Figure 2 that the trajectory of x 1 (or x 2 ) is ergodic and disordered. ρ ( x 1 , x 2 ) = 0.00001 , but ρ ( g ^ ( x 1 ) , g ^ ( x 2 ) ) = 0.7393 . This means that the initial distance between x 1 and x 2 is very minimal, but after 3423 iterations, the distance of iteration points is large (the distance has increased more than 70,000 times). This phenomenon is a characterization of sensitivity.
Now, the function images of g 1 2 , g 1 3 , and g 1 4 are given in Figure 3, and the image of g 1 n ( n > 4 ) can be inferred. Then, the following result is true (see Proposition 2).
Proposition 2.
The mapping sequence g 1 , is sensitive.
Proof. 
Similar to the proof of Proposition 1, this conclusion can also be obtained. □

Author Contributions

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

Funding

This work was funded by the Project of the Department of Science and Technology of Sichuan Provincial (No. 2021ZYD0005), the Scientific Research Project of Sichuan University of Science and Engineering (No. 2020RC24), and the Graduate Student Innovation Fundings (No. y2022189).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

Many thanks to reviewers.

Conflicts of Interest

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

References

  1. Kolyada, S.; Snoha, L. Topological entropy of nonautonomous dynamical systems. Random Comput. Dynam. 1996, 4, 205–233. [Google Scholar]
  2. Elaydi, S. Nonautonomous difference equations: Open problems and conjectures. Fields Inst. Commun. 2004, 42, 423–428. [Google Scholar]
  3. Elaydi, S.; Sacker, R. Nonautonomous Beverton-Holt equations and the Cushing–Henson conjectures. J. Difference Equ. Appl. 2005, 11, 337–346. [Google Scholar] [CrossRef]
  4. Cánovas, J. Li–Yorke chaos in a class of nonautonomous discrete systems. J. Difference Equ. Appl. 2011, 17, 479–486. [Google Scholar] [CrossRef]
  5. Huang, Q. Chaos Theory and Application of Discrete Dynamical Systems; Shandong University: Jinana, China, 2012. (In Chinese) [Google Scholar]
  6. Huang, Q.; Shi, Y.; Zhang, L. Sensitivity of non-autonomous discrete dynamical systems. Appl. Math. Lett. 2015, 39, 31–34. [Google Scholar] [CrossRef]
  7. Vasisht, R.; Das, R. A note on F-sensitivity for non-autonomous systems. J. Differ. Equ. Appl. 2019, 25, 548–559. [Google Scholar] [CrossRef]
  8. Kuma, A.; Vats, R.; Kumar, A. Approximate controllability of second-order non-autonomous system with finite delay. J. Dyn. Control Syst. 2020, 3, 1–17. [Google Scholar]
  9. Li, R.; Zhao, Y.; Wang, H. Stronger forms of transitivity and sensitivity for nonautonomous discrete dynamical systems and furstenberg families. J. Dyn. Control. Syst. 2020, 26, 109–126. [Google Scholar] [CrossRef]
  10. Shao, H.; Chen, G.; Shi, Y. Topological conjugacy between induced non-autonomous set-Valued systems and subshifts of finite type. Qual. Theor. Dyn. Syst. 2020, 19, 295–308. [Google Scholar] [CrossRef]
  11. Shao, H.; Chen, G.; Shi, Y. Some criteria of chaos in non-autonomous discrete dynamical systems. J. Differ. Equ. Appl. 2020, 7, 1–14. [Google Scholar] [CrossRef]
  12. Li, T.; Yorke, J. Period three implies chaos. Amer. Math. Mon. 1975, 82, 985–992. [Google Scholar] [CrossRef]
  13. Devaney, R. An Introduction to Chaotic Dynamical Systems; Addison Wesley: Boston, MA, USA, 1989. [Google Scholar]
  14. Schweizer, B.; Smital, J. Measure of chaos and a spectral decomposition of dynamical systems of interval. Trans. Amer. Math. Soc. 1994, 344, 737–754. [Google Scholar] [CrossRef]
  15. Wang, L.; Huang, G.; Huan, S. Distributional chaos in a sequence. Nonlinear Anal. 2007, 67, 2131–2136. [Google Scholar] [CrossRef]
  16. Bayart, F.; Matheron, E. Dynamics of Linear Operators; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  17. Khan, M.; Islam, M. A chaotic three dimensional non-linear autonomous system beyond Lorenz type systems. J. Bangladesh Acad. Sci. 2012, 36, 159–170. [Google Scholar] [CrossRef]
  18. Bernardes, N.; Bonilla, J.; Muller, A.; Peris, A. Distributional chaos for linear operators. J. Funct. Anal. 2013, 265, 2143–2163. [Google Scholar] [CrossRef]
Figure 1. The function images of g ^ and g ^ 2 .
Figure 1. The function images of g ^ and g ^ 2 .
Fractalfract 06 00535 g001
Figure 2. The chaotic behavior of g ^ ( x 1 = 0.50001 , x 2 = 0.50002 , the number of iterations n = 5000 ).
Figure 2. The chaotic behavior of g ^ ( x 1 = 0.50001 , x 2 = 0.50002 , the number of iterations n = 5000 ).
Fractalfract 06 00535 g002
Figure 3. The function images of g 1 2 , g 1 3 , and g 1 4 .
Figure 3. The function images of g 1 2 , g 1 3 , and g 1 4 .
Fractalfract 06 00535 g003
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Pi, J.; Lu, T.; Chen, Y. Collective Sensitivity and Collective Accessibility of Non-Autonomous Discrete Dynamical Systems. Fractal Fract. 2022, 6, 535. https://doi.org/10.3390/fractalfract6100535

AMA Style

Pi J, Lu T, Chen Y. Collective Sensitivity and Collective Accessibility of Non-Autonomous Discrete Dynamical Systems. Fractal and Fractional. 2022; 6(10):535. https://doi.org/10.3390/fractalfract6100535

Chicago/Turabian Style

Pi, Jingmin, Tianxiu Lu, and Yuanlin Chen. 2022. "Collective Sensitivity and Collective Accessibility of Non-Autonomous Discrete Dynamical Systems" Fractal and Fractional 6, no. 10: 535. https://doi.org/10.3390/fractalfract6100535

Article Metrics

Back to TopTop