You are currently viewing a new version of our website. To view the old version click .
Axioms
  • Article
  • Open Access

27 December 2023

Chaotic Characteristics in Devaney’s Framework for Set-Valued Discrete Dynamical Systems

,
and
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.
This article belongs to the Section Mathematical Analysis

Abstract

This paper focuses on the relationship between a non-autonomous discrete dynamical system (NDDS) ( H , f 1 , ) and its induced set-valued discrete dynamical systems ( K ( H ) , f ¯ 1 , ) . Specifically, it explores the chaotic properties of these systems. The main finding is that f 1 , is Devaney chaotic if and only if f ¯ 1 , is Devaney chaotic in w e -topology. The paper also provides similar conclusions for weak mixing, mixing, mild mixing, chain-transitivity, and chain-mixing in non-autonomous set-valued discrete dynamical systems (NSDDSs). Additionally, the paper proves that weak mixing implies sensitivity in NSDDSs.
MSC:
37D45; 54H20; 37B40

1. Introduction

Dynamical systems are mathematical models that evolve over time. They provide insights into the rules and behaviors that govern a collection of entities, such as numbers or states. Discrete dynamical systems play a crucial role in modeling situations where changes occur at specific intervals rather than continuously [1]. Hence, the primary objective of studying discrete dynamical systems is to gain a comprehensive understanding of how situations progress step by step over time, starting from the initial state. However, merely comprehending the movement of points in the state space is insufficient, particularly in fields like ecology, biology, and social sciences [2,3,4]. The state variables often represent groups of entities rather than individual entities. Therefore, it is significant to capture the patterns of change exhibited by the smaller paths within the state space [5].
Currently, considerable advancements have been made in autonomous set-valued discrete dynamical systems (ASDDSs). In 2003, Roman-Flores successfully demonstrated that collective transitivity implies transitivity in ASDDSs [5]. Following this, Liu in [6] presented an example that illustrated how the sensitivity of the original system does not necessarily imply sensitivity in its induced set-valued system, unless the ASDDS equipped w e -topology. Gu in [7] uncovered the connections between regularity, mixing, mild mixing, weak mixing, and totally transitivity in both systems. In [8] Liao proposed that the weak mixing of ( H , f ) implies transitivity of ( K ( H ) , f ¯ ) . In [9], extending the concept of topological conjugacy to the set-valued context, Roman-Flores and Chalco-Cano discussed the Robinson chaos in ( H , f ) and ( K ( H ) , f ¯ ) . Additionally, in [10], Gu established the equivalence between Kato’s (respectively, Ruelle-Takens) chaos of ( K ( H ) , f ¯ ) in w e -topology. In [11] Fedeli also investigated the correlation between continuous mappings on the invariant subsystems of ( K ( H ) , f ¯ ) and the original system ( H , f ) . For some other research about ASDDSs, see [12,13,14,15,16,17,18].
In numerous real-world situations, such as medicine, biology, and physics, many intricate systems are challenging to represent using autonomous frameworks. Consequently, non-autonomous discrete dynamical systems assume paramount importance [19].
However, the investigation of non-autonomous set-valued discrete dynamical systems (NSDDSs) remains considerably limited. In [20,21,22], Shao established that properties such as the specification property, mixing, the property P, and topological conjugacy equivalence are held between ( H , f 1 , ) and ( K ( H ) , f ¯ 1 , ) . Furthermore, under some specific conditions, the equivalence of Robinson chaos and Kato chaos has been demonstrated between ( H , f 1 , ) and ( K ( H ) , f ¯ 1 , ) . Additionally, examinations of the interrelationship between Li–Yorke chaos, distributional chaos, topological equi-conjugacy, and topological entropy across these two systems have been discussed.
In the current paper, we delve into an in-depth exploration of the chaotic attributes exhibited by the orbit { x , x 1 , , x n , } within the SNDDS ( K ( H ) , f ¯ 1 , ) , yielding several significant findings. The existence of transitivity (or sensitivity) in f 1 , is well-established and has been shown to be directly related to the transitivity (or sensitivity) observed in f ¯ 1 , , specifically in w e -topology. When considering the family of all nonempty compact convex subsets of H, it has been found that ( H , f 1 , ) exhibits periodic density with a periodicity of n if and only if f ¯ 1 , displays periodic density with the same periodicity of n in w e -topology. Then, we achieve chaos in the sense of Devaney for NSDDSs. Additionally, we have established correlations between the mixing properties of an NDDS and the corresponding mixing properties of the associated NSDDS and revealed a link between weak mixing and sensitivity in NSDDS. Moreover, an example is given to demonstrate that the logistic map retains sensitivity to initial values in both point systems and set-valued systems. A simple numerical simulation is conducted to deepen the understanding of this concept. These series of findings not only enrich our theoretical understanding of the characteristics of dynamic systems but also provide new perspectives and profound insights for research in the field of set theory.

2. Preliminaries

Let an infinite compact metric space denoted as ( H , d ) , and a continuous mapping sequence f i : H H denoted as f 1 , , where i N = { 1 , 2 , } . The pair ( H , f 1 , ) is referred to as a non-autonomous discrete dynamical system. For any initial value x 0 , the orbit of H under f 1 , is represented as O r b f 1 , ( x 0 ) = { f n f n 1 f 1 ( x 0 ) : n N } .
It is mentioned that an ’ ϵ neighborhood’ of a set A in a space H is defined as the set of points that are at a distance less than ϵ from A. This is denoted as N ( A , ϵ ) and can be mathematically represented as
N ( A , ϵ ) = { x H : d ( x , A ) < ϵ } .
The definition of the Hausdorff separation ρ ( A , B ) for A , B K ( H ) is
ρ ( A , B ) = inf { ϵ > 0 : A N ( B , ϵ ) } .
Furthermore, the following introduces the concept of the Hausdorff metric on K ( H ) , denoted as H ( A , B ) . This metric is defined as the maximum of the two Hausdorff separations, ρ ( A , B ) and ρ ( B , A ) . Mathematically, this can be represented as
H ( A , B ) = max { ρ ( A , B ) , ρ ( B , A ) } .
Reference [5] tell us that the metric space ( K ( H ) , H ) is complete, separable, and compact if and only if the metric space ( H , d ) is complete, separable, and compact.
In 2005, Ref. [12] discussed the topological properties of K ( H ) when it is equipped with the Vietoris topology. This topology is defined by a set of basic open sets, denoted as V ( U 1 , , U k ) , where K is an element of K ( H ) satisfying the conditions that K is a subset of the union of U 1 , , U k and K intersects with each U i for i = 1 , , k . It is important to note that each U i is a nonempty open subset of H.
The ball B ( K , ϵ ) represents a set in which the center is the point A and the radius is ϵ in the H -metric. The maps f ¯ i , which are functions from K ( H ) to K ( H ) resulting from f i for i belonging to the natural numbers, are defined as follows: f ¯ 1 n ( K ) is equal to f 1 n ( K ) , which is the set of all points obtained by applying f 1 n to each point in K. This definition holds for any K belonging to K ( H ) .
Definition 1
([22]). A set K of K ( H ) is said to be a periodic point of ( K ( H ) , H , f ¯ 1 , ) if for any natural number k, there exists a natural number n such that f ¯ 1 k ( K ) = f ¯ 1 k + n ( K ) .
Definition 2.
The mapping sequence f ¯ 1 , is considered periodic if there exists a natural number p N such that f ¯ n = f ¯ n + p for all n N . The period of f ¯ 1 , , denoted as p, is the smallest positive integer that satisfies this equation.
Definition 3
([23]). The mapping sequence f ¯ 1 , is said to be commutative in ( K ( H ) , H ) if it satisfies the condition that for any n N and K K ( H ) , f 1 n f 1 m ( x ) = f 1 m f 1 n ( x ) .
Inspired by references [24,25], we define Devaney chaos in NSDDSs as follows.
Definition 4.
The mapping sequence f ¯ 1 , is considered to be
(1) 
topologically transitive if for any nonempty open subsets U and V of K ( H ) , there exists a natural number n N such that f 1 n ( U ) V . In other words, the mapping sequence is transitive if there is a trajectory that can connect any two open subsets.
(2) 
periodically dense if the set of periodic points of f ¯ 1 , is dense in K ( H ) . This means that for any point in K ( H ) , there is a sequence of periodic points that can approximate it arbitrarily closely.
(3) 
sensitively dependent on initial conditions if there exists a positive number δ, called the sensitivity constant, such that for every point K K ( H ) and every neighborhood N of K, there exists a set M N and a non-negative integer n such that the difference between f ¯ 1 n ( M ) and f ¯ 1 n ( K ) , denoted as H ( f ¯ 1 n ( M ) , f ¯ 1 n ( K ) ), is greater than or equal to δ. In simpler terms, a small change in the initial condition can lead to a significantly different outcome after a number of iterations.
A system is referred to as transitive (respectively, other chaotic properties) system if its mapping (or mapping sequence) is transitive (respectively, other chaotic properties).
Definition 5.
The system ( K ( H ) , H , f ¯ 1 , ) is considered Devaney chaotic if it is topologically transitive, periodically dense, and sensitively dependent on initial conditions. This definition requires the property of topological transitivity, which means that there is a point in the phase space that can be arbitrarily close to any other point after a certain number of iterations. Additionally, the system should exhibit periodic density. Finally, the system must also demonstrate sensitive dependence on initial conditions, implying that small perturbations in the initial conditions can lead to significantly different trajectories.
Here are some other chaotic properties associated with Devaney chaos.
Definition 6
([7]). Let H 1 , H 2 be two infinite compact metric spaces. The system ( K ( H 1 ) , H 1 , f ¯ 1 , ) is called weakly disjoint with the system ( K ( H 2 ) , H 2 , g ¯ 1 , ) if ( K ( H 1 ) × K ( H 2 ) , H * , f ¯ 1 , × g ¯ 1 , ) is transitive, where H 1 , H 2 , and H * are metrics on K ( H 1 ) , K ( H 2 ) , and K ( H 1 ) × K ( H 2 ) , respectively.
Definition 7.
The system ( K ( H ) , H , f ¯ 1 , ) , known as an n-periodically dense system, is characterized by the density of n periodic points in K ( H ) under the action of f ¯ 1 , .
Definition 8.
The mapping sequence f ¯ 1 , is said to be
(1) 
topologically weakly mixing if, for every pair of nonempty open subsets U i , V i K ( H ) , there exists k 1 such that the images of U i under f ¯ 1 k intersect with V i , i.e., f ¯ 1 k ( U i ) V i .
(2) 
topologically mixing if, for any nonempty subsets U , V K ( H ) , there exists an integer N > 0 such that for all n N , the images of U under f ¯ n intersect with V .
(3) 
topologically mildly mixing if it exhibits weak disjointness with any transitive system.
Definition 9
([26]). Let M and N be two distinct sets in K ( H ) . An ϵ-chain of length n + 1 connecting M to N is represented by a sequence { K 0 , K 1 , , K n } , which satisfies the condition that K 0 is equivalent to M, K n is equivalent to N, and H ( f ¯ i ( K i ) , K i + 1 ) < ϵ for each i in the range 1 to n 1 .
The notation M ϵ N is used to represent the existence of both an ϵ -chain from M to N and an ϵ -chain from N to M.
Definition 10.
The system ( K ( H ) , H , f ¯ 1 , ) , is chain-transitive if there exist some ϵ > 0 such that M ϵ N for every pair of elements M , N in K ( H ) .
Definition 11.
The system ( K ( H ) , H , f ¯ 1 , ) is chain-mixing if for every pair of elements M , N in K ( H ) and any positive value ϵ > 0 , there must exist a natural number N 0 with the property that, for all integers n N 0 , it is possible to establish an ϵ-chain with a length of n connecting M and N.
Definition 12
([5]). The extension of a subset A in K ( H ) , denoted as e ( A ) , is the aggregate of all elements K in K ( H ) for which K is encompassed by A.
Lemma 1.
Let A and B are two subsets of H. Then
(1) 
the non-emptiness of set A is equivalent to the non-emptiness of the image of set A under function e;
(2) 
e ( A ) is an open subset of K ( H ) under the condition that A is an open subset of H;
(3) 
e ( A B ) = e ( A ) e ( B ) ;
(4) 
the closure of f 1 , ( A ) is included in e ( f ¯ 1 , ( A ) ) ;
(5) 
f i n ¯ = f ¯ i n ( i N ) for any positive integer n.
Proof. 
The proof of (1), (2), (3), (5) can be found in [5]. Only the proof of (4) is given here.
In fact, if K is an element of f ¯ 1 n ( e ( A ) ) , then there exists a K 1 in e ( A ) such that K is equal to f ¯ 1 n ( K 1 ) , which can also be represented as { f 1 n ( x ) | x K 1 } . By observing that K 1 is a subset of A, it can be inferred that K is also a subset of f ¯ 1 n ( A ) . In other words, K belongs to e ( f ¯ 1 n ( A ) ) . Therefore, it can be concluded that f ¯ 1 , ( e ( A ) ) is a subset of e ( f ¯ 1 , ( A ) ) . □

4. Other Chaotic Properties in Set-Valued Systems

Theorem 8.
The system ( K ( H ) , H , f ¯ 1 , ) is chain-transitive if and only if this property holds true for the system ( H , d , f 1 , ) as well.
Proof. 
(Necessity) Assume that f 1 , is chain-transitive. Let K and K be two nonempty open subsets of H. For any x in K and y in K , as well as any positive number ϵ , one has x ϵ y . That is to say, there are x 0 , x 1 , , x n H ( x 0 = x , x n = y ) with the property that d ( f i ( x i ) , x i + 1 ) < ϵ ( i = 1 , 2 , , n 1 ) . And there exists a k 1 H such that d ( k 1 , f 1 ( x ) ) < ϵ for any x K . Then, H ( { k 1 } , f ¯ 1 ( K ) ) < ϵ .
Similarly, there are { k i } , { k i + 1 } K ( H ) such that
H ( f ¯ i ( { k i } ) , { k i + 1 } ) < ϵ ( i = 2 , 3 , , n 2 ) and H ( f ¯ n 1 ( { k n 1 } ) , K ) < ϵ .
Thus, { K , { k 1 } , , { k n 1 } , K } is an ϵ -chain from K to K . In the same way, it can be proved that there is also an ϵ -chain from K to K.
Therefore, ( K ( H ) , H , f ¯ 1 , ) is chain-transitive.
(Sufficiency) By selecting any positive number ϵ and considering two elements x and y in set H, we will now provide a proof that demonstrates the existence of an ϵ -chain from x to y as well as from y to x. Let A = { x } , B = { y } . Then A , B K ( H ) . From the chain-transitivity of f ¯ 1 , , one can conclude that there exists an ϵ -chain from A to B. That is, there exist K 0 , K 1 , , K n K ( H ) with K 0 = A , K n = B and H ( f ¯ i ( K i ) , K i + 1 ) < ϵ holds for all i = 1 , 2 , , n 1 . Then
sup a f ¯ i ( K i ) d ( a , K i + 1 ) < ε ( i = 1 , 2 , , n 1 ) .
Take any a f ¯ i ( K i ) ; one has d ( a , K i + 1 ) < ϵ . There exist x i + 1 K i + 1 such that d ( a , x i + 1 ) < ϵ . And by a f ¯ i ( K i ) , one can find that there exist x i K i such that a = f i ( x i ) . Therefore, for any i = 0 , 1 , , n 1 , d ( f i ( x i ) , x i + 1 ) < ϵ , where x i K i , x i + 1 K i + 1 . Thus, { x 0 , x 1 , , x n } is an ϵ -chain from x to y.
Similarly, it can be proved that there is also an ϵ -chain from y to x.
Thus, f 1 , is chain-transitive. □
The subsequent conclusions pertain to the mixing properties of NSDDSs.
Theorem 9.
For the systems ( H , d , f 1 , ) and ( K ( H ) , H , f ¯ 1 , ) , the statements below highlight the equivalence of certain properties of them.
(1) 
( H , d , f 1 , ) exhibits weak mixing;
(2) 
( K ( H ) , H , f ¯ 1 , ) displays weak mixing;
(3) 
( K ( H ) , H , f ¯ 1 , ) demonstrates transitivity.
Proof. 
( 1 ) ( 2 ) . If the weak mixing property holds for f 1 , , then the transitivity of the m-product map
f 1 , × f 1 , × × f 1 , m - times : H × H × × H H × H × × H
is guaranteed for all m N . To demonstrate this, it suffices to establish that for any given pair of open sets V ( U 1 i , , U k i ) , V ( V 1 i , , V k i ) (where i = 1 , 2 ), within the canonical base of the Vietoris topology on K ( H ) , there exists an n N such that
f ¯ 1 n ( V ( U 1 i , , U k i ) ) V ( V 1 i , , V k i ) , i = 1 , 2 .
Indeed, if m = 2 k , there is an n N such that
f 1 n ( U j i ) V j i , i = 1 , 2 ; j = 1 , , k .
By selecting x i , j U j i in such a way that y i , j = f 1 n ( x i , j ) V j i (where i = 1 , 2 and j = 1 , , k ), we can define K 1 = { x 1 , 1 , , x 1 , k } and K 2 = { x 2 , 1 , , x 2 , k } . Consequently, we have K i V ( U 1 i , , U k i ) and f ¯ 1 n ( K i ) V ( V 1 i , , V k i ) for i = 1 , 2 . This implies that f ¯ 1 , exhibits weak mixing.
( 2 ) ( 3 ) . By the definitions of weak mixing and transitivity, it is obvious.
( 3 ) ( 1 ) . The objective is to demonstrate the existence of four distinct open sets U 1 , U 2 , V 1 , V 2 H such that there exists an n N satisfying the conditions
f 1 n ( U 1 ) V 1 and f 1 n ( U 2 ) V 2 .
By utilizing the transitivity of f ¯ 1 , , one can establish the existence of K V ( U 1 , U 2 ) and n N , which satisfying f ¯ 1 n ( K ) V ( V 1 , V 2 ) . Consequently, it follows that there exist x U 1 and y U 2 such that f 1 n ( x ) V 1 and f 1 n ( y ) V 2 . Hence, the conclusion can be drawn that f 1 , possesses the property of weak mixing. □
Theorem 10.
The mapping sequence f ¯ 1 , exhibits mixing behavior if and only if the mapping sequence f 1 , is also displaying mixing behavior.
Proof. 
(Necessity) Assume that f ¯ 1 , is mixing. Let U and V are two nonempty open subsets of H. Given that both e ( U ) and e ( V ) are nonempty open subsets of K ( H ) , it follows that there exists a positive integer N such that for any n N ,
f ¯ 1 n ( e ( U ) ) e ( V ) .
Moreover, we can observe that
f ¯ 1 n ( e ( U ) ) e ( V ) e ( f 1 n ( U ) ) e ( V ) = e ( f 1 n ( U ) V ) .
Consequently, f 1 n ( U ) V for any n N . Hence, we can infer that f 1 , is a mixing function.
(Sufficiency) Assume that f 1 , is mixing. Considering two nonempty open subsets U and V of K ( H ) , there are subsets U 1 , U 2 , , U k and V 1 , V 2 , , V k of H such that
V ( U 1 , U 2 , , U k ) U and V ( V 1 , V 2 , , V k ) V .
Given the mixing property of f 1 , , it follows that for every j { 1 , 2 , , k } , there exists a positive integer N j such that
f 1 n ( U j ) V j
for any n N j .
Assume that N is the maximum value among all N j ( 1 j k ). For any integer n greater than or equal to N, if the intersection of f 1 n ( U j ) and V j is not empty, then there exists a point x j in U j such that f 1 n ( x j ) belongs to V j for j ranging from 1 to k. Let A = { x 1 , x 2 , , x k } . It is evident that A belongs to the set K ( H ) and also lies in the set V ( U 1 , U 2 , , U k ) , which is a subset of U . Additionally, f ¯ 1 n ( A ) belongs to V ( V 1 , V 2 , , V k ) , which is also a subset of V .
Therefore, for every positive integer n N , it can be observed that there exists a nonempty set V which intersects with f ¯ 1 n ( U ) . This fact convincingly demonstrates the property of mixing for f ¯ 1 , . □
To consider the mild mixing of both systems, the precondition that f 1 , is commutative is required.
Lemma 3.
If the mapping sequence f 1 , is commutative and mildly mixing, then for any transitive system ( Ω , T ) ,
( H × H × × H k t i m e s × Ω , f 1 , × f 1 , × × f 1 , k t i m e s × T )
is transitive.
Proof. 
First, f 1 , being mildly mixing implies that f 1 , is weakly mixing. If U 1 , V 1 , U 2 , V 2 are open subsets of H, then there exists a k 0 such that f 1 k ( U 1 × U 2 ) ( V 1 × V 2 ) . This means that f 1 k ( U 1 ) V 1 and f 1 k ( U 2 ) V 2 . Let f 1 k ( U 1 ) V 1 = A 1 , f 1 k ( U 2 ) V 2 = B 1 . If n N ( A 1 , B 1 ) = { n N : f 1 n ( A 1 ) B 1 } , then
f 1 n ( f 1 k ( U 1 ) V 1 ) ( f 1 k ( U 2 ) V 2 ) .
That is to say, f 1 n ( V 1 ) V 2 and f 1 n ( f 1 k ( U 1 ) ) f 1 k ( U 2 ) . Since f 1 , is commutative, then f 1 n f 1 k = f 1 k f 1 n , which implies f 1 n ( U 1 ) U 2 . And so, N ( A 1 , B 1 ) N ( U 1 , U 2 ) N ( V 1 , V 2 ) .
By analogy, there are sets A, B in H such that
N ( A , B ) i = 1 k N ( U i , V i ) .
And because f 1 , is weakly mixing, then
N ( A , B ) N ( Ω 1 , Ω 2 )
for any Ω 1 , Ω 2 Ω .
That is to say,
[ i = 1 k N ( U i , V i ) ] N ( Ω 1 , Ω 2 )
for any Ω 1 , Ω 2 Ω .
Therefore,
( H × H × × H k t i m e s × Ω , f 1 , × f 1 , × × f 1 , k t i m e s × T )
is transitive. □
Theorem 11.
Under the condition that f 1 , exhibits commutativity, the mild mixing property is preserved by f ¯ 1 , if and only if it is preserved by f 1 , .
Proof. 
(Necessity) Assume that f ¯ 1 , is mildly mixing. For any transitive system ( Ω , T ) , it can be shown that ( H × Ω , f 1 , × T ) is also a transitive system. Let U 1 × V 1 and U 2 × V 2 be two nonempty open subsets of H × Ω . By considering the sets e ( U 1 ) × V 1 and e ( U 2 ) × V 2 in K ( H ) × Ω , which are open subsets, we can apply the fact that f ¯ 1 , × T is transitive. This means that there exists a point ( A , y ) e ( U 1 ) × V 1 and a positive integer n such that
( f ¯ 1 n × T n ) ( ( A , y ) ) = ( f ¯ 1 n ( A ) , T n ( y ) ) e ( U 2 ) × V 2 .
Then, it follows that f ¯ 1 n ( A ) e ( U 2 ) and T n ( y ) V 2 . For any point x A U 1 , we have f 1 n ( x ) f 1 n ( A ) U 2 . Therefore, if ( x , y ) U 1 × V 1 , it can be shown that
( f 1 n × T n ) ( ( x , y ) ) = ( f 1 n ( x ) , T n ( y ) ) U 2 × V 2 .
As a result, it can be concluded that ( H × Ω , f 1 , × T ) is a transitive system, which further demonstrates that f 1 , is mildly mixing.
(Sufficiency) Assume that f ¯ 1 , exhibits mild mixing properties. For any transitive system ( Ω , T ) , the subsequent discussion will demonstrate that ( K ( H ) × Ω , f ¯ 1 , × T ) can be regarded as a transitive system. Consider two nonempty open subsets U 1 × V 1 and U 2 × V 2 of K ( H ) × Ω . One can find open subsets U 1 i , U 2 i , , U k i of H such that
V ( U 1 i , U 2 i , , U k i ) U i , i = 1 , 2 .
Given the mildly mixing nature of f 1 , , it can be inferred that the system ( H × Ω , f 1 , × T ) is indeed transitive. This conclusion can be drawn by employing Lemma 3: one can find that
( H × H × × H k t i m e s × Ω , f 1 , × f 1 , × × f 1 , k t i m e s × T )
is a transitive system.
Hence, for two open subsets U 1 1 × U 2 1 × × U k 1 × V 1 and U 1 2 × U 2 2 × × U k 2 × V 2 of H × H × × H × Ω , there exists a specific point ( x 1 , x 2 , , x k , y ) U 1 1 × U 2 1 × × U k 1 × V 1 and a positive integer indicated as n such that
( f 1 n × f 1 n × × f 1 n × T n ) ( ( x 1 , x 2 , , x k , y ) ) = ( f 1 n ( x 1 ) , f 1 n ( x 2 ) , , f 1 n ( x k ) , T n ( y ) )
is in U 1 2 × U 2 2 × × U k 2 × V 2 .
Assuming B is a set consisting of elements x 1 , x 2 , , x k , then B U 1 1 , U 2 1 , , U k 1 U 1 and f ¯ n ( B ) U 1 2 , U 2 2 , , U k 2 U 2 . Therefore , ( B , y ) U 1 × V 1 and
f ¯ 1 n ( B ) × T n ( y ) = ( f ¯ 1 n × T n ) ( ( B , y ) ) U 2 × V 2 .
Hence, ( K ( H ) × Ω , f ¯ 1 , × T ) constitutes a transitive system. This demonstrates that f ¯ 1 , possesses mild mixing properties. □
Theorem 12.
The chain-mixing property is present in the system ( H , d , f 1 , ) if and only if it is also present in the system ( K ( H ) , H , f ¯ 1 , ) .
Proof. 
The conclusion can be proved using a method similar to Theorem 6. □
Furthermore, the following theorem indicates that weak mixing is stronger than sensitivity.
Theorem 13.
If the mapping sequence f ¯ 1 , is weakly mixing, then it is also sensitive.
Proof. 
Assume that f ¯ 1 , exhibits a weak mixing property. For any ϵ 0 > 0 , select two distinct sets K 1 and K 2 belonging to the set K ( H ) such that
1 8 H ( K 1 , K 2 ) = ϵ 0 .
For any set K in K ( H ) , it is established that H ( K , K 1 ) 4 ϵ 0 or H ( K , K 2 ) 4 ϵ 0 .
Assume that H ( K , K 1 ) 4 ϵ 0 , since f ¯ 1 , is weakly mixing, for any 0 ϵ ϵ 0 , there is a positive integer n such that
f ¯ 1 n ( B ϵ ( K ) ) B ϵ 0 ( K 1 ) and f ¯ 1 n ( B ϵ ( K ) ) B ϵ 0 ( K 2 ) .
Then there are two sets K 3 , K 4 B ϵ ( K ) such that f ¯ 1 n ( K 3 ) B ϵ 0 ( K 1 ) , f ¯ 1 n ( K 4 ) B ϵ 0 ( K 2 ) . So,
H ( f ¯ 1 n ( K 3 ) , f ¯ 1 n ( K ) ) + H ( f ¯ 1 n ( K 4 ) , f ¯ 1 n ( K ) ) H ( f ¯ 1 n ( K 3 ) , f ¯ 1 n ( K 4 ) ) H ( K 1 , K ) H ( K 1 , f ¯ 1 n ( K 3 ) ) H ( K , f ¯ 1 n ( K 4 ) ) 4 ϵ 0 ϵ 0 ϵ 0 = 2 ϵ 0 .
Thus,
H ( f ¯ 1 n ( K 3 ) , f ¯ 1 n ( K ) ) ϵ 0 or H ( f ¯ 1 n ( K 4 ) , f ¯ 1 n ( K ) ) ϵ 0 .
Hence, f ¯ 1 , possesses sensitivity. □
Some mappings retain certain chaotic properties when transitioning from point systems to set-valued systems. For instance, consider the hallmark characteristic ‘sensitive dependence on initial conditions’ of chaotic systems. The following example demonstrates how the logistic map maintains its sensitivity in both point and set-valued systems.
Example 1.
Consider the logistic map defined by L ( x ) = 4 x ( 1 x ) and the tent map given by
T ( x ) = 2 x for x [ 0 , 1 2 ] ; 2 ( 1 x ) for x ( 1 2 , 1 ] .
There exists a mapping h ( x ) = sin 2 ( π 2 x ) for x [ 0 , 1 ] such that the following diagram commutes.
[ 0 , 1 ] T [ 0 , 1 ] h h [ 0 , 1 ] L [ 0 , 1 ]
This indicates that T and L are topologically conjugate.
For the known fact of sensitive dependence on initial conditions of the tent map T and the fact that T and L are topologically conjugate, we can infer that L also exhibits sensitivity due to the preservation of sensitivity under topological conjugation. As established in Example 4.3 of [5], T ¯ shows sensitivity. Furthermore, Theorem 4 in [9] supports that L ¯ demonstrates this sensitivity as well, implying sensitivity of the logistic map in set-valued dynamical systems. Numerical simulations further corroborate these conclusions.
In chaotic dynamical systems, one of the key characteristics is the high sensitivity to minor variations in the initial state, leading to significantly different long-term evolutions even with slight differences in initial conditions. To explore the dynamic properties of the logistic map, this research utilizes it as a numerical tool, examining its behavior in both single-point and set-valued contexts. In the upcoming numerical simulations, we will focus on the evolution over time and through iterations of two initially proximate points within a single-point system. This observation will aid in our deep exploration and understanding of how minor initial state differences in a single-point system can impact long-term dynamic behavior.
Figure 1 shows that two initial values ( 0.5 and 0.5001 ), which are very close to each other, exhibit significantly different states ( 0.15205 and 0.91534 ) after 7632 iterations under the logistic map.
Figure 1. The sensitivity of Logistic map.
For the set-valued system, attention is directed towards a defined group of points, especially focusing on the effects of minor disturbances introduced at select locations.
From Figure 2 and Figure 3, one can observe that initially, the trajectories of the two sets of points are almost identical. However, as the number of iterations increases, the trajectories of the two point sets become completely different.
Figure 2. Trajectories of 30 equidistant points in [0.1,0.9] under the Logistic mapping (each point is randomly assigned a color).
Figure 3. Trajectories of the new points obtained by adding small perturbations 10 5 to 30 points in Figure 2 under the Logistic mapping (each new point is assigned a corresponding color).
Based on numerical simulations of the logistic map in point systems and set-valued systems, the research finds that even minimal initial differences can significantly affect the system’s long-term behavior. In point systems, initially close points evolve into different trajectories over time. In set-valued systems, as iterations increase, the initial set and its perturbed counterpart transition from similar to entirely different trajectories, highlighting the sensitivity to initial values and unpredictability inherent in chaotic systems.

5. Conclusions

The study presented in this article elucidates the interconnectedness of chaotic characteristics between the dynamic systems ( K ( H ) , f ¯ 1 , ) and ( H , f 1 , ) . It establishes that ( K ( H ) , f ¯ 1 , ) Devaney chaos aligns with that of ( H , f 1 , ) when additional specific conditions are applied. This research also substantiates that various mixing attributes of ( K ( H ) , f ¯ 1 , ) , such as weak mixing, mild mixing, chain-transitivity, and chain-mixing, correspond directly to those observed in ( H , f 1 , ) . Moreover, this paper confirms that the presence of weak mixing in ( K ( H ) , f ¯ 1 , ) inherently implies its sensitivity.
Finally, to illustrate the persistence of sensitivity in both original systems and set-valued systems within the logistic map, a simple numerical simulation is provided as an example. This demonstration highlights how the map maintains this fundamental characteristic across different system types.
This paper examines the connections between transitivity, sensitivity, mixing, and other properties of non-autonomous discrete dynamical systems and induced set-valued discrete dynamical systems. However, it does not delve into exploring stronger forms of m-transitivity and sensitivity, such as collective, ergodic, or syndetic cases. Additionally, the F -chaotic and other properties of set-valued discrete dynamical systems (both autonomous and non-autonomous) remain unaddressed in this study. These topics, however, hold significant research value and will be further discussed in our upcoming research endeavors.

Author Contributions

Conceptualization, J.Z. (Jie Zhou); validation, J.Z. (Jie Zhou); formal analysis, J.Z. (Jiazheng Zhao) and T.L.; investigation, J.Z. (Jiazheng Zhao); writing original draft, J.Z. (Jie Zhou); writing—review and editing, 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 supported by the Natural Science Foundation of Sichuan Province (No. 2023NSFSC0070) and the Scientific Research and Innovation Team Program of Sichuan University of Science and Engineering (No. SUSE652B002).

Data Availability Statement

The data that support the findings of this study are available from the corresponding author upon reasonable request.

Conflicts of Interest

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

References

  1. Robinson, R.C. An Introduction to Dynamical Systems: Continuous and Discrete; American Mathematical Society: Providence, RI, USA, 2012. [Google Scholar]
  2. Serdukova, L.; Zheng, Y.; Duan, J.; Kurths, J. Metastability for discontinuous dynamical systems under Lévy noise: Case study on Amazonian Vegetation. Sci. Rep. 2017, 7, 9336. [Google Scholar] [CrossRef] [PubMed]
  3. Lopatkin, A.J.; Collins, J.J. Predictive biology: Modelling, understanding and harnessing microbial complexity. Nat. Rev. Microbiol. 2020, 18, 507–520. [Google Scholar] [CrossRef] [PubMed]
  4. Silvia, D.C. Social movements and collective behavior: An integration of meta-analysis and systematic review of social psychology studies. Front. Psychol. 2023, 14, 1096877. [Google Scholar]
  5. Román-Flores, H. A note on transitivity in set-valued discrete systems. Chaos Solitons Fractals 2003, 17, 99–104. [Google Scholar] [CrossRef]
  6. Liu, H.; Shi, E.; Liao, G. Sensitivity of set-valued discrete systems. Nonlinear Anal. Theor. 2009, 71, 6122–6125. [Google Scholar] [CrossRef]
  7. Gu, R.; Guo, W. On mixing property in set-valued discrete systems. Chaos Solitons Fractals 2006, 28, 747–754. [Google Scholar] [CrossRef]
  8. Liao, G.; Ma, X.; Wang, L. Individual chaos implies collective chaos for weakly mixing discrete dynamical systems. Chaos Solitons Fractals 2007, 32, 604–608. [Google Scholar] [CrossRef]
  9. Román-Flores, H.; Chalco-Cano, Y. Robinson’s chaos in set-valued discrete systems. Chaos Solitons Fractals 2005, 25, 33–42. [Google Scholar] [CrossRef]
  10. Gu, R.B. Kato’s chaos in set-valued discrete systems. Chaos Solitons Fractals 2007, 31, 765–771. [Google Scholar] [CrossRef]
  11. Fedeli, A. On chaotic set-valued discrete dynamical systems. Chaos Solitons Fractals 2005, 23, 1381–1384. [Google Scholar] [CrossRef]
  12. Peris, A. Set-valued discrete chaos. Chaos Solitons Fractals 2005, 26, 19–23. [Google Scholar] [CrossRef]
  13. Luo, X.F.; Nie, X.X.; Yin, J.D. On the shadowing property and shadowable point of set-valued dynamical systems. Acta Math. Sin. 2020, 36, 1384–1394. [Google Scholar] [CrossRef]
  14. Xie, X.R.; Yin, J.D. On the eventual shadowing property and eventually shadowable point of set-valued dynamical systems. Acta Math. Sin. 2022, 38, 1105–1115. [Google Scholar] [CrossRef]
  15. Liao, G.F.; Wang, L.D.; Zhang, Y.C. Transitivity, mixing and chaos for a class of set-valued mappings. Acta Math. Sin. 2006, 49, 1–8. [Google Scholar] [CrossRef]
  16. Kloeden, P.E.; Marín-Rubio, P. Negatively invariant sets and entire trajectories of set-Valued dynamical systems. Set-Valued Var. Anal. 2011, 19, 43–57. [Google Scholar] [CrossRef]
  17. Bernardes, N.C., Jr.; Peris, A.; Rodenas, F. Set-valued chaos in linear dynamics. Integral Equ. Oper. Theory 2017, 88, 451–463. [Google Scholar]
  18. Zhang, Y.; Zhu, Y.J. Topological stability and entropy for certain set-valued maps. Acta Math. Sin. 2023. [Google Scholar] [CrossRef]
  19. Yang, X.F. Chaotic properties in the sense of Furstenberg families in set-valued discrete dynamical systems. Open J. Appl. Sci. 2021, 11, 343–353. [Google Scholar] [CrossRef]
  20. Shao, H.; Hao, Z. Chaos in non-autonomous discrete systems and their induced set-valued systems. Chaos 2019, 29, 033117. [Google Scholar] [CrossRef]
  21. Shao, H. Chaos and weak mixing on uniform spaces. Topol. Its Appl. 2023, 336, 108613. [Google Scholar] [CrossRef]
  22. Shao, H.; Chen, G.R.; Shi, Y.M. Topological conjugacy between induced non-autonomous set-valued systems and subshifts of finite type. Qual. Theor. Dyn. Syst. 2020, 19, 34. [Google Scholar] [CrossRef]
  23. Balibrea, F.; Caraballo, T.; Kloeden, P.E.; Valero, J. Recent developments in dynamical systems: Three perspectives. Int. J. Bifurc. Chaos 2010, 20, 2591–2636. [Google Scholar] [CrossRef]
  24. Anwar, W.; Lu, T.X.; Yang, X.F. Sensitivity of iterated function systems under the product operation. Results Math. 2022, 77, 185. [Google Scholar] [CrossRef]
  25. Devaney, R.L. An Introduction to Chaotic Dynamical Systems; Addison-Wesley: Redwood City, CA, USA, 1989. [Google Scholar]
  26. Good, C.; Meddaugh, J.; Mitchell, J. Shadowing, internal chain transitivity and α-limit sets. J. Math. Anal. Appl. 2020, 491, 124291. [Google Scholar] [CrossRef]
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.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.