Next Article in Journal
Multiscale Entropy-Based Feature Extraction for the Detection of Instability Inception in Axial Compressors
Next Article in Special Issue
Distributed Dynamic Event-Triggered Control to Leader-Following Consensus of Nonlinear Multi-Agent Systems with Directed Graphs
Previous Article in Journal
Neural Causal Information Extractor for Unobserved Causes
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Note on Stronger Forms of Sensitivity for Non-Autonomous Dynamical Systems on Uniform Spaces

1
Department of Electronic Business, South China University of Technology, Guangzhou 510006, China
2
School of Disciplinary Basics and Applied Statistics, Zhuhai College of Science and Technology (Zhuhai College of Jilin University), Zhuhai 519041, China
3
School of Mathematics, Jilin University, Changchun 130012, China
*
Author to whom correspondence should be addressed.
Entropy 2024, 26(1), 47; https://doi.org/10.3390/e26010047
Submission received: 12 December 2023 / Revised: 29 December 2023 / Accepted: 30 December 2023 / Published: 2 January 2024
(This article belongs to the Special Issue Advances in Nonlinear Dynamical Systems and Chaos)

Abstract

:
This paper introduces the notion of multi-sensitivity with respect to a vector within the context of non-autonomous dynamical systems on uniform spaces and provides insightful results regarding  N -sensitivity and strongly multi-sensitivity, along with their behaviors under various conditions. The main results established are as follows: (1) For a k-periodic nonautonomous dynamical system on a Hausdorff uniform space  ( S , U ) , the system  ( S , f k f 1 )  exhibits  N -sensitivity (or strongly multi-sensitivity) if and only if the system  ( S , f 1 , )  displays  N -sensitivity (or strongly multi-sensitivity). (2) Consider a finitely generated family of surjective maps on uniform space  ( S , U ) . If the system  ( S , f 1 , )  is  N -sensitive, then the system  ( S , f k , )  is also  N -sensitive. When the family  f 1 ,  is feebly open, the converse statement holds true as well. (3) Within a finitely generated family on uniform space  ( S , U ) N -sensitivity (and strongly multi-sensitivity) persists under iteration. (4) We present a sufficient condition under which an nonautonomous dynamical system on infinite Hausdorff uniform space demonstrates  N -sensitivity.

1. Introduction

Chaos refers to the inherent unpredictability that arises in deterministic systems in the absence of stochastic variables. It is a fundamental area of study in nonlinear science, representing a universal dynamical behavior of nonlinear systems. Furthermore, chaos profoundly and globally influences the evolution of nonlinear dynamics. Sensitivity is a critical element of chaos, attracting significant attention from scholars for research purposes [1,2,3,4,5,6,7,8,9,10,11,12,13,14].
Ruelle and Takens provided the first definition of sensitivity in 1971 [1]. It describes the unpredictable nature of chaotic processes and is essential to different kinds of chaos. Even a small change in a dynamical system’s initial configuration might result in significantly different behavior later on. In 1980, Auslander and Yorke applied sensitivity to topological dynamical system [2]. In 1989, the famous Devaney chaos was proposed [3]. Since then, the study of sensitivity became popular. If a system is topologically transitive, contains a dense collection of periodic points, and is sensitive to initial conditions, it is said to be Devaney chaotic [3]. Later, Banks et al. proved that the third condition (sensitivity) of the Devaney chaos is implied by the first two characteristics (transitivity and dense periodic points set) [4]. Glasner and Weiss expanded it to demonstrate that a transitive non-minimal system with dense minimal points is sensitive [5].
One indicator of a system’s sensitivity is the “largeness” of the time set where sensitivity occurs. From this perspective, Moothathu presented a number of stronger forms of sensitivity, namely, cofinite sensitivity, multisensitivity, and syndetic sensitivity [6]. His work further deepened the study of sensitivity. Later, Li presented the concept of ergodic sensitivity [7], which is another stronger form of sensitivity. He also present some sufficient conditions for dynamical system  ( X , f )  to be ergodically sensitive. Liu et al. introduced thick sensitivity, syndetic sensitivity, thickly syndetic sensitivity, and strong sensitivity [8]. For more results about sensitivity, we refer to [9,10,11,12,13,14]
Recently, there has been significant research interest in studying sensitivity and chaoticity on uniform spaces for dynamical systems. Ahmadi et al. studied the topological shadowing property, chain transitivity, total chain transitivity, and chain mixing property for dynamical systems on uniform spaces [15]. Shah et al. presented and investigated the concept of distributional chaos on uniform spaces [16]. The notions of weak uniformity, uniform rigidity, and multi-sensitivity for uniform spaces were initially proposed by Wu et al. in 2019 [17]. The concepts of mean sensitivity and Banach mean sensitivity are expanded to uniform spaces by Wu et al. [18].
Consider a continuous map  f : X X  operating on a compact metric space  ( X , d ) . A non-autonomous discrete system difference equation refers to
x n + 1 = f n ( x n ) , n 1 .
where each  f n  is a continuous self-map on X. It should be noted that the autonomous dynamical system is a particular case of system (1). For other concepts and notations covered in this section, see Section 2.
The study of non-autonomous dynamical systems focuses on systems that vary with time, and compared to autonomous dynamical systems, the dynamics of non-autonomous dynamical systems are more complex. The applications of non-autonomous dynamical systems have been explored in various fields, including ecology, economics, climate science, biomedicine, and control engineering. These systems offer a valuable tool for understanding and predicting the behavior of dynamic systems under external influences and disturbances. By considering the time-varying nature of these systems, researchers can gain deeper insights into the intricacies of their dynamics and make more accurate predictions. The versatility and wide-ranging applications of non-autonomous dynamical systems make them an essential framework for studying and analyzing complex real-world phenomena. As a result, academics have been drawn to examine the complexity of such systems in recent years due to the rich dynamics [19,20,21,22,23,24,25,26,27].
Salman et al. introduced the notions of sensitivity, multi-sensitivity, cofinite sensitivity, and syndetic sensitivity within the realm of nonautonomous dynamical systems on uniform spaces. Additionally, they identified several adequate conditions wherein topological transitivity and the presence of densely distributed periodic points lead to sensitivity in nonautonomous systems residing on Hausdorff uniform spaces [28].
Inspired by their works, we present the notions of multi-sensitivity with respect to a vector, as well as  N -sensitivity and strongly multi-sensitivity, within the context of nonautonomous dynamical systems on uniform spaces. Furthermore, we provide criteria under which a nonautonomous dynamical system on infinite Hausdorff uniform space demonstrates  N -sensitivity.
The rest of the paper is organized as follows. In Section 2, some basic concepts are given. In Section 3, some stronger versions of sensitivities, namely, multi-sensitivity with respect to a vector,  N -sensitive and strongly multi-sensitivity are introducd to nonautonomous dynamical systems on uniform spaces. In Section 4, it gives some sufficient conditions for an infinite Hausdorff uniform space to be  N -sensitive.

2. Preliminaries

Throughout the paper, consider the symbols  N = { 1 , 2 , }  and  Z + = { 0 , 1 , } . Consider a nonempty set S, the diagonal of  S × S  is denoted by  Δ S = { ( x , x ) : x S } . Suppose that  A S × S A 1  which is defined by  A 1 = { ( y , x ) : ( x , y ) A }  is called the inverse of A. Specially, if  A = A 1 , then A is said to be symmetric. Assume that  A 1 , A 2  are subsets of  S × S , the composite  A 1 A 2  refer to the collection  { ( x , y ) S × S : there exits z S such that ( x , z ) A 1 and ( z , y ) A 2 } . Denote  D S = { A S × S : Δ S A and A = A 1 } .
The introduction of the notion of uniform space was attributed to Weil in [29]. In this section, we provide a concise overview of uniform space, but for a more in-depth understanding, readers are encouraged to refer to ([30], Chapter 8) for a comprehensive introduction to the subject.
Definition 1
([31]). Let  U  be a nonempty sets consist of the subsets of  S × S U  is called a uniform structure on S, if the following conditions hold:
  • U D S ;
  • If  A 1 U  and  A 1 A 2 D s , then  A 2 U ;
  • For any  A 1 , A 2 U , A 1 A 2 U ;
  • For any  A U , there exists  B U  such that  B B A .
A uniform space is defined as a pair  ( S , U ) , where S is a non-empty set and  U  is a uniform structure on it. Generally, we call  U  entourages.
In a uniform space denoted as  ( S , U ) , a uniform topology can be established on S. This is characterized by a neighborhood base at each point s that belongs to S. This neighborhood base is composed of sets  D [ s ] = { t S : ( s , t ) D } , with D representing all entourages of the uniform space  ( S , U ) . For a map  f : S S  on a uniform space  ( S , U ) , if  ( f × f ) 1 ( U ) U , then f is said to be uniformly continuous on  ( S , U ) .
Next, we will introduce non-autonomous dynamical systems on uniform spaces. A nonautonomous discrete system is defined as  ( S , f 1 , ) ( S , U )  is a nontrivial uniform space and for any  n N f n : S S  is uniformly continuous. This system consists of a sequence of uniformly continuous maps  f 1 , = { f n } n = 1  acting on the uniform space S. Denote that  O ( x ) = { f 1 n ( x ) : n 0 }  is the orbit of x for each  x S , where  f 1 n = f n f 1 ( n 1 )  and  f 1 ( 0 ) = i d . When  f n = f  for any  n N , the above system is an autonomous dynamical system  ( S , f ) . For  i , n N , let  f i n : = f i + n 1 f i + n 2 f i , f i ( 0 ) : = i d  and the kth iterate  f 1 , [ k ] = { f k ( n 1 ) + 1 k } n = 1 .
Consider a nonautonomous dynamical system  ( S , f 1 , ) , if  { f n : n N }  is a finite set,  ( S , f 1 , )  is called finitely generated. If there is an  l N  satisfing  f n + l m = f n  for each  m N  and each  1 n l ( S , f 1 , )  is said to be periodic.  ( S , f 1 , )  is feebly open if for each nonempty set  U S  and each  n N i n t ( f n ( U ) )  (where  i n t ( V )  denote the interior of the set V).
For the periodic points for non-autonomous dynamical systems, scholars proposed two different definitions from different perspectives. Here, the two different periodic points is distinguish by P1 and P2.
Definition 2
([27,32]). (P1) Consider a point x in S, x is called P1-periodic, if there is an  n N  such that  f 1 n i ( x ) = x  for each  i N .
(P2) Consider a point x of S, x is called P2-periodic, if there is an  n N  such that  f 1 ( i + n ) ( x ) = f 1 n ( x )  for each  i 0 .
Obviously, P2-periodic implies P1-periodic and the orbit of a periodic point in the sense of (P2) must be finite. However, by the Example 4.4 of [33], the orbit of a periodic point in sense of (P1) has the potential to be infinite.
Assume that D is a subset of  S × S  and V is a subset of S. Denote
N f 1 , ( V , D ) = { n N : there exist x , y V such that ( f 1 ( n ) ( x ) , f 1 ( n ) ( y ) ) D } .
Assume that  P  is the collection of all subsets of  Z + F P  is called a Furstenberg family if it satisfies  F 1 F 2  and  F 1 F  imply  F 2 F  (for details see [34]).
The following definition about sensitivity were generated by Huang et al. [35] and Salman et al. [28]. Let  F  be a Furstenberg family. A non-autonomous dynamical system  ( S , f 1 , )  on a uniform space  ( S , U )  is said to be sensitive, if there exists an entourage  E U  such that for any nonempty open subset V of S N f 1 , ( V , E ) . Typically, E is called a sensitive entourage. If  N f 1 , ( V , E )  is cofinite set, i.e.,  N / N f 1 , ( V , E )  is finite, then the system becomes cofinitely sensitive. The entourage is called cofinitely sensitive entourage respectively. when  N f 1 , ( V , E )  is syndetic set, i.e., there exists  N N  such that  { i , i + 1 , , i + N } N f 1 , ( V , E )  for every  i Z + , the system is called syndetically sensitive. If  N f 1 , ( V , E ) F , the system is said to be  F -sensitive. If there is an entourage  E U  such that for each  k N  and each nonempty open subsets  V 1 , , V k  of S i = 1 k N f 1 , ( V i , E ) , then the system is called multi-sensitive. The entourage E is called multi-sensitive entourage, respectively.
Definition 3
([36]). A system  ( S , f 1 , )  is said to be multi-transitive if  f 1 , [ 1 ] × f 1 , [ 2 ] × × f 1 , [ m ] : S m S m  is topologically transitive for every  m N . Equivalently, if for every collection of nonempty open subsets  U 1 , U 2 , , U m ; V 1 , V 2 , , V m  of S, there exists an  l N  such that  f 1 j l ( U j ) V j , for each  j { 1 , 2 , , m }  and for every  m N .

3. Multi-Sensitivity with Respect to a Vector for Nonautonomous Dynamical System on Uniform Spaces

This section will introduce some stronger versions of sensitivity, namely, multi-sensitivity with respect to a vector,  N -sensitive and strongly multi-sensitivity for nonautonomous dynamical systems on uniform spaces.
Definition 4.
Consider a nonautonomous dynamical system  ( S , f 1 , ) , where  ( S , U )  is a uniform space. Let  a = ( a 1 , a 2 , a r ) ( S , U )  is said to be
  • multi-sensitive with respect to  a , if there exists an entourage  D U  such that for any nonempty open subsets  U 1 , U 2 , U r  of S,  i = 1 r N f 1 , [ a i ] ( U i , D ) .
  • N -sensitive, if there exists an entourage  D U , for any  U 1 , U 2 , U r S i = 1 r N f 1 , [ i ] ( U i , D ) .
  • strongly multi-sensitive, if there is an entourage  D U ( S , f 1 , )  is multi-sensitive with respect to any vector in  N n  and any  n N .
Clearly, cofinite sensitive ⇒ strongly multi-sensitive ⇒ multi-sensitive
strongly multi-sensitive  N -sensitive
Theorem 1.
A k-periodic nonautonomous dynamical system  ( S , f 1 , )  on a Hausdorff uniform space is  N -sensitive if and only if  ( S , f k f 1 )  is as well.
Proof. 
For convenience, denote  g = f k f 1
“⇒”. Let  U 1 , U 2 , U m  be nonempty open sets of S. Assume the  ( S , g )  is  N -sensitive with respect to a entourage  D U . Suppose that  n i = 1 m N g i ( U i , D )  and  ( S , f 1 , )  is k-periodic. then  k n i = 1 m N f 1 , [ i ] ( U i , D ) .
“⇐”. Let  ( S , f 1 , )  be  N -sensitive with respect to  D U . For any non-empty open sets  U 1 , U 2 , U m , let  U i = U 1 , U k + i = U 2 , U ( m 1 ) k + i = U m , for any  1 i k .
As  ( S , f 1 , )  is  N -sensitive,  i = 1 k m N f 1 , [ i ] ( U i , D ) .  Take  n i = 1 k m N f 1 , [ i ] ( U i , D ) , using k periodicity of  ( S , f 1 , ) n i = 1 m N ( f 1 , k ) [ i ] ( U i , D ) = i = 1 n N g [ i ] ( U i , D ) .
Therefore,  i = 1 n N g [ i ] ( U i , D ) .  Thus,  ( S , g )  is  N -sensitive. □
Theorem 2.
A k-periodic nonautonomous dynamical system  ( S , f 1 , )  on Hausdorff uniform space is strongly multi-sensitive if and only if  ( S , f k f 1 )  is as well.
Proof. 
For convenience, denote  g = f k f 1 . Note that as  ( S , f 1 , )  is k-periodic,  ( f 1 k ) s = f 1 k s .
For the necessity, assume that  ( S , g )  is strongly multi-sensitive, where  g = f k f k 1 f 1 . For any vector  a = ( a 1 , a 2 , , a m ) , m N  and any non-empty open sets  U 1 , U 2 , , U m , as  ( S , g )  is multi-sensitive with respect to  a , that is, there exists an entourage  D U  such that  i = 1 m N g [ a i ] ( U i , D ) . As system  ( S , f 1 , )  is k-periodic, so  i = 1 m N g [ i ] ( U i , D ) = i = 1 m N ( f 1 k ) [ a i ] ( U i , D ) = i = 1 m N f 1 [ k a i ] ( U i , D ) , hence  i = 1 m N f 1 [ a i ] ( U i , D ) .
For the sufficiency, suppose that  ( S , f 1 , )  is strongly multi-sensitive. For any  m N  and any vector  a = ( a 1 , a 2 , , a m ) , let  U 1 , U 2 , , U m  be any nonempty open sets of S. By the hypothesis,  ( S , f 1 , )  is multi-sensitive with respect to vector  ( k a 1 , k a 2 , , k a m ) . That is, there is an entourage D in  U  such that  i = 1 m N f 1 , [ k a i ] ( U i , D ) . As  f 1 k s = ( f 1 k ) s  for, we can get  i = 1 m N ( f 1 k ) [ a i ] ( U i , D ) . Hence  i = 1 m N g [ a i ] ( U i , D ) .
Theorem 3.
A nonautonomous dynamical system  ( S , f 1 , )  on uniform space  ( S , U )  is  N -sensitive if and only if for any nonempty open sets  U 1 , U 2 , U m i = 1 m N f 1 , [ i ] ( U i , D ) F i n f , where  F i n f  denote the collection of all infinite subsets of  Z + .
Proof. 
Since sufficiency is obvious, we only need to prove necessity. Assume that  ( S , U )  is  N -sensitive with sensitive entourage  D U . We use the counterfactual. Suppose  U 1 , U 2 , U m  are any nonempty open subset of S and  i = 1 m N f 1 , [ i ] ( U i , D ) F i n f . Denote k is the maximum of the set  i = 1 m N f 1 , [ i ] ( U i , D )  and take  U ^ = D 1 n m k ( f n f n 1 f 1 ) 2 ( D ) . Given S is a uniform space, there exists an  V ^ U  such that  V ^ V ^ U ^ . Fix  z i U i  and let  U i = U i V ^ ( z i ) , 1 i m . Choose open neighhoors  W i  of  z i  with  W i U i , 1 i m . Clearly, for any  x i , y i W i ( x i , y i ) V ^ V ^ U ^ . This indicates that for any given  1 n m k ( f 1 ( n ) ( x i ) , f 1 ( n ) ( y i ) ) = ( f n f 1 ( x i ) , f n f 1 ( y i ) ) D . According to the  N -sensitivity of  f 1 , , it can be deduce the existence of and  x i , y i U i  such that  ( f 1 i ( x i ) , f 1 i ( y i ) ) D . This means  > m k > k . This contradicts with the notion that k is the maximum of the set  i = 1 m N f 1 , [ i ] ( U i , D ) . □
Remark 1.
By employing analogous reasoning, it can be confirmed that the aforementioned theorem holds true for cases of strong multi-sensitivity as well.
We subsequently demonstrate that for a modified nonautonomous dynamical system  ( S , f k , )  with a feeble open family  f 1 , , where  ( S , f k , ) = { f n } n = k N -sensitivity as well as strongly multi-sensitivity are preserved.
Theorem 4.
Assume that  ( S , U )  is a uniform space and  f 1 ,  is finitely generated, where each  f i  be surjective. If the system  ( S , f 1 , )  exhibits  N -sensitivity, it follows that the system  ( S , f k , )  also displays  N -sensitivity. Conversely, if the family  f 1 ,  is feebly open, the converse holds true as well.
Proof. 
As  ( S , f 1 , )  is  N -sensitive and by Theorem 3, there exists an entourage  D U  such that for any nonempty open sets  U 1 , U 2 , , U m S i = 1 m N f 1 , [ i ] ( U i , D ) F i n f .
Consider a set of generators  g 1 , g 2 , g s  for the  f 1 , , and let’s fix an arbitrary integer k greater than or equal to 2. Define  Γ : = 1 n 2 m k { 1 , 2 , , s } n , then take any element  α  from the set  Γ , denote  α = ( α 1 , α 2 , , α )  for  1 n 2 m k . We define the composition of these generators as  g α g α 1 g α 1 = g α .
Clearly, each map  g α , where  α Γ , exhibits uniform continuity. This observation leads us to conclude that the set  E = D α Γ ( g α × g α ) 1 ( D ) U .
As  f 1 ( k 1 )  is surjective and continuous, it follows that  V i = ( f 1 ( k 1 ) ) 1 ( U i ) , ( i = 1 , 2 , , m )  are nonempty open sets, by the  N -sensitivity of  f 1 ,  and Theorem 3,  i = 1 m N f 1 , [ i ] ( V i , D ) F i n f , there exists  x i , y i V i  and  M > 2 k  such that  ( f 1 ( i M ) ( x i ) , f 1 ( i M ) ( y i ) ) D . Denote that  x i = f 1 ( k 1 ) ( x i ) , y i = f 1 ( k 1 ) ( y i ) , i = 1 , 2 , , m . Obviously, for each  i { 1 , 2 , , m } x i , y i U i .
Note that
( f 1 ( i M ) ( x i ) , f 1 ( i M ) ( y i ) ) = ( f i M f i M 1 f k ( f 1 ( k 1 ) ( x i ) ) , f i M f i M 1 f k ( f 1 ( k 1 ) ( y i ) ) ) = ( f i M f k ( x i ) , f i M f k ( y i ) ) = ( f k i M k + 1 ( x i ) , f k i M k + 1 ( y i ) ) D .
Select a positive integer p and a non-negative integer r such that  0 r k 1  and the equation  M = p k + r  holds. note that  p 2 .
Denote that  α i = ( ( i p i + 1 ) k , ( i p i + 1 ) k + 1 , , i M ) ( i = 1 , 2 , , m ) , as  i M ( i p i + 1 ) k + 1 = i r + i k k + 1 ( 2 i 1 ) k + 1 2 i k 2 m k ( i = 1 , 2 , , m ) , then for each  i { 1 , 2 , , m } α i Γ  and  g α i = f i M f i M 1 f ( i ( p 1 ) + 1 ) k . This together with
( f k M k + 1 ( x 1 ) , f k M k + 1 ( y 1 ) ) = ( f M f p k ( f k ( p 1 ) k ( x 1 ) ) , f M f p k ( f k ( p 1 ) k ( y 1 ) ) ) = ( g α 1 ( f k ( p 1 ) k ( x 1 ) ) , g α 1 ( f k ( p 1 ) k ( y 1 ) ) ) D , ( f k 2 M k + 1 ( x 2 ) , f k 2 M k + 1 ( x 2 ) ) = ( f 2 M f ( 2 p 1 ) k ( f k 2 ( p 1 ) k ( x 2 ) ) , f 2 M f ( 2 p 1 ) k ( f k 2 ( p 1 ) k ( y 2 ) ) ) = ( g α 2 ( f k 2 ( p 1 ) k ( x 2 ) ) , g α 2 ( f k 2 ( p 1 ) k ( y 2 ) ) ) D . ( f k m M k + 1 ( x m ) , f k m M k + 1 ( y m ) ) = ( f m M f ( m p m + 1 ) k ( f k m ( p 1 ) k ( x m ) ) , f m M f ( m p m + 1 ) k ( f k m ( p 1 ) k ( y m ) ) ) = ( g α m ( f k m ( p 1 ) k ( x m ) ) , g α m ( f k m ( p 1 ) k ( y m ) ) ) D .
By the choice of E, this implies that  ( f k i ( p 1 ) k ( x i ) , f k i ( p 1 ) k ( y i ) ) E , then  ( p 1 ) k i = 1 m N f k , [ i ] ( U i , E ) .
Conversely, assume that  ( S , f k , )  is  N -sensitive with sensitive entourage  D U . For nonempty open sets  W 1 , W 2 , , W m  of S, due to the feeble openness exhibited by the family  f 1 , , it can be inferred that  W i = i n t ( f 1 ( k 1 ) ( W 1 ) ) ( 1 i m )  are nonempty open subsets of S. As  ( S , f k , )  is  N -sensitive, there exists  M i = 1 m N f k , [ i ] ( W i , D ) . This implies that there are  x i , y i W i  such that  ( f k i M ( x i ) , f k i M ( y i ) ) D .
Choose  x i , y i W  with  f 1 ( k 1 ) ( x i ) = x i  and  f 1 ( k 1 ) ( y i ) = y i . therefore
( f 1 i M + k 1 ( x i ) , f 1 i M + k 1 ( y i ) ) = ( f k i M ( f 1 ( k 1 ) ( x i ) ) , f k i M ( f 1 ( k 1 ) ( y i ) ) ) = ( f k i M ( x i ) , f k i M ( y i ) ) D .
Denote that  β i = ( i M + 1 , i M + 2 , , i M + k 2 , i M + k 1 ) Γ , therefore
( g β i ( f 1 i M ( x i ) ) , g β i ( f 1 i M ( y i ) ) ) = ( f i M + k 1 f i M + k 2 f i M + 1 ( f 1 i M ( x i ) ) , f i M + k 1 f i M + k 2 f i M + 1 ( f 1 i M ( y i ) ) ) = ( f 1 i M + k 1 ( x i ) , f 1 i M + k 1 ( y i ) ) D .
As each  g β ( β Γ )  is uniform continuous, there exists  E = D β Γ ( g β × g β ) ( 1 ) ( D ) U . This together with (3), implies that  ( f 1 i M ( x i ) , f 1 i M ( y i ) ) E ( i = 1 , 2 , , m ) M i = 1 m N f 1 , [ i ] ( W i , E ) . Therefore  ( S , f 1 , )  is  N -sensitive. □
Evidently, the aforementioned outcome holds valid in the context of strong multi-sensitivity as well.
Theorem 5.
Consider a finitely generated family  f 1 ,  on a uniform space  ( S , U ) . The pair  ( S , f 1 , )  possesses  N -sensitivity if and only if, for any  k 1 , the pair  ( S , f 1 , [ k ] )  also exhibits  N -sensitivity.
Proof. 
Sufficiency: This is readily evident.
Necessity: Consider a generator set  g 1 , g 2 , , g s  for  f 1 , , and let k be any integer greater than or equal to 2. Suppose that  f 1 ,  is  N -sensitive with the  N -sensitive entourage  D U . For nonempty open sets  U 1 , U 2 , , U m S , according to the Theorem 3,  i = 1 m N f 1 , [ i ] ( U i , D ) F i n f . Consequently, there exist elements  x i  and  y i  in  U i , where  > k , such that the pair  ( f 1 i ( x i ) , f 1 i ( y i ) )  lies outside the bounds of D, that is  ( f 1 i ( x i ) , f 1 i ( y i ) ) D . Select a positive integer p and a non-negative integer r such that  0 r k 1  and the equation  M = p k + r  holds. Denote  Γ : = 1 n m ( k + 1 ) { 1 , 2 , , s } n , For any  α Γ , where  α = ( α 1 , α 2 , , α ) , 1 m ( k + 1 ) , define  g α g α 1 = g α . Evidently, the uniform continuity holds for every  g α  where  α  belongs to the set  Γ . This leads to the implication that  E = D α Γ ( g α × g α ) 1 ( D ) U . Denote that  α i = ( i p k + 1 , i p k + 2 , , i p k + i r 1 , i p k + i r ) i = 1 , 2 , , m . Obviously,  α i Γ . Hence
( g α i ( f 1 ( i p k ) ( x i ) ) , g α i ( f 1 ( i p k ) ( y i ) ) ) = ( f i p k + i r f ( i p k + 1 ) ( f 1 ( i p k ) ( x i ) ) , f i p k + i r f ( i p k + 1 ) ( f 1 ( i p k ) ( y i ) ) ) = ( f 1 i ( p k + r ) ( x i ) , f 1 i ( p k + r ) ( y i ) ) = ( f 1 i ( x i ) , f 1 i ( y i ) ) D ( i = 1 , 2 , , m )
Due to the selection of set E, it follows that  ( f 1 i p k ( x i ) , f 1 i p k ( y i ) ) E , i.e.,  p i = 1 m N f 1 , [ i k ] ( U i , E ) , thus  ( S , f 1 , [ k ] )  is  N -sensitive. □
Remark 2.
Using analogous reasoning, it can be established that the aforementioned theorem holds valid in the context of strong multi-sensitivity as well.

4. Sufficient Condition for  N -Sensitivity

In this section, We will present certain conditions that are adequate for an infinite Hausdorff uniform space to exhibit  N -sensitivity.
Definition 5
([28]). For a sequence  f n : S S  within a uniform space  ( S , U ) f n  converges uniformly to f if for every entourage D in  U , there exists a natural number N such that, for all x in S and all  n N , the pair  ( f n ( x ) , f ( x ) ) D .
Lemma 1
([28] (Lemma 4.1)). In a Hausdorff uniform space  ( S , U ) , a map  f : S S  is uniformly continuous if and only if, for every D in  U , there exists an entourage E in  U  such that, for each  ( x , y )  of E, the pair  ( f ( x ) , f ( y ) ) D .
Lemma 2
([28] (Proposition 4.1)). Consider a Hausdorff uniform space  ( S , U ) . Assume that the sequence of maps  f n : S S  uniformly converges to f. If each individual map  f n  is uniformly continuous, it follows that the map f itself is uniformly continuous.
Lemma 3
([28] (Proposition 4.2)). Consider a Hausdorff uniform space  ( S , U ) . If the sequence of maps  f n : S S  uniformly converges to f, then for each natural number k, the k-th iteration of  f n , denoted as  f n ( k ) , also uniformly converges to the k-th power of f, denoted as  f k .
Lemma 4
([36] (Lemma 3.1)). If  ( S , f 1 , )  is multi-transitive, then the set  N : f 1 i ( U j ) V j , for each  j { 1 , 2 , , m } , for any collection of nonempty open sets  U 1 , U 2 , , U m V 1 , V 2 , , V m  is infinite.
Lemma 5
([28] (Theorem 4.1 Claim 1)). Consider an infinite Hausdorff uniform space  ( S , U )  without isolated points, and suppose the convergence of  ( S , f 1 , )  to f is uniform. Assuming that  ( S , U )  possesses a dense set of periodic points as defined by  ( P 1 ) , there exists an entourage  E U  such that, for any  x S , there exists a periodic point p of f such that, for all positive integers n, the pair  ( x , f n ( p ) )  falls outside the scope of E, denoted as  ( x , f n ( p ) ) E
Theorem 6.
Consider an infinite Hausdorff uniform space  ( S , U )  without isolated points, where the convergence of  ( S , f 1 , )  to f is uniform. If  ( S , U )  satisfies both multi-transitivity and possesses a dense set of periodic points as defined by  ( P 1 ) , then it exhibits  N -sensitivity.
Proof. 
Consider an entourage  E U  derived from Lemma 5, and select an entourage D in  U  such that D composed with itself four times, i.e.,  D D D D , is contained within E. For any nonempty open sets  U 1 , U 2 , , U m , we can find  x i U i ( i = 1 , 2 , , m ) . Since  ( S , f 1 , )  has a dense set of periodic points, there exist periodic points  p i  of  f 1 ,  such that  p i U i D [ x i ] ( i = 1 , 2 , , m ) . Suppose that the period of each  p i  is  k i ( i = 1 , 2 , , m ) . By Lemma 5, there exist periodic points  p i  of f satisfying that for all  n Z + ( x i , f n ( p i ) ) E .
Applying Lemmas 2 and 3, Consequently, we can deduce that  f j  exhibits uniform continuity for every  0 j m k , where  k = k 1 k 2 k m . This implies that for each  i { 1 , 2 , , m } , there is a small enough open set  V i  with  p i V i  such that for each  z i V i  and  0 j m k , the following equation hold:
( f j ( p i ) , f j ( z i ) ) D
By leveraging the multi-transitivity of  ( S , f 1 , )  along with the insights from Lemma 4, we can conclude that the set  n Z + : f 1 ( i n ) ( U i D [ x i ] ) V i  is of infinite size. This implies the existence of both  0 r < k  and an increasing sequence  { n } N , such that
{ k n + r : N } { n Z + : f 1 ( i n ) ( U i D [ x i ] ) V i } .
Applying Lemma 3, yield that  f i ( k n + r ) + 1 i ( k r )  converges uniformly to  f i ( k r )  as  i = 1 , 2 , , m . This indicates that there exists  L N  such that
( f i ( k n + r ) + 1 i ( k r ) ( x ^ ) , f i ( k r ) ( x ^ ) ) D
hold for all  L  and all  x ^ S . By using (4), we get that there exist  u i U i  such that
f 1 i ( k n L + r ) ( u i ) V i , i = 1 , 2 , , m .
Then by (3), we have
( f i ( k r ) ( p i ) , f i ( k r ) ( f 1 i ( k n L + r ) ( u i ) ) ) D , i = 1 , 2 , , m .
According to (5)
( f i ( k n L + r ) + 1 i ( k r ) ( f 1 i ( k n L + r ) ( u i ) ) , f i ( k r ) ( f 1 i ( k n L + r ) ( u i ) ) ) D
By (6) and (7)
( f i ( k n L + r ) + 1 i ( k r ) ( f 1 i ( k n L + r ) ( u i ) ) , f i ( k r ) ( p i ) ) D D .
i . e . , ( f 1 i k ( n L + 1 ) ( u i ) , f i ( k r ) ( p i ) ) D D , i = 1 , 2 , , m .
According to the hyperthesis,  ( x i , p i ) D  and  ( x i , f i ( k r ) ( p i ) ) E . Since  p i = f 1 i ( n L + 1 ) k ( p i ) , then  ( x i , f 1 i ( n L + 1 ) k ( p i ) ) D . Therefore
( f 1 i ( n L + 1 ) k ( p i ) , f 1 i ( n L + 1 ) k ( u i ) ) D , i = 1 , 2 , , m .
Hence  ( S , U )  is  N -sensitive. □

5. Examples

In this section, examples will be given to support the Theorems.
Example 1.
Let I be the unit interval  [ 0 , 1 ] , consider a nonautonomous dynamical system  ( I , f 1 , ) , the maps  f n ( n 1 )  are defined by
f 1 ( x ) = x , x [ 0 , 1 ] ,
f n ( x ) = 8 3 x x [ 0 , 3 8 ] 8 3 x + 2 x [ 3 8 , 3 4 ] 4 x 3 x [ 3 4 , 1 ] n 2
Denote that  f = f n ( x ) ( n 2 ) . As f is triangle-tent map, the values of  f n  alternate between 0 and 1 in the images. For any nonempty open set  U [ 0 , 1 ] , there is a large enough  n N  such that  [ 0 , 1 ]  is covered by  f n ( U ) . Hence f is sensitive. Since sensitivity is equivalent cofinite sensitivity for continuous map in the interval, then f is cofinitely sensitive. Therefore  ( [ 0 , 1 ] , f 1 , )  is cofinitely sensitive. It follows that  ( [ 0 , 1 ] , f 1 , )  is strongly multi-sensitive and  N -sensitive.
Figure 1 shows a computer simulation with an explanation of sensitivity. As can be seen in the Figure 1, the orbit of x (or y) is ergodic and disordered. The initial values  x = 0.3225  and  y = 0.3226  iterate for 3000 times, respectively, as shown by the blue and red dots, respectively. It is evident that there is a significant disparity between the iterations after a certain number of times, even with a tiny variation between the beginning values x and y ( f 1 2924 ( x ) = 0.8583 , f 1 2924 ( y ) = 0.0035 ).
Example 2.
Let I be the closed unit interval  [ 0 , 1 ]  and  f n ( n 1 )  be defined by
f 1 ( x ) = 8 5 x x [ 0 , 1 2 ] 4 5 x [ 1 2 , 1 ]
f 2 ( x ) = 4 3 x x [ 0 , 1 2 ] 2 3 x [ 1 2 , 1 ]
f n ( x ) = 1 1 2 x , n 3
As each  f n ( x ) , n 3  is tent map,  ( [ 0 , 1 ] , f 3 , )  is cofinitely sensitive. Denote that  f = f n , n 3 . Actually, for any non-empty open set  U [ 0 , 1 ] . If  0 U , since there exists  x U  and  m > 0  such that  f m ( x ) = 1 / 2 , and noting that  f ( 0 ) = f ( 1 ) = 0 , f ( 1 / 2 ) = 1 , it follows that  f n ( U ) = [ 0 , 1 ]  for  n = m + 1 . If  0 U , let J be an open interval of U. Suppose that for each  m 0 1 2 f m ( J ) , then the length of  f m ( J )  is  2 m  times the length of J. Since m increases to infinity later, there must be some  m > 0  such that the length of  f m ( J )  greater than 1. This forms a contradiction. Therefore, there exists  m 0 > 0  such that  1 2 f m 0 ( J ) . Thus, as previously stated, there is also an n such that  f n ( U ) = [ 0 , 1 ] . This implies that  ( [ 0 , 1 ] , f )  is sensitive. According to the equivalence between sensitivity and cofinite sensitivity on the interval ([6] Theorem 2),  ( [ 0 , 1 ] , f 3 , )  is cofinitely sensitive.
For any non-empty open set  U [ 1 2 , 1 ] , denote  g ( x ) = f 1 ( x )  and  h ( x ) = f 2 ( x ) , noting that  g n ( U ) = { 4 5 }  and  h n ( U ) = { 2 3 }  for any  n 0 , thus maps  f 1  and  f 2  are not feebly open. Since  { f 1 n ( x ) : x [ 1 2 , 1 ] , n 2 } = { 2 3 } ( [ 0 , 1 ] , f 1 , )  is not even sensitive. This example suggests that the condition “feebly open” is necessary in the converse of Theorem 4.

6. Conclusions

This paper introduces the concept of multi-sensitivity with respect to a vector in the context of non-autonomous dynamical systems on uniform spaces, providing an insights into  N -sensitivity and strongly multi-sensitivity, as well as their behaviors under varying conditions. Compared to previous work, this article further extends the concept of strongly sensitivity and enriches the research on strongly sensitivity. Existing research work forms the basis for our work, and our work further extends and expands upon this existing research. We acknowledge the findings and methodologies established by previous studies and use them as a starting point. Our work builds upon the foundation laid by previous research and pushes the boundaries by delving deeper into the subject matter or applying the concepts in different contexts. We presents a sufficient condition under which a nonautonomous dynamical system on an infinite Hausdorff uniform space demonstrates  N -sensitivity. However, what is a sufficient condition for a system to be strongly multi-sensitive? This is an interesting future direction of work.

Author Contributions

Conceptualization, L.J.; validation, L.W., H.W. and N.W.; formal analysis, L.J.; writing—original draft preparation, L.J.; writing—review and editing, H.W. and L.W.; supervision, H.W. and L.W.; funding acquisition, H.W. and L.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was supported by Project of Guangdong Natural Science Foundation, Grant No. 2022A1515011848; Guangzhou Philosophy and Social Science, Grant No. 2020GZYB04. Guangdong Philosophy and Social Science, Grant No. GD22YYJ15. Innovation and Cultivation Project of Zhuhai College of Science and Technology (2020XJCQ006), PhD Promotion Program of Zhuhai College of Science and the Funds for construction of key disciplines of Zhuhai College of Science and Technology (2019XJCQ001).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data will be made available on reasonable request.

Acknowledgments

The authors would like to thank all the experts who have provided valuable feedback for this article.

Conflicts of Interest

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

References

  1. Ruelle, D.; Takens, F. On the nature of turbulence. Commun. Math. Phys. 1971, 20, 167–192. [Google Scholar] [CrossRef]
  2. Auslander, J.; Yorke, J.A. Interval maps, factors of maps and chaos. Tôhoku Math. J. 1980, 32, 177–188. [Google Scholar] [CrossRef]
  3. Devaney, R.L. An Introduction to Chaotic Dynamical Systems. In Addison-Wesley Studies in Nonlinearity; Addison-Wesley Publishing Company: Redwood City, CA, USA, 1989. [Google Scholar]
  4. Banks, J.; Brooks, J.; Cairns, G.; Davis, G.; Stacey, P. On Devaney’s defnition of chaos. Am. Math. Mon. 1992, 99, 332–334. [Google Scholar] [CrossRef]
  5. Glasner, E.; Weiss, B. Sensitive dependence on initial conditions. Nonlinearity 1993, 6, 1067–1075. [Google Scholar] [CrossRef]
  6. Moothathu, T.K.S. Stronger forms of sensitivity for dynamical systems. Nonlinearity 2007, 20.9, 2115–2126. [Google Scholar] [CrossRef]
  7. Li, R. A note on stronger forms of sensitivity for dynamical systems. Chaos Soliton. Fract. 2012, 45, 753–758. [Google Scholar] [CrossRef]
  8. Liu, H.; Liao, L.; Wang, L. Thickly syndetical sensitivity of topological dynamical system. Dyn. Nat. Soc. 2014, 2014, 583431. [Google Scholar] [CrossRef]
  9. Liu, L.; Yan, X.; Wang, L. Weak-mixing implies sensitive dependence. J. Math. Anal. Appl. 2004, 299, 300–304. [Google Scholar]
  10. Xiong, J. Chaos in topologically transitive systems. Sci. China Ser. A Math. 2005, 35, 302–311. [Google Scholar] [CrossRef]
  11. Ye, X.; Huang, W.; Shao, S. An Introduction to Dynamical Systems; Science Press: Beijing, China, 2008. [Google Scholar]
  12. Miller, A.; Money, C. Syndetic sensitivity in semifows. Topol. Appl. 2015, 196, 1–7. [Google Scholar] [CrossRef]
  13. Wu, X.; Chen, G. Sensitivity and transitivity of fuzzified dynamical systems. Inf. Sci. 2017, 396, 14–23. [Google Scholar] [CrossRef]
  14. Li, J.; Oprocha, P.; Wu, X. Furstenberg families, sensitivity and the space of probability measures. Nonlinearity 2017, 30, 987–1005. [Google Scholar] [CrossRef]
  15. Ahmadi, S.A.; Wu, X.; Chen, G. Topological chain and shadowing properties of dynamical systems on uniform spaces. Topol. Appl. 2020, 275, 107153. [Google Scholar] [CrossRef]
  16. Shah, S.; Das, T.; Das, R. Distributional Chaos on Uniform Spaces. Qual. Theor. Dyn. Syst. 2020, 19, 4. [Google Scholar] [CrossRef]
  17. Wu, X.; Luo, Y.; Ma, X.; Lu, T. Rigidity and sensitivity on uniform spaces. Topol. Appl. 2019, 252, 145–157. [Google Scholar] [CrossRef]
  18. Wu, X.; Liang, S.; Ma, X.; Lu, T.; Ahmadi, S.A. The Mean Sensitivity and Mean Equicontinuity in Uniform Spaces. Int. J. Bifurcat. Chaos 2020, 30, 2050122. [Google Scholar] [CrossRef]
  19. Vasisht, R.; Das, R. Specification and shadowing properties for non-autonomous systems. J. Dyn. Control Syst. 2021, 28, 481–492. [Google Scholar] [CrossRef]
  20. Yin, Z.; He, S.; Chen, Z. Mean Li-Yorke Chaos and Mean Sensitivity in Non-autonomous Discrete Systems. J. Dyn. Control Syst. 2023, 29, 245–262. [Google Scholar] [CrossRef]
  21. Salman, M.; Das, R. Multi-sensitivity and other stronger forms of sensitivity in non-autonomous discrete systems. Chaos Soliton. Fract. 2018, 115, 341–348. [Google Scholar] [CrossRef]
  22. Yin, Z.; Xiang, Q.; Wu, X. Reiterative distributional chaos in non-autonomous discrete systems. Qual. Theor. Dyn. Syst. 2021, 20, 88. [Google Scholar] [CrossRef]
  23. Lan, Y.; Peris, A. Weak stability of non-autonomous discrete dynamical systems. Topol. Appl. 2018, 250, 53–60. [Google Scholar] [CrossRef]
  24. Jiang, Y.; Lu, T.; Pi, J.; Anwar, W. The retentivity of four kinds of shadowing properties in non-autonomous discrete dynamical systems. Entropy 2022, 24, 397. [Google Scholar] [CrossRef] [PubMed]
  25. Li, N.; Wang, L. Sensitivity and chaoticity on nonautonomous dynamical systems. Int. J. Bifurcat. Chaos 2020, 30, 2050146. [Google Scholar] [CrossRef]
  26. Vasisht, R.; Das, R. On stronger forms of sensitivity in non-autonomous systems. Taiwan J. Math. 2018, 22, 1139–1159. [Google Scholar] [CrossRef]
  27. Zhu, H.; Shi, Y.; Shao, H. Devaney Chaos in Nonautonomous Discrete Systems. Int. J. Bifurcat. Chaos 2016, 26, 1650190. [Google Scholar] [CrossRef]
  28. Salman, M.; Wu, X.; Das, R. Sensitivity of Nonautonomous Dynamical Systems on Uniform Spaces. Int. J. Bifurcat. Chaos 2021, 31, 2150017. [Google Scholar] [CrossRef]
  29. Weil, A. Sur les Espaces á Structure Uniforme et sur la Topologie Générale; Hermann: Paris, France, 1938. [Google Scholar]
  30. Engelking, R. General Topology; Polish Scientific Publishers: Warszawa, Poland, 1977. [Google Scholar]
  31. Kelley, J. General Topology; D. Van Nostrand Company: New York, NY, USA, 1955. [Google Scholar]
  32. Miralles, A.; Murillo-Arcila, M.; Sanchis, M. Sensitive dependence for nonautonomous discrete dynamical systems. J. Math. Anal. Appl. 2018, 463, 268–275. [Google Scholar] [CrossRef]
  33. Salman, M.; Das, R. Dynamics of weakly mixing nonautonomous systems. Int. J. Bifurcat. Chaos 2019, 29, 1950123. [Google Scholar] [CrossRef]
  34. Akin, E. Recurrence in Topological Dynamics, Furstenberg Families and Ellis Actions; The University Series in Mathematics; Plenum Press: New York, NY, USA, 1997. [Google Scholar]
  35. Huang, Q.; Shi, Y.; Zhang, L. Sensitivity of non-autonomous discrete dynamical systems. Appl. Math. Lett. 2015, 39, 31–34. [Google Scholar] [CrossRef]
  36. Salman, M.; Das, R. Multi-transitivity in non-autonomous discrete systems. Topol. Appl. 2020, 278, 107237. [Google Scholar] [CrossRef]
Figure 1. Chaotic behaviors of  f 1 ,  in Example 1 with the initial date  x = 0.3225 , y = 0.3226  and  n = 3000 .
Figure 1. Chaotic behaviors of  f 1 ,  in Example 1 with the initial date  x = 0.3225 , y = 0.3226  and  n = 3000 .
Entropy 26 00047 g001
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Jiao, L.; Wang, H.; Wang, L.; Wang, N. A Note on Stronger Forms of Sensitivity for Non-Autonomous Dynamical Systems on Uniform Spaces. Entropy 2024, 26, 47. https://doi.org/10.3390/e26010047

AMA Style

Jiao L, Wang H, Wang L, Wang N. A Note on Stronger Forms of Sensitivity for Non-Autonomous Dynamical Systems on Uniform Spaces. Entropy. 2024; 26(1):47. https://doi.org/10.3390/e26010047

Chicago/Turabian Style

Jiao, Lixin, Heyong Wang, Lidong Wang, and Nan Wang. 2024. "A Note on Stronger Forms of Sensitivity for Non-Autonomous Dynamical Systems on Uniform Spaces" Entropy 26, no. 1: 47. https://doi.org/10.3390/e26010047

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

Article Metrics

Back to TopTop