Next Article in Journal
Embedding Spanning Disjoint Cycles in Hypercube Networks with Prescribed Edges in Each Cycle
Previous Article in Journal
Convex (α, β)-Generalized Contraction and Its Applications in Matrix Equations
Previous Article in Special Issue
On Some Inequalities for the Generalized Euclidean Operator Radius
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Finite Chaoticity and Pairwise Sensitivity of a Strong-Mixing Measure-Preserving Semi-Flow

1
School of Mathematics and Computer Science, Guangdong Ocean University, Zhanjiang 524025, China
2
College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong 643000, China
3
Department of Mathematics, Sichuan Agricultural University, Yaan 625014, China
4
School of Science, Southwest Petroleum University, Chengdu 610500, China
*
Authors to whom correspondence should be addressed.
Axioms 2023, 12(9), 860; https://doi.org/10.3390/axioms12090860
Submission received: 22 June 2023 / Revised: 26 August 2023 / Accepted: 29 August 2023 / Published: 7 September 2023
(This article belongs to the Special Issue Symmetry of Nonlinear Operators)

Abstract

:
Chaos is a common phenomenon in nature and social sciences. As is well known, chaos has multiple definitions, and there are both differences and connections between them. The unique properties of chaotic systems can be leveraged to address challenges in communication, security, data processing, system analysis, and control across different domains. For semi-flows, this paper introduces two important concepts corresponding to discrete dynamical systems, finitely chaotic and pairwise sensitivity. Since Tent map and its induced suspended semi-flows both have these two properties, then these two concepts on the semi-flows have extensive and important applications and meanings in information security, finance, artificial intelligence and other fields. This paper extends the vast majority of corresponding results in discrete dynamical systems to semi-flows.
MSC:
37B55; 37B45; 54H20

1. Introduction

To understand chaos in a topologically transitive semi-flows, we first recall some key concepts involved in this paper. A semi-flow on a (nonempty) set M is a map φ : I × M M , I R , satisfying φ 0 ( x ) = x and φ s ( φ t ( x ) ) = φ s + t ( x ) . It is a mathematical abstraction used to describe a continuous-time dynamical system. It consists of a set (phase space) and a family of continuous functions that represent the evolution of the system over time. Each function describes the behavior of the system for positive time values. In the context of dynamical systems, finite chaoticity refers to the property of a system where chaotic behavior is observed only for a finite subset of the phase space while outside this region, the behavior may be regular or non-chaotic. Pairwise sensitivity of a strong-mixing measure refers to a property of a dynamical system, specifically a measure-preserving system, which captures the sensitivity of the system to small changes in initial conditions in a pairwise manner. A measure-preserving system means that this measure captures the probability distribution or density of points in the phase space and is preserved by the dynamics of the system. Strong mixing is a property of measure-preserving systems that indicates the rapid and complete mixing of subsets of the phase space as time progresses. Strong mixing implies that the system’s dynamics thoroughly mix the points in the phase space, resulting in a high level of randomness and unpredictability. Pairwise sensitivity refers to the sensitivity of a dynamical system to small changes in initial conditions in a pairwise manner. So, even though the overall dynamics of the system may be mixing and chaotic, the pairwise sensitivity property specifically focuses on the divergence of nearby trajectories.
Smítal [1] proved that for the tent map H ( x ) = 1 1 2 x defined on I = [ 0 , 1 ] , there exists a set C with Lebesgue outer measure μ ( C ) = 1 such that for any u , v C : u v and a periodic point p of H with p u ,
lim sup m | H m ( u ) H m ( v ) | = 1 ,
lim sup m | H m ( u ) H m ( p ) | 1 2 ,
and
lim inf m | H m ( u ) H m ( v ) | = 0 .
where m N = { 1 , 2 , } . Periodic point is p I R + = [ 0 , + ) such that H t + s ( p ) = H t ( p ) for every t I . s is called a period of H if it is the minimum positive integer which satisfying H t + s ( p ) = H t ( p ) ( t I ) . And { p , H ( p ) , H 2 ( p ) , , H s 1 ( p ) } is a period orbit of H. A stronger result than Smítal’s has been proven by Chen [2] for the tent map on space I (resp. the shift of symbolic space). Later, in [3], Xiong and Chen discusses chaotic behavior caused by strong mixing preserving measure mappings and proves that the above result in [1] is a special case. The main result is then applied to one-dimensional mappings. They also proved a statement for a topological space M satisfying the second countability axiom and an outer measure μ on M satisfying the following conditions (i)–(iii). If f : M M is a strong-mixing measure-preserving map on the probability space ( M , B ( M ) , μ ) , and { s j } j N R + is a strictly increasing sequence of positive real numbers, then there is a set C M : μ ( C ) = 1 such that C is finitely chaotic with respect to the sequence { s j } j N . Where,
(i)
any nonempty open subset V M is μ -measurable with μ ( V ) > 0 ;
(ii)
the restriction of μ to the sigma-algebra B ( M ) of Borel subsets of M is a probability space;
(iii)
for each subset V of M, there exists a Borel set A B ( M ) satisfying A V and if a Borel set B V , then A B . And then, μ ( V ) = μ ( A ) .
Furthermore, for every finite subset B C and each map G : B M , there exists a subsequence { t j } j N N of { s j } j N such that
lim j f t j ( b ) = G ( b )
for all b B .
One of the necessary conditions for various definitions of chaos [4,5,6,7,8] is sensitivity, which characterizes the unpredictability of chaos in dynamical systems, as is widely acknowledged. In recent years, there has been a widespread interest in the concept of sensitive dependence on initial conditions [5,9,10,11,12,13], which has been formalized in various ways by several authors [14,15,16,17,18]. In order to illustrate the exponential rate of divergence of neighboring point trajectories, Ref. [19] first used the phrase “sensitive dependence on initial conditions”. In a more general sense, the sensitivity property is a characterization of the dynamical behavior in which even a small change in the initial condition can result in a significant change in the resulting trajectory.
Based on the earlier work of Guckenheimer [20], Devaney [6] gave a mathematical definition of sensitivity as follows. Let H be a continuous self-map on a metric space ( M , ρ ) . H is sensitive if there is an η > 0 such that for any u M and ε > 0 , there always exists a v M with ρ ( u , v ) < ε satisfying the condition that
ρ ( H m ( u ) , H m ( v ) ) η
for some integer m. In the past few years, some authors have proposed sufficient conditions on H and ( M , ρ ) to ensure sensitivity (see [5,10,11,12,13,14,20,21,22]). In [14], the authors demonstrate that on a Borel probability space ( M , ρ , B ( M ) , μ ) of supp μ = M , if the measure preserving map H is topologically mixing (or weakly mixing), then for all non-empty open set U M , there exists a sequence { n k } k N of positive integers with positive upper density satisfying that
U ( k 0 H n k U ) ,
then it is sensitive. By proving weak-mixing to be sufficient, in [10] He reduced the conditions required for sensitive dependence on a metric probability space ( M , ρ , B ( M ) , μ ) with supp μ = M for both measure-preserving maps and measure-preserving semi-flows. Recently, Gu [23] showed that H is sensitive on a nontrivial compact metric space M if the pair ( H , μ ) satisfies the large deviation theorem (where H is continuous and topological strongly ergodic). Moreover, according to [24] (Proposition 7.2.14), topological mixing of the mapping H in [23] provides sensitivity. In addition, Ref. [16] offers some sufficient conditions for sensitivity that are more general and relaxed than the conditions presented in [10,14,23,24,25]. However, in chaos theory, sensitivity to initial conditions was first proposed with the measure of divergence of neighboring point trajectories, similar to the butterfly effect described by Lorenz (see [6]). To avoid the asymmetry in the definition of sensitivity mentioned above, the authors [18] gave the definition of pairwise sensitivity by using the tools from ergodic theory. Where, a map H : M M is topologically ergodic (briefly, ergodic) if N H ( A , B ) = { m N : H m ( A ) B } has positive upper density for any non-empty open sets A , B M . That is, lim sup k 1 k N H ( A , B ) > 0 .
The first purpose of the current research is to define the notion of finite chaos with respect to a sequence for a semi-flow (which may not be continuous), and to extend the results of Xiong and Chen in [3] to semi-flows. In particular, the following conditions are satisfied by the establishment of a topological space M with the second axiom of countability and an outer measure μ on it.
(1)
any nonempty open subset V M is μ -measurable with μ ( V ) > 0 ;
(2)
the restriction of μ to the sigma-algebra B ( M ) of Borel subsets of M is a probability space;
(3)
if ( M , B ( M ) , μ ) is a probability space with a strong-mixing measure-preserving semi-flow φ : R + × M M , then for any subset V of M, there is a Borel set A B ( M ) : A V , μ ( A ) = μ ( V ) . And then, there exists a set C M with μ ( C ) = 1 that is finitely chaotic with respect to a strictly increasing sequence { s j } j N R + . That is, for any finite subset B C and every map G : B M there exists a subsequence { t j } j N R + of { s j } j N with
lim j φ t j ( v ) = G ( v )
for any v B .
Additionally, the notion of pairwise sensitivity is presented for semi-flows on Lebesgue metric spaces in this paper. The link between pairwise sensitivity, weak mixing, and pairwise sensitivity for semi-flows is examined, along with the positiveness of metric entropy. Moreover, we also calculated the maximum sensitivity constants for specific semi-flows.

2. Preliminaries

Let M a topological space and f : M M be a map (which may not be continuous).
Definition 1
([3]). A set B M is said to be finitely chaotic with respect to the strictly increasing sequence { s j } j N N , if for all finite subsets A B and for every map G : A M there exists a subsequence { t j } j N N of { s j } j N satisfying that
lim j f t j ( u ) = G ( u )
for all u A .
The corresponding concept for a semi-flow is given as follow.
Definition 2.
Let φ : R + × M M be a semi-flow. A set A M is said to be finitely chaotic with respect to the strictly increasing sequence { s i } j N R + , if for all finite subset B A and every map G : B M there exists a subsequence { t j } j N R + of { s j } j N satisfying that
lim j φ t j ( v ) = G ( v )
for all v B .
Remark 1.
According to the definition, a set A M is finitely chaotic with respect to the sequence { s j } j N R + if and only if any finite subset B A is finitely chaotic with respect to the sequence { s j } j N R + .
By the first statement of Proposition 1 in [3], a set with finite chaos with respect to a sequence of positive integers is chaotic in the sense of Li-Yorke [26,27,28]. From the second statement of Proposition 1 in [3], for certain distinct sequences of positive integers, sets with finite chaos satisfy the conditions described by Smítal in [1]. By utilizing Proposition 1 and Remark 3 in [3], it is established that a set possessing finite chaos with respect to a sequence of positive integers is categorized as strongly chaotic (as outlined in [29]), but not necessarily chaotic (for further information on the concept of chaos, please refer to [30]). In regards to semi-flows, the following result is offered, which is similar to Proposition 1 in [3].
Proposition 1.
Let φ : R + × M M be a semi-flow, ρ is a metric on M. And let A M be a set, finitely chaotic with respect to a strictly increasing sequence { s j } j N R + . Then, for any two different points a , b A and any periodic point p of φ,
lim sup j ρ ( φ s j ( a ) , φ s j ( b ) ) = | M | ,
lim inf j ρ ( φ s j ( a ) , φ s j ( b ) ) = 0
and
lim sup j ρ ( φ s j ( a ) , φ s j ( p ) ) > 0
are held, where | M | is the diameter of M.
Proof. 
Let a , b A : a b . Choose u j , v j M ( j { 1 , 2 , } ) satisfying
lim j ρ ( u j , v j ) = | M | .
For any j { 1 , 2 , } , a map G j : { a , b } M is defined by G j ( a ) = u j and G j ( b ) = v j . For any i { 1 , 2 , } , by Definition 2, there is a subsequence { s j , i } R + of { s j } j N satisfying that
lim j φ s j , i ( a ) = u i
and
lim j φ s j , i ( b ) = v i .
And because
lim sup j ρ ( φ s j ( a ) , φ s j ( b ) ) ρ ( u i , v i ) ,
then
lim sup j ρ ( φ s j ( a ) , φ s j ( b ) ) = | M | .
Define a map G 0 : { a , b } M by G 0 ( a ) = b and G 0 ( b ) = b . Then, there is a subsequence { s j , 0 } R + of the sequence { s j } j N such that
lim j φ s j , 0 ( a ) = b
and
lim j φ s j , 0 ( b ) = b .
Hence, one has
lim inf j ρ ( φ s j ( a ) , φ s j ( b ) ) = 0 .
Let p be a periodic point of φ with p a . It is clear that if M is a periodic orbit of φ then
lim sup j ρ ( φ s j ( a ) , φ s j ( p ) ) > 0 .
Assuming that M does not represent a periodic orbit of φ , it is feasible to locate a point z M that is not included in the periodic orbit of φ where p is included. Then, there exists a subsequence { t j } j N R + of { s j } j N satisfying that
lim j φ t j ( a ) = z .
For each j { 1 , 2 , } , since φ t j ( p ) is in the periodic orbit of φ which p belongs to, then
lim sup j ρ ( φ s j ( a ) , φ s j ( p ) ) α ,
where α is the distance between p and the periodic orbit of φ containing the points z. One has that
lim sup j ρ ( φ s j ( a ) , φ s j ( p ) ) > 0 .
Thus, the proof is ended. □
In the following there is always assume that ( M , ρ ) represents a nontrivial metric space. A probability measure on ( M , B ( M ) ) is denoted by μ with B ( M ) serving as the sigma-algebra of Borel subsets of M. Thus, the space M is identified as a metric probability space and can be represented as ( M , ρ , B ( M ) , μ ) or ( M , B ( M ) , μ ) .
A measurable mapping F is said to be measure-preserving on ( M , B ( M ) , μ ) if μ ( A ) = μ ( F 1 ( A ) ) for all A B ( M ) [31]. A measurable semi-flow φ is said to be measure-preserving on ( M , B ( M ) , μ ) if
μ ( A ) = μ ( φ k 1 ( A ) )
for all A B ( M ) and all k R + .
A measure-preserving mapping F on ( M , B ( M ) , μ ) is said to be strong-mixing if for every U , V of B ( M ) ,
lim j μ ( U F j ( V ) ) = μ ( U ) μ ( V )
is held.
For semi-flows, one has the following analogous definition.
Definition 3.
Provided that ( M , B ( M ) , μ ) is a probability Lebesgue space with a metric ρ, a measure-preserving semi-flow φ can be considered as strong-mixing when
lim t μ ( U φ t 1 ( V ) ) = μ ( U ) μ ( V )
holds for all U , V of B ( M ) .
By [31], a measure-preserving mapping F on ( M , B ( M ) , μ ) is said to be weakly mixing if for every U and V of B ( M ) ,
lim m 1 m i = 0 m 1 μ ( U F i ( V ) ) μ ( U ) μ ( V ) = 0 .
Similarly, a measure-preserving semi-flow φ on ( M , B ( M ) , μ ) is said to be weakly mixing if for every U and V of B ( M ) , one has
lim t 1 t 0 t μ ( U φ s 1 ( V ) ) μ ( U ) μ ( V ) d s = 0 .
where · denotes absolute value.
A mapping F : M M (resp. a semi-flow φ) is sensitive if there exists an η > 0 satisfying that for every a M and every neighborhood V a a , there exists m N (resp. k R + ) such that sup { ρ ( F m ( a ) , F m ( b ) ) : b V a } > η (resp. sup { ρ ( φ k ( a ) , φ k ( b ) ) : b V a } > η ).
The following definition is analogous to the definition of paired sensitivities for measure-preserving maps as defined by B. Cadre and P. Jacob in [31].
Definition 4.
A semi-flow φ on a probability Lebesgue space ( M , B ( M ) , μ ) with a metric ρ is called to be paired sensitivities (relative to the initial condition) if there is an η > 0 such that for almost everywhere measure μ 2 in M × M and ( u , v ) M 2 , there exist some proper r 0 satisfying
ρ ( φ r ( u ) , φ r ( v ) ) η .
A semi-flow φ is said to be pairwise sensitive if there is an η > 0 satisfying that
μ 2 k 0 ( φ ¯ k ) 1 ( A η ) = 0 ,
where φ ¯ = φ × φ is the semi-flow on M 2 defined as
φ ¯ ( k , ( u , v ) ) = ( φ ( k , u ) , φ ( k , v ) )
for any ( u , v ) M 2 and any k 0 , and
A r = { ( u , v ) M 2 : ρ ( u , v ) r }
for any r > 0 .

3. Main Results

In order to derive the principal outcomes of this paper, we require the following three lemmas, which are semi-flow versions of Lemmas 1–3 initially presented in [3].
Lemma 1.
Let φ : R + × M M be a semi-flow (which may not be continuous), where M is a topological space, and { s j } j N R + is a strictly increasing sequence. Let Y M be dense in M and A M be a given set. If for all finite subsets B A and all mappings G : B Y there exists a subsequence { t j } j N R + of { s j } j N satisfying that
lim j φ t j ( b ) = G ( b )
for any b B , then A is a finite chaotic set with respect to the sequence { s j } j N .
Proof. 
Let G : B M be a mapping, where B A is a finite set. For every b B , let { V j ( b ) } j = 1 be a locally countable base of G ( B ) such that V j ( b ) is open, and
V j ( b ) V j + 1 ( b )
for any j { 1 , 2 , } . For each j { 1 , 2 , } , take
u j ( b ) V j ( b ) Y .
Define G j : B Y by
G j ( b ) = u j ( b )
for any b B . By the conditions of this Lemma, there is a subsequence { t j ( i ) } j N R + of { s j } j N satisfying that
lim j φ t j ( i ) ( b ) = G i ( b )
for every b B and any i { 1 , 2 , } .
Define a subsequence { t j } j N R + of { s j } j N as follows. By assumption of a base, one can choose some s k { s j } j N such that φ s k V 1 ( b ) and set t 1 = s k . Then, for a given real number t j 1 { s j } j N and for j > 1 , choose t j { s j } j N such that t j > t j 1 and φ t j ( b ) V j ( b ) for every b B . One has that
lim j φ t j ( b ) = G ( b )
for any b B . So, A is a finite chaotic set with respect to the sequence { s j } j N . □
Lemma 2.
Let φ : R + × M M be a strong-mixing semi-flow, where ( M , B ( M ) , μ ) be a probability space. Then, for each A B ( M ) with μ ( A ) > 0 and any strictly increasing sequence { s j } j N R + ,
μ j = 1 φ s j 1 ( A ) = 1 .
Proof. 
Let μ ( A ) > 0 , where A B ( M ) . Then
j = 1 φ s j 1 ( A ) B ( M ) .
Since φ : R + × M M is a strong-mixing semi-flow, then
μ ( A ) = lim j μ φ s j 1 ( A ) = lim j μ φ s j 1 ( A ) j = 1 φ s j 1 ( A ) = μ ( A ) μ ( j = 1 φ s j 1 ( A ) ) ,
which implies that
μ j = 1 φ s j 1 ( A ) = 1 .
Lemma 3.
Let ( M , B ( M ) , μ ) be a Borel probability space satisfying the condition that μ ( A ) is positive for each nonempty open subset A M which satisfies the second axiom of countability. Let { s j } j N R + be a strictly increasing sequence, and φ : R + × M M be a strong-mixing semi-flow. If C is finitely chaotic with respect to the sequence { s j } j N , and if C is countable, then there is a set E ( C ) B ( M ) satisfying that
(1) 
μ ( E ( C ) ) = 1 ;
(2) 
for any c E ( C ) , C { c } is finitely chaotic with respect to the sequence { s j } j N .
Proof. 
The discussion is divided into two cases.
(i) Assume that C is a finite set and finitely chaotic with respect to the sequence { s j } j N . Let A is a family of sets which includes all non-empty open sets of a countable base of M. Let Y be a countable dense set of M. Consider F to be the collection of all maps from C into Y. Clearly, F is countable.
Since the set C is finitely chaotic with respect to the sequence { s j } j N , then for any map G F there exists a subsequence { t j ( G ) } j N R + of the sequence { s j } j N such that
lim j φ t j ( G ) ( u ) = G ( u )
for any u C . Write
E G = A A B A ,
where
B A = n = 1 B n , A and B n , A = j = 1 n φ t j ( G ) 1 ( A ) .
Then B n , A B ( M ) for every n 1 . So, B A B ( M ) , which implies E G B ( M ) . By Lemma 2, μ ( B n , A ) = 1 for any n 1 . This means μ ( E G ) = 1 for any map G F . By the definition of the set E G , it follows that for any s E G and any y M there exists a subsequence { q j ( G ) } j N R + of { t j ( G ) } j N { s j } j N such that φ q j ( G ) ( s ) = y . So, φ q j ( G ) ( u ) = G ( u ) for any u C .
For each c E G , let
G 1 : C { u } Y
be a map such that G 1 | C = G . Then, by the above argument, there is a subsequence { q j ( G 1 ) } of { s j } j N satisfying that
lim j φ q j ( G 1 ) ( v ) = G 1 ( v )
for any v C { u } . By Lemma 1 and Definition 2, C { u } is finitely chaotic with respect to the sequence { s j } j N for any u E ( C ) , where
E ( C ) = G F E G .
Then,
E ( C ) B ( M ) and μ ( E ( C ) ) = 1 .
(ii) Assume that C is a countable set and finitely chaotic with respect to the sequence { s j } j N . Let P denotes the collection of all finite subsets of C which is evidently countable. Write
E ( C ) = C 1 P E ( C 1 ) .
Then, by the above argument and the definition of E ( C ) , one has that
E ( C ) B ( M ) and μ ( E ( C ) ) = 1 .
For any u E ( C ) , let
B E ( C ) { u }
be a finite set and G : B M be a map. If B C , then B is finitely chaotic with respect to some sequence { s j } j N . If B is not a subset of C and
B = C 1 { c }
for some c B and some C 1 C , then, by the above argument, B is finitely chaotic with respect to the sequence { s j } j N . So, there is a subsequence { q j } j N R + of the sequence { s j } j N satisfying that
lim j φ q j ( G 1 ) ( v ) = G 1 ( v )
for any v B . Thus, E ( C ) is required. □
Now Theorem 1 in [3] can be extended to semi-flows as follow.
Theorem 1.
Let ( M , B ( M ) , μ ) be a probability space satisfies that, μ ( A ) > 0 for all nonempty open subset A M fit for the second axiom of countability. Let { s j } j N R + be a strictly increasing sequence and φ : R + × M M be a strong-mixing semi-flow. Then there is a set C B ( M ) such that
(1) 
μ ( C ) = 1 ;
(2) 
for any b M and any a C , there exists a subsequence { t j } j N R + of { s j } j N satisfying
lim j φ t j ( a ) = b .
Proof. 
(1) Consider the collection A to be comprised of all non-empty open sets that form a countable base for M. Write
C = A A B A ,
where
B A = n = 1 B n , A and B n , A = j = 1 n φ t j ( F ) 1 ( A ) .
Then B n , A B ( M ) for any integer n 1 . So, B A B ( M ) , which implies C B ( M ) . By Lemma 2,
μ ( B n , A ) = 1
for any integer n 1 . This means μ ( C ) = 1 . Thus, the set C is required.
(2) By the definition of the set C, the conclusion follows immediately. □
The following theorem is the semi-flow version of Theorem 2 from [3].
Theorem 2.
Let ( M , B ( M ) , μ ) be a probability space. μ ( A ) is positive for all nonempty open subset A M satisfying the second axiom of countability. Let { s j } j N R + be a strictly increasing sequence and φ : R + × M M be a strong-mixing semi-flow. A set C M that is finitely chaotic with respect to the sequence { s j } j N can be found such that D B ( M ) and μ ( D ) > 0 imply D C .
Proof. 
The proof is similar to that of Theorem 2 in [3]. For the completeness, we provide its proof here.
Since the space M satisfies the second axiom of countability, the cardinal number | M | is smaller than that of a continuum. By the reference [8] in [3], the cardinal number | B ( M ) | is smaller than that of a continuum. Therefore, the cardinal number | F | = | { W M : W B ( M ) , μ ( W ) > 0 } | is also smaller than that of a continuum. So, F can be denoted by F = { W ν } 1 ν < Δ , where Δ represents a finite number m, or , or the first uncountable ordinal number Ω .
Define points y ν W ν for every ν with 1 ν < Δ by induction (in the case Δ = Ω , by transfinite induction) which satisfies that { y ν } 1 ν < θ is finitely chaotic with respect to the sequence { S j } j N for each θ with 1 θ < Δ .
Assume that E is a set which satisfies conditions (1) and (2) of Lemma 3. By condition (1) of Theorem 1, W 1 E . Pick y 1 W 1 E . By condition (1) of Theorem 1, { y 1 } is finitely chaotic with respect to the sequence { S j } j N . Since 1 θ < Δ , then one can pick a point y ν for every ν ( 1 ν < θ ) such that { y ν } 1 ν < λ is finitely chaotic with respect to the sequence { S j } j N for each λ with ν ( 1 λ < θ ) . Obviously, C = { y ν } 1 ν < θ is countable. It is easy to see that the set C is finitely chaotic with respect to the sequence { S j } j N . By Lemma 3, there exists a set E ( C ) which satisfies conditions (1) and (2). By condition (1) of Lemma 3, W θ E ( C ) . Take y θ W θ E ( C ) . By condition (1) of Lemma 3, the set C = { y ν } 1 ν < Δ is finitely chaotic with respect to the sequence { S j } j N . Clearly, for each D F , C D . □
The following result is the semi-flow version of Theorem 3 in [3].
Theorem 3.
Assume that M is a topological space that satisfies the second axiom of countability, μ is an outer measure on M satisfying μ ( M ) = 1 and μ ( A ) > 0 for any nonempty open subset A M , and φ : R + × M M is a strong-mixing semi-flow. If
(1) 
each open subset of M is μ-measurable, that is, each A B ( M ) is μ-measurable;
(2) 
for any subset Y M there exists a set A B ( M ) with Y A and
μ ( A ) = μ ( Y ) ,
then, for any strictly increasing sequence { s j } j N R + , there exists a C M with μ ( C ) = 1 which is finitely chaotic with respect to the sequence { s j } j N .
Proof. 
By Theorem 2, there exists a set C such that C D for any D B ( M ) with μ ( D ) > 0 . So, there exists a C ˜ B ( M ) which satisfies μ ( C ˜ ) = μ ( C ) and C ˜ C . If μ ( M C ˜ ) > 0 , then ( M C ˜ ) C . It is a contradiction. This means that μ ( M C ˜ ) = 0 . Hence, μ ( C ) = μ ( C ˜ ) = 1 . In addition, conditions (1) and (2) in Theorem 3 are easy to satisfy by an outer measure (This can be obtained from the last part of the proof of Theorem 3 in [3]). Thus, the conclusion is held. □
According to the definition of sensitive, if η > 0 is a sensitivity constant for a semi-flow φ , then η η also is a sensitivity constant. Write
( φ ) = sup { η : η is a sensitivity constant for φ }
and
β ( μ ) = sup { η : μ 2 ( A η ) < 1 } .
Since the support of μ is not a single point, there is a η > 0 such that
μ 2 ( A η ) < 1 .
Consequently, β ( μ ) > 0 .
In order to demonstrate Theorem 4, which presents the semi-flow version of Theorem 2.1 in [18], the following lemma, which corresponds to the semi-flow version of Lemma 2.1 in [18], is required.
Lemma 4.
Assume that φ is a pairwise sensitive semi-flow on ( M , ρ , B ( M ) , μ ) , where M is a nontrivial metric space. Then β ( μ ) = diam(supp μ ).
Proof. 
Since
μ 2 ( A D + δ ) = 1
for any δ > 0 , where D = diam(supp μ ) , β ( μ ) D . Write H δ = { ( x , y ) supp μ 2 : ρ ( x , y ) D 1 2 δ } for any δ > 0 . Due to H δ is a closed subset and H δ supp μ 2 = supp μ × supp μ , one has
μ 2 ( H δ ) < 1 .
And because
A D δ H δ , μ 2 ( A D δ ) < 1 ,
then, β ( μ ) D . Consequently, β ( μ ) = diam(supp μ ). □
Theorem 4.
Assume that φ is a pairwise sensitive semi-flow on ( M , ρ , B ( M ) , μ ) , where M is a nontrivial metric space. Then the following hold.
(1) 
there is an η > 0 , for almost everywhere measure μ 2 and ( a , b ) M 2 , there is a sequence ( r k ) k 0 satisfying that
ρ ( φ r k ( a ) , φ r k ( b ) ) η
for any integer k 0 ;
(2) 
for almost everywhere measure μ 2 and ( a , b ) M 2 ,
sup k 0 ρ ( φ r k ( a ) , φ r k ( b ) ) ( φ ) ;
(3) 
( φ ) diam(supp μ).
Proof. 
(1) For r 0 , let
M r 2 = r 0 φ ¯ r 1 ( a , b ) .
Write
F = M 2 ( r 0 φ ¯ r 1 ( a , b ) ) .
If ( a , b ) F , then there exists a real number sequence 0 < r 1 < r 2 < satisfying
φ ¯ r i ( ( a , b ) ) M 2
for any integer i 0 . Since
φ ¯ r j r i ( φ ¯ r i ( ( x , y ) ) ) M 2
for any integer j 0 , then for each i 0 , one has
φ ¯ r i ( ( a , b ) ) F .
It remains to show
μ 2 ( F ) = μ 2 ( M 2 ) .
In fact, since φ ¯ is a measure-preserving semi-flow,
μ 2 ( M r 2 ) = M 0 2
for all r 0 . Clearly, M 0 2 M 2 . Therefore, one can get that
μ 2 ( F ) = μ 2 ( M 2 ) .
(2) If φ is pairwise sensitive, it follows that for some sufficiently small ε > 0 ,
μ 2 t 0 φ ¯ t 1 ( A ( φ ) ε ) = 0 .
Therefore, based on a monotonicity argument, it can be concluded that
μ 2 ε > 0 t 0 φ ¯ t 1 ( A ( φ ) ε ) = lim ε 0 μ 2 t 0 φ ¯ t 1 ( A ( φ ) ε ) = 0 .
Since
ε > 0 t 0 φ ¯ t 1 ( A ( φ ) ε ) = { ( a , b ) M 2 : sup r 0 ρ ( φ r ( a ) , φ r ( b ) ) < ( φ ) } ,
for almost everywhere measure μ 2 and ( a , b ) M 2 , one has
sup k 0 ρ ( φ r k ( a ) , φ r k ( b ) ) ( φ ) .
(3) Hypothesis that
β ( μ ) < ( φ ) .
Since φ is pairwise sensitive, then
μ 2 t 0 φ ¯ t 1 ( A r ) = 0
and μ ( A r ) = 1 for all r ( β ( μ ) , ( φ ) ] . This a contradiction. Therefore,
β ( μ ) ( φ ) .
Consequently, by Lemma 4, (3) is true. □
The theorem presented below corresponds to the semi-flow version of Theorem 2.2 in [18].
Theorem 5.
Assume that M is a nontrivial metric space and φ is a weakly mixing semi-flow on ( M , ρ , B ( M ) , μ ) . Then, φ is pairwise sensitive, and ( φ ) = diam(supp μ).
Proof. 
Let δ < diam(supp μ ). Since φ is weakly mixing, then φ ¯ is weakly mixing, which implies that φ ¯ is ergodic [32]. By the definition and the ergodicity of φ ¯ , one has
μ 2 t 0 φ ¯ t 1 ( A δ ) { 0 , 1 } .
By Lemma 4,
μ 2 ( A δ ) < 1 .
So,
μ 2 t 0 φ ¯ t 1 ( A δ ) = 0 .
Consequently, φ is pairwise sensitive and ( φ ) diam(supp μ ). By Theorem 4 (3), ( φ ) = diam(supp μ ). Thus, the theorem is true. □
Obviously, for almost everywhere measure μ 2 and ( a , b ) M 2 , one has
sup t 0 ρ ( φ t ( a ) , φ t ( b ) ) diam ( supp μ ) .
Then, the following corollary is the semi-flow version of Corollary 2.1 in [18] and is a straightforward consequence of Theorem 4 (2) and Theorem 5.
Corollary 1.
Assume that M is a nontrivial metric space and φ is a weakly mixing semi-flow on ( M , ρ , B ( M ) , μ ) . Then, for almost everywhere measure μ 2 and ( x , y ) M 2 , one has
sup r 0 ρ ( φ r ( x ) , φ r ( y ) ) = diam ( supp μ ) .
Assume that ξ is a measurable countable partition of M, the metric entropy of transformation f : M M with respect to the partition ξ is denoted by h ( f , ξ ) (see [33]). It is widely accepted, although the definition of sensitivity may different, while positive metric entropy implies sensitivity (see [8,14,34]). The subsequent theorem provides a partial response in the context of pairwise sensitivity for semi-flows.
If P i M ( i = 1 , 2 , , l , l 2 ) are satisfying that P i P j = , i j , i , j { 1 , 2 , , l } and i = 1 l P i = M , then it is called that { P 1 , P 2 , , P l } is a finite partition of M.
Theorem 6.
Assume that φ is a weakly mixing semi-flow on ( M , ρ , B ( M ) , μ ) , where M is a nontrivial metric space. Taking r 0 such that φ r is ergodic. Within this context, a finite measurable partition
ξ = { P 1 , P 2 , , P l }
of M is considered.
Assuming that P 1 , P 2 , , P l are μ-continuity sets for ρ, and h ( φ r , ξ ) > 0 , then φ is pairwise sensitive.
Proof. 
Without loss of generality, it is possible to assume that
h ( φ r , ξ ) < .
Given any A B ( M ) and any ε > 0 , let A ε denote the internal ε -boundary of A, that is,
A ε = { a A : d ( a , A c ) < ε } .
Let
K ε = exp 2 l i = 1 l μ ( P i ε ) .
Since the P i are μ -continuity sets, it follows that
lim ε 0 K ε = 0 .
Therefore, one can select η > 0 such that
K η < 2 h ( φ r , ξ ) .
By Theorem 3.1 in [18] and its proof,
μ 2 n 0 ( φ r ¯ ) n ( A δ ) = 0 .
Since
n 0 ( φ r ¯ ) n ( A δ ) t 0 ( φ t ¯ ) 1 ( A δ ) ,
then
μ 2 t 0 ( φ t ¯ ) 1 ( A δ ) = 0 .
Thus, by the definition, φ is pairwise sensitive. □

4. Applications

Let a selfmap f on a compact metric space ( M , ρ ) be continuous. One can define an equivalence relation ‘∼’ in the product space [ 0 , 1 ] × M as follows. For any ( t 1 , y 1 ) , ( t 2 , y 2 ) [ 0 , 1 ] × M . ( t 1 , y 1 ) ( t 2 , y 2 ) if and only if one of the following conditions hold: (1) ( t 1 , y 1 ) = ( t 2 , y 2 ) ; (2) t 1 = 1 , t 2 = 0 and y 2 = f ( y 1 ) .
Let W = ( [ 0 , 1 ] × M ) / . By [35], W is compact and metrizable. Then the suspended semi-flow φ ( f ) induced by it on W is defined as φ ( f ) ( x 1 , [ ( x 2 , y ) ] ) = x 1 + x 2 k , f k ( y ) for any x 1 0 and any [ ( x 2 , y ) ] W with k x 1 + x 2 < k + 1 and k is a nonnegative integer.
Example 1.
For a continuous map f : M M , if A M is finitely chaotic with respect to a monotonically increasing sequence of positive integers, then for a suspended semi-flow φ ( f ) : R + × M M of f, A is also finitely chaotic with respect to a positive integers sequence. On the contrary, for a semi-flow φ ( f ) , if A is finitely chaotic with respect to a monotonically increasing unbounded sequence { s j } j N R + , then for f, A is finitely chaotic with respect to sequence { [ s j ] } j N N , where [ s j ] is the integer part of s j .
Proof. 
Let { s j } j N is a monotonically increasing sequence of positive integers and A is finitely chaotic with respect to { s j } j N . Then, for every finite subset B A and every continuous mapping G : B M , there exists a subsequence { t j } j N N of { s j } j N such that lim j f t j ( u ) = G ( u ) ( u B ) . By the definition of φ ( f ) , lim j φ t j ( u ) = G ( u ) ( u B ) . Then for φ ( f ) , A is finitely chaotic with respect to { t j } j N .
On the contrary, let { s j } j N R + is a monotonically increasing unbounded sequence, and for suspend semi-flow φ ( f ) , A is finitely chaotic with respect to { s j } j N . Then, for every finite subset B A and every continuous mapping G : B M , there exists a subsequence { t j } j N of { s j } j N such that lim j φ t j ( u ) = G ( u ) ( u B ) . By the definition of φ ( f ) , lim j f [ t j ] ( u ) = lim j φ t j ( u ) = G ( u ) ( u B ) . Thus, for f, A is finitely chaotic with respect to { [ s j ] } j N . □
Example 2.
A continuous map f : M M is pairwise sensitive if and only if its suspended semi-flow φ ( f ) : R + × M M is pairwise sensitive, and the sensitivity constants can be the same.
Proof. 
Let f is pairwise sensitive with the sensitivity constant η . Then, for almost everywhere measure μ 2 and ( a , b ) M 2 , there exists a integer r 0 such that ρ ( f r ( a ) , f r ( b ) ) η . This implies that ρ ( φ r ( f ) ( a ) , φ r ( f ) ( b ) ) η . Thus, φ ( f ) is pairwise sensitive with the sensitivity constant η .
On the contrary, if φ ( f ) is pairwise sensitive with the sensitivity constant η , then for almost everywhere measure μ 2 and ( a , b ) M 2 , there exists a real number r 0 such that ρ ( φ r ( f ) ( a ) , φ r ( f ) ( b ) ) η . So, ρ ( f [ r ] ( a ) , f [ r ] ( b ) ) η . That is, f is pairwise sensitive with the sensitivity constant η . □
Example 3.
Assume that the semi-flow φ ( f ) : R + × M M of f satisfies the conditions of Theorem 4, and { r k } k N R + is a monotonically increasing unbounded sequence, then the conclusion of Theorem 4 also holds for f and integer sequence { [ r k ] } k N .
Proof. 
By the proof of Example 2, φ ( f ) is pairwise sensitive if and only if f is pairwise sensitive. And because ρ ( φ r k ( f ) ( a ) , φ r k ( f ) ( b ) ) = ρ ( f [ r k ] ( a ) , f [ r k ] ( b ) ) ( r k R + ) , then ρ ( φ r k ( f ) ( a ) , φ r k ( f ) ( b ) ) η if and only if ρ ( f [ r k ] ( a ) , f [ r k ] ( b ) ) η . Thus, the proof is completed. □

5. Conclusions

For semi-flows, the relationship between pairwise sensitivity and weak mixing, the relationship between pairwise sensitivity and positiveness of metric entropy are studied in this research. Moreover, the largest sensitivity constant for some semi-flows is computed.
While, one may object that the present study assumes idealized conditions, such as perfect precision, complete determinism, and infinite computational resources. Real-world systems are subject to various sources of noise, uncertainties, and limitations in measurement accuracy and computational resources. The impact of these factors on the studied phenomena may need to be carefully evaluated. Finite chaotic systems are highly sensitive to parameter values and initial conditions. Different parameter regimes or initial conditions can lead to substantially different behaviors. Therefore, care must be taken to explore a range of parameter values and initial conditions to ensure the robustness and generality of the findings. This important aspect deserves to be discussed.
In addition, as is well known, fractal wavelet analysis has wide applications in fields such as communication, signal processing, and information security [36,37,38,39,40,41,42]. Chaos theory also has a very rich application in these areas. Therefore, the integration of chaos theory and fractal wavelet analysis to study and solve problems will become a hot frontier problem, and we will explore in this direction.

Author Contributions

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

Funding

This work was supported by the Cooperative Education Project of the Ministry of Education (No. 220605115023220), the Natural Science Foundation of Sichuan Province (Nos. 2023NSFSC0070, 2022NSFSC1821), the Scientific Research Project of SUSE (No. 2020RC24), the Ministry of Education Science and Technology Development Center (No. 2020QT13).

Data Availability Statement

Not applicable.

Acknowledgments

Many thanks to experts.

Conflicts of Interest

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

Sample Availability

Not applicable.

References

  1. Smítal, J. A chaotic function with some extremal properties. Proc. Am. Math. Soc. 1983, 87, 54–56. [Google Scholar] [CrossRef]
  2. Chen, E. Chaotic Dynamics on Fractals; University of Science and Technology of China: Hefei, China, 1995. [Google Scholar]
  3. Xiong, J.C.; Chen, E.C. Chaos caused by a strong-mixing measure-preserving transformation. Sci. China Ser. A 1997, 40, 253–260. [Google Scholar] [CrossRef]
  4. Li, R.S.; Wang, H.Q.; Zhao, Y. Kato’s chaos in duopoly games. Chaos Solitons Fractals 2016, 84, 69–72. [Google Scholar] [CrossRef]
  5. Bank, J.; Brooks, J.; Cairns, G.; Davis, G.; Stacey, P. On Devaney’s definition of chaos. Am. Math. Mon. 1992, 99, 332–334. [Google Scholar] [CrossRef]
  6. Devaney, R. Chaotic Dynamical Systems; Addison-Wesley: New York, NY, USA, 1989. [Google Scholar]
  7. Ghane, F.; Rezaali, E.; Sarizadeh, A. Sensitivity of iterated function systems. J. Math. Anal. Appl. 2019, 469, 493–503. [Google Scholar] [CrossRef]
  8. Auslander, J.; Yorke, J.A. Interval maps, factors of maps, and chaos. Tohoku Math. J. 1980, 32, 177–188. [Google Scholar] [CrossRef]
  9. Glasner, E.; Weiss, B. Sensitive dependence on initial conditions. Nonlinearity 1993, 6, 1067–1075. [Google Scholar] [CrossRef]
  10. He, L.F.; Yan, X.H.; Wang, L.S. Weak-mixing implies sensitive dependence. J. Math. Anal. Appl. 2004, 299, 300–304. [Google Scholar] [CrossRef]
  11. Li, R.S.; Lu, T.X.; Chen, G.R.; Yang, X.F. Further discussion on Kato’s chaos in set-valued discrete systems. J. Appl. Anal. Comput. 2020, 10, 2491–2505. [Google Scholar] [CrossRef]
  12. Wu, X.X.; Ding, X.F.; Lu, T.X.; Wang, J.J. Topological dynamics of Zadeh’s extension on upper semi-continuous fuzzy sets. Int. J. Bifurcat. Chaos 2017, 27, 1750165. [Google Scholar] [CrossRef]
  13. Li, R.S.; Lu, T.X.; Yang, X.F.; Jiang, Y.X. Study on strong sensitivity of systems satisfying the large deviations theorem. Int. J. Bifurcat. Chaos 2021, 31, 2150151. [Google Scholar] [CrossRef]
  14. Abraham, C.; Biau, G.; Cadre, B. Chaotic properties of mapping on a probability space. J. Math. Anal. Appl. 2002, 266, 420–431. [Google Scholar] [CrossRef]
  15. James, J.; Koberda, T.; Lindsey, K.; Silva, C.; Speh, P. Measurable sensitivity. Proc. Am. Math. Soc. 2008, 136, 3549–3559. [Google Scholar] [CrossRef]
  16. Xiong, J. Chaos in a topologically transitive system. Sci. China Ser. A 2005, 48, 929–939. [Google Scholar] [CrossRef]
  17. Huang, W.; Lu, P.; Ye, X.D. Measure-theoretical sensitivity and equicontinuity. Isr. J. Math. 2011, 183, 233–283. [Google Scholar] [CrossRef]
  18. Cadre, B.; Jacob, P. On pairwise sensitivity. J. Math. Anal. Appl. 2005, 309, 375–382. [Google Scholar] [CrossRef]
  19. Ruelle, D. Dynamical systems with turbulent behavior. In Mathematical Problems in Theoretical Physics; Lecture Notes in Physics; Springer: Berlin/Heidelberg, Germany, 2005. [Google Scholar]
  20. Guckenheimer, J. Sensitive dependence to initial conditions for one dimensional maps. Commun. Math. Phys. 1979, 70, 133–160. [Google Scholar] [CrossRef]
  21. Abraham, C.; Biau, G.; Cadre, B. On Lyapunov exponent and sensitivity. J. Math. Anal. Appl. 2004, 290, 395–404. [Google Scholar] [CrossRef]
  22. Billingsley, P. Convergence of Probability Measures; Wiley: New York, NY, USA, 1968. [Google Scholar]
  23. Gu, R.B. The large deviations theorem and ergodicity. Chaos Solitons Fractals 2007, 34, 1387–1392. [Google Scholar] [CrossRef]
  24. Hasselblatt, B.; Katok, A. A First Course in Dynamics; Cambridge University Press: Cambridge, UK, 2003. [Google Scholar]
  25. Lardjane, S. On some stochastic properties in Devaney’s chaos. Chaos Solitons Fractals 2006, 28, 668–672. [Google Scholar] [CrossRef]
  26. Li, T.Y.; Yorke, J. Period 3 implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar] [CrossRef]
  27. Yang, X.F.; Lu, T.X.; Anwar, W. Chaotic properties of a class of coupled mapping lattice induced by fuzzy mapping in non-autonomous discrete systems. Chaos Solitons Fractals 2021, 148, 110949. [Google Scholar]
  28. Liu, G.; Lu, T.X.; Yang, X.F.; Anwar, W. Further discussion about transitivity and mixing of continuous maps on compact metric spaces. J. Math. Phys. 2020, 61, 112701. [Google Scholar] [CrossRef]
  29. Zhou, Z.L. Chaos and total chaos. Kexue Tongbao 1988, 33, 1494–1497. [Google Scholar]
  30. Xiong, J.C. Hausdorff dimension of a chaotic set of shift of symbolic space. Sci. China Ser. A 1995, 25, 1–11. [Google Scholar]
  31. Walters, P. An Introduction to Ergodic Theory; Springer: New York, NY, USA, 1982. [Google Scholar]
  32. Li, R.S.; Shi, Y.M. Stronger forms of sensitivity for measure-preserving maps and semiflows on probability spaces. Abstr. Appl. Anal. 2014, 2014, 769523. [Google Scholar] [CrossRef]
  33. Peterson, K. Ergodic Theory; Cambridge University Press: Cambridge, UK, 1983. [Google Scholar]
  34. Blanchard, F.; Host, B.; Ruette, S. Asymptotic pairs in positive-entropy systems. Ergod. Theory Dyn. Syst. 2002, 22, 671–686. [Google Scholar] [CrossRef]
  35. Bowen, R.; Walters, P. Expansive one-parameter flows. J. Differ. Equ. 1972, 12, 180–193. [Google Scholar] [CrossRef]
  36. Guariglia, E. Fractional calculus of the Lerch zeta function. Mediterr. J. Math. 2022, 19, 109. [Google Scholar] [CrossRef]
  37. Guido, R.C.; Pedroso, F.; Contreras, R.C.; Rodrigues, L.C.; Guariglia, E.; Neto, J.S. Introducing the discrete path transform (DPT) and its applications in signal analysis, artefact removal, and spoken word recognition. Digit. Signal Process. 2021, 117, 103158. [Google Scholar] [CrossRef]
  38. Guariglia, E. Primality, fractality and image Analysis. Entropy 2019, 21, 304. [Google Scholar] [PubMed]
  39. Zheng, X.W.; Tang, Y.Y.; Zhou, J.T. A framework of adaptive multiscale wavelet decomposition for signals on undirected graphs. IEEE Trans. Signal Process. 2019, 67, 1696–1711. [Google Scholar]
  40. Guariglia, E.; Silvestrov, S. Fractional-Wavelet Analysis of Positive definite Distributions and Wavelets on D’(C); Springer: New York, NY, USA, 2016. [Google Scholar]
  41. Guariglia, E. Harmonic sierpinski gasket and applications. Entropy 2018, 20, 714. [Google Scholar] [PubMed]
  42. Cattani, C.; Guariglia, E. Fractional derivative of the Hurwitz-function and chaotic decay to zero. J. King Saud Univ. Sci. 2016, 28, 75–81. [Google Scholar]
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

Li, R.; Pi, J.; Li, Y.; Lu, T.; Wang, J.; Ding, X. Finite Chaoticity and Pairwise Sensitivity of a Strong-Mixing Measure-Preserving Semi-Flow. Axioms 2023, 12, 860. https://doi.org/10.3390/axioms12090860

AMA Style

Li R, Pi J, Li Y, Lu T, Wang J, Ding X. Finite Chaoticity and Pairwise Sensitivity of a Strong-Mixing Measure-Preserving Semi-Flow. Axioms. 2023; 12(9):860. https://doi.org/10.3390/axioms12090860

Chicago/Turabian Style

Li, Risong, Jingmin Pi, Yongjiang Li, Tianxiu Lu, Jianjun Wang, and Xianfeng Ding. 2023. "Finite Chaoticity and Pairwise Sensitivity of a Strong-Mixing Measure-Preserving Semi-Flow" Axioms 12, no. 9: 860. https://doi.org/10.3390/axioms12090860

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