Next Article in Journal
Intelligent Fault Diagnosis Method for Rotating Machinery Based on Recurrence Binary Plot and DSD-CNN
Previous Article in Journal
Generalized Kinetic Equations with Fractional Time-Derivative and Nonlinear Diffusion: H-Theorem and Entropy
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Furstenberg Family and Chaos for Time-Varying Discrete Dynamical Systems

1
School of Mathematic 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
South Sichuan Applied Mathematics Research Center, Zigong 643000, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Entropy 2024, 26(8), 674; https://doi.org/10.3390/e26080674
Submission received: 14 May 2024 / Revised: 8 July 2024 / Accepted: 6 August 2024 / Published: 9 August 2024
(This article belongs to the Section Complexity)

Abstract

:
Assume that ( Y , ρ ) is a nontrivial complete metric space, and that ( Y , g 1 , ) is a time-varying discrete dynamical system (T-VDDS), which is given by sequences ( g l ) l = 1 of continuous selfmaps g l : Y Y . In this paper, for a given Furstenberg family G and a given T-VDDS ( Y , g 1 , ) , G -scrambled pairs of points of the system ( Y , g 1 , ) (which contains the well-known scrambled pairs) are provided. Some properties of the set of G -scrambled pairs of a given T-VDDS ( Y , g 1 , ) are studied. Moreover, the generically G -chaotic T-VDDS and the generically strongly G -chaotic T-VDDS are defined. A sufficient condition for a given T-VDDS to be generically strongly G -chaotic is also presented.

1. Introduction

Li and Yorke [1] first presented the term “chaos”. Many scholars have since explored the Li–Yorke chaotic autonomous discrete systems (ADDSs), see, for example [1,2,3,4,5,6,7,8]. Schweizer and Smítal [9] defined another sort of chaos, which is called distributional chaos. Distributionally chaotic ADDSs have been explored greatly by lots of researchers at home and abroad (see [2,3,10,11]). In 2007, ref. [2] provided the definition of chaos via G , where G is a fixed Furstenberg family. Research has demonstrated that Li–Yorke chaos and various forms of distributional chaos can be characterized as chaos within Furstenberg families. Moreover, they explored some fundamental and important properties of the set of G -scrambled pairs of a given ADDS ( Y , g ) and provided the concepts of the generically G -chaotic ADDS and the generically strongly G -chaotic ADDS. They also determined a sufficient condition under which an ADDS can be considered generally highly chaotic. The concept of chaos, defined as ( G 1 , G 2 ) , was introduced in 2009 by [3], using a pair of Furstenberg families denoted as G 1 and G 2 . According to the findings of [3], both Li–Yorke chaos and distributional chaos fall under the umbrella of chaos within the context of Furstenberg families. In addition, they derived multiple sufficient conditions that determine if a system is ( G 1 , G 2 ) -chaotic and constructed an interesting and useful example. Furthermore, it was revealed that while an uncountable scrambled set may be foreshadowing of the second type of distributional chaos, it does not necessarily imply the presence of the first type of distributional chaos.
T-VDDSs were introduced in [12]. We know that they also appear connected to some time-varying difference equations. Chaos of T-VDDSs has been extensively studied (see [12,13,14,15,16,17,18]). For a sequence { g l } l = 1 of continuous selfmaps on [ 0 , 1 ] converging uniformly to a continuous selfmap g on [ 0 , 1 ] ; in [14], J.S. Canovas studied the limit behaviour of the T-VDDS g 1 , and whether the simplicity (resp. chaoticity) of g can deduce the simplicity (respectively chaoticity) of g 1 , . In [15], J. Dvorakova discussed a T-VDDS g 1 , on [ 0 , 1 ] , where { g l } l = 1 converges uniformly to a continuous selfmap g on [ 0 , 1 ] , and g l is a surjective continuous map of [ 0 , 1 ] for each integer l > 0 , and it is proven that for a given time-varying system g 1 , , the full Lebesgue measure of a distributional scrambled set of g 1 , does not deduce the existence of distributional chaos of the limit selfmap g of { g l } l = 1 and, conversely, that a time-varying system exists with an arbitrarily small distributional scrambled set converging to a map distributional chaotic a.e.
This work extends the results of Xiong et al. in [2] to T-VDDSs. In particular, for a given Furstenberg family and a given T-VDDS ( Y , g 1 , ) , we define G -scrambled pairs of points for the system ( Y , g 1 , ) , which contains well-known scrambled pairs. We also study some properties of the set of G -scrambled pairs of a given T-VDDS ( Y , g 1 , ) and define the generically G -chaotic T-VDDSs and the generically strongly G -chaotic T-VDDSs. Moreover, we obtain a sufficient condition for a given T-VDDS to be generically strongly G -chaotic.
In Section 2, some notations and basic concepts are recalled. Moreover, for a T-VDDS ( Y , g 1 , ) and a given Furstenberg family G , we define G -scrambled pairs of points for the system ( Y , g 1 , ) . In Section 3, our main results are established.

2. Preliminaries

Throughout this paper, Y is a complete metric space with a metric ρ , and ( Y , g 1 , ) is assumed to be a T-VDDS given by sequences ( g l ) l = 1 of continuous selfmaps g l : Y Y from the complete metric space ( Y , ρ ) to itself. Note that if g l = g for any integer l > 0 , then system ( Y , g ) is a “classical” ADDS.
For any C Y with C , let C ¯ denote the closure of C and [ C ] τ denote the set { y Y : ρ ( y , C ) < τ } for any τ > 0 . Let the diagonal Δ Y = { ( y , y ) : y Y } and ρ ˜ be the product metric on the product space Y × Y , which is defined by
ρ ˜ ( ( u 1 , v 1 ) , ( u 2 , v 2 ) ) = max { ρ ( u 1 , u 2 ) , ρ ( v 1 , v 2 ) }
for any ( u 1 , v 1 ) , ( u 2 , v 2 ) Y × Y .
For any pair ( u , v ) Y × Y and a given integer l > 0 , we provide a distribution function ψ u v ( l ) : ( , + ) [ 0 , 1 ] for a given T-VDDS ( Y , g 1 , ) by
ψ u v ( l ) ( g 1 , , t ) = 1 l j = 0 l 1 χ [ 0 , t ) ( ρ ( g 1 j ( u ) , g 1 j ( v ) ) ) .
Then, ψ u v ( l ) ( g 1 , , t ) is a non-decreasing function, ψ u v ( l ) ( g 1 , , t ) = 0 for t 0 and ψ u v ( l ) ( g 1 , , t ) = 1 for any t > d ( Y ) , where d ( Y ) is the diameter of Y. Let
ψ u v ( g 1 , , t ) = lim inf l ψ u v ( l ) ( g 1 , , t )
and
ψ u v * ( g 1 , , t ) = lim sup l ϕ u v ( l ) ( g 1 , , t ) .
Then, both functions ψ u v ( g 1 , , t ) and ψ u v * ( g 1 , , t ) are nondecreasing. Clearly, ψ u v ( g 1 , , t ) ψ u v * ( g 1 , , t ) for any t ( , + ) . If ψ u v ( g 1 , , t ) < ψ u v * ( g 1 , , t ) for all t in an interval, it is simply written as ψ u v ( g 1 , ) < ϕ u v * ( g 1 , ) .
A pair ( u , v ) Y × Y is called a scrambled pair in the distribution sense for a given T-VDDS ( Y , g 1 , ) if ψ u v * ( g 1 , ) 1 and ψ u v ( g 1 , , τ ) = 0 for some τ > 0 .
For a given τ > 0 , a pair ( u , v ) Y × Y is called a τ -scrambled pair in the distribution sense for a given T-VDDS ( Y , g 1 , ) if ψ u v * ( g 1 , ) 1 and ψ u v ( g 1 , , τ ) = 0 .
A subset S Y is called a scrambled set in the distribution sense for a given T-VDDS ( Y , g 1 , ) if any two different points in S is a scrambled pair in the distribution sense for this system.
A subset S Y is called a strongly scrambled set in the distribution sense for a given T-VDDS ( Y , g 1 , ) if there is a τ > 0 , satisfying that any ( u , v ) S × S ( u v ) is a τ -scrambled pair in the distribution sense for this system.
A T-VDDS ( Y , g 1 , ) is called Li–Yorke chaotic if there is an uncountable subset S Y , such that for any pair ( u , v ) S × S with u v ,
lim inf l ρ ( g 1 l ( u ) , g 1 l ( v ) ) = 0
and
lim sup l ρ ( g 1 l ( u ) , g 1 l ( v ) ) > 0 .
For any given τ > 0 (resp. τ = 0 ), a pair ( u , v ) Y × Y is called a τ -scrambled pair (resp. scrambled pair) in the sense of Li and Yorke for a given T-VDDS ( Y , g 1 , ) if
lim inf l ρ ( g 1 l ( u ) , g 1 l ( v ) ) = 0
and
lim sup l ρ ( g 1 l ( u ) , g 1 l ( v ) ) > τ .
A subset S Y is called a scrambled set in the sense of Li and Yorke for a given T-VDDS ( Y , g 1 , ) if any ( u , v ) S × S ( u v ) is a scrambled pair in the sense of Li and Yorke for this system.
A subset S Y is called a strongly scrambled set in the sense of Li and Yorke for a given T-VDDS ( Y , g 1 , ) if there is a τ > 0 satisfying that any ( u , v ) S × S ( u v ) is a τ -scrambled pair in the sense of Li and Yorke for this system.
Let Z + = { 1 , 2 , } and Q = { G | G Z + } . A collection G Q is said to be a Furstenberg family if it is hereditary upwards, that is, G 1 G 2 and G 1 G implies G 2 G .
Let B = { B Q : | B | = + } , where | B | denotes the cardinality of a set B. Clearly, B is a Furstenberg family.
Let I = { k 1 < k 2 < } Z + be an infinite subset, and let
ν * ( I ) = lim sup n | I { 1 , 2 , , n } | n ,
then, ν * ( I ) is the upper density of I Z + . It is clear that ν * ( I ) = lim sup j j k j .
For any a [ 0 , 1 ] , let
M ¯ ( a ) = { G B : ν * ( G ) a } .
Clearly, M ¯ ( 0 ) = B .
For a given T-VDDS ( Y , g 1 , ) , any B Y and any y Y , we write
N ( y , B , g 1 , ) = { k Z + : g 1 k ( y ) B } .
For a given Furstenberg family G and B Y with B , a point y Y is an G -attaching point of B for a given T-VDDS ( Y , g 1 , ) if N ( y , B , g 1 , ) G , and that
G ( B , g 1 , ) = G G k G f 1 k ( B )
is the G -attaching set of B for the system ( Y , g 1 , ) . Obviously, G ( B , g 1 , ) is the set of all G -attaching points of B for the system ( Y , g 1 , ) . A point y Y is an G -adherent point of B for a given T-VDDS ( Y , g 1 , ) , if N ( y , [ B ] τ , G 1 , ) G for any τ > 0 . Let
α G ( B , g 1 , ) = { y Y : N ( y , [ B ] τ , g 1 , ) G , τ > 0 } .
A point y Y is called an G -adherent point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if y is an G -attaching point of the set [ B ] τ for this system. For a given τ > 0 , a point y Y is called an G - τ -escape point of a given set B Y for a given T-VDDS ( Y , g 1 , ) , y is an G -attaching point of the set y [ B ] τ ¯ for this system. A point y Y is called an G -escape point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if y is an G -attaching point of the set Y [ B ] τ ¯ for some τ > 0 and this system. A point y Y is called an G -reciprocating point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if it is both an G -adherent point and an G -escape point of the set B for this system. A point y Y is said to be an G - τ -reciprocating point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if it is both an G -adherent point and an G - τ -escape point of the set B for this system. Let α G ( B , g 1 , ) (resp. ϵ G ( B , g 1 , ) , ϵ G ( B , δ , g 1 , ) , θ G ( B , g 1 , ) or θ G ( B , δ , g 1 , ) ) be the set of G -adherent points (resp. G -escape points, G - τ -escape points, G -reciprocating points or G - τ -reciprocating points) of a given set B Y for a given T-VDDS ( Y , g 1 , ) . Clearly, from the definitions, one has
α G ( B , g 1 , ) = τ > 0 G ( [ B ] τ , g 1 , ) = l = 1 G ( [ B ] 1 l , g 1 , ) ,
ϵ G ( B , τ , g 1 , ) = G ( Y [ B ] τ ¯ , g 1 , ) ,
ϵ G ( B , g 1 , ) = τ > 0 ϵ G ( B , τ , g 1 , ) ,
θ G ( B , τ , g 1 , ) = α G ( B , g 1 , ) ϵ G ( B , τ , g 1 , )
and
θ G ( B , g 1 , ) = α G ( B , g 1 , ) ϵ G ( B , g 1 , ) .
For a given T-VDDS ( Y , g 1 , ) , an G -reciprocating point (resp. G - τ -reciprocating point) of the diagonal Δ Y for the product system ( Y × Y , g 1 , × g 1 , ) is called an G -scrambled pair (resp. G - τ -scrambled pair) of the system ( Y , g 1 , ) . A subset S Y is called an G -scrambled scrambled set for a given T-VDDS ( Y , g 1 , ) if any ( u , v ) S × S ( u v ) is an G -scrambled pair of this system. A subset S Y is called a strongly G -scrambled scrambled set for a given T-VDDS ( Y , g 1 , ) if there is a τ > 0 such that any two different points in S is an G - τ -scrambled pair of this system. A given T-VDDS ( Y , g 1 , ) is called generically G -chaotic if the set of all G -scrambled pairs of this system is a G δ set, which is dense in Y × Y . A given T-VDDS ( Y , g 1 , ) is called generically strongly G -chaotic if there is a τ > 0 , satisfying that the set of all G - τ -scrambled pairs of this system is a G δ set, which is dense in Y × Y .

3. Main Results

In this section, some results of Xiong et al. in [2] are extended to T-VDDSs.

3.1. Furstenberg Families Compatible with a T-VDDS

For a given T-VDDS ( Y , g 1 , ) and any A , B Y , we write
N g 1 , ( A , B ) = { k Z + : B ( g 1 k ( A ) ) 1 } = { k Z + : g 1 k ( B ) A } .
If A = { y } , we write N g 1 , ( y , B ) = N g 1 , ( A , B ) . For a given Furstenberg family G and B Y with B , a point y Y is an G -attaching point of B for a given T-VDDS ( Y , g 1 , ) if N g 1 , ( y , B ) G , and
G ( B , g 1 , ) = G G k G ( g 1 k ( B ) ) 1
is the G -attaching set of B for the system ( Y , g 1 , ) .
Theorem 1.
Assume that G is a Furstenberg family, and that ( Y , g 1 , ) is a T-VDDS and B Y . Then, we have
G ( B , g 1 , ) = G κ G k G ( g 1 k ( B ) ) 1 .
Proof. 
Clearly,
y G κ G k G ( g 1 k ( B ) ) 1
, if and only if for any G κ G , one can find k F with y ( g 1 k ( B ) ) 1 , if and only if N g 1 , ( y , B ) κ κ G = G . So,
G κ G k G ( g 1 k ( B ) ) 1 G ( B , g 1 , ) .
Assume that
y G ( B , g 1 , ) .
Then,
y G G k G ( g 1 k ( B ) ) 1
, if and only if there is a G κ G with y ( g 1 k ( B ) ) 1 for any k G , if and only if there is a G κ G such that N g 1 , ( y , B ) G . So,
G κ G k G ( g 1 k ( B ) ) 1 G ( B , g 1 , ) .
Thus, the proof is finished. □
A Furstenberg family G is called compatible with a given T-VDDS ( Y , g 1 , ) , if for any given open set F Y , the set G ( F , g 1 , ) is a G δ set.
Theorem 2.
Assume that G is a Furstenberg family, and that ( Y , g 1 , ) is a T-VDDS. If κ G is countably generated and proper or if G = M ¯ ( t ) for some t [ 0 , 1 ] , then the family G is compatible with the system ( Y , g 1 , ) .
Proof. 
Assume that F Y is open. If κ G is countably generated and proper, from the definition, there is C Q , which generates κ G . From Theorem 1,
G ( F , g 1 , ) = G κ G k G ( g 1 k ( F ) ) 1 = G C k G ( g 1 k ( F ) ) 1 .
This means G ( F , g 1 , ) is a G δ set.
Assume that G = M ¯ ( t ) for some t [ 0 , 1 ] . Clearly, the theorem holds for t = 0 . For any t ( 0 , 1 ] and any open set F Y , we have
G ( F , g 1 , ) = y Y : lim sup m j Z + : y ( g 1 j ( F ) ) 1 , 1 j m , m Z + m t = y Y : lim sup m j Z + : y ( g 1 j ( F ) ) 1 , 1 j m , m Z + m > t 1 k , k Z + .
Obviously, for any k , n Z + and any t ( 0 , 1 ] there are positive integers m > n and l { 1 , 2 , , m } such that t 1 k < l m t . So,
y Y : lim sup p j Z + : y ( g 1 j ( F ) ) 1 , 1 j p , p Z + m l m , k Z +
implies that there are positive integers r 1 , r 2 , , r l with 1 r 1 < r 2 < < r l m and g 1 r i ( y ) F for any i { 1 , 2 , , l } . Consequently,
G ( F , g 1 , ) = k Z + n Z + m = n + 1 l Θ m ( r 1 , r 2 , , r l ) Δ l , m i = 1 l ( g 1 r i ( F ) ) 1 ,
where
Θ m = { l Z + : t 1 k < l m t , 1 l m , m Z + }
and
Δ l , m = { ( r 1 , r 2 , , r l ) : 1 r 1 < r 2 < < r l m , m Z + } .
This means that G ( F , g 1 , ) is a G δ set. Thus, the proof is finished. □

3.2. The Sets of G -Reciprocating Points for a T-VDDS

A point y Y is called an G -adherent point of a given set B Y for a given T-VDDS ( Y , g 1 , ) , if for any τ > 0 , y is an G -attaching point of the set [ B ] τ for this system. For a given τ > 0 , a point y Y is called an G - τ -escape point of a given set B Y for a given T-VDDS ( Y , g 1 , ) , y is an G -attaching point of the set Y [ B ] τ ¯ for this system. A point y Y is called an G -escape point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if y is an G -attaching point of the set Y [ B ] τ ¯ for some τ > 0 and this system. A point y Y is called an G -reciprocating point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if it is both an G -adherent point and an G -escape point of the set B for this system. A point y Y is called an G - τ -reciprocating point of a given set B Y for a given T-VDDS ( Y , g 1 , ) if it is both an G -adherent point and an G - τ -escape point of the set B for this system. Let α G ( B , g 1 , ) (resp. ϵ G ( B , g 1 , ) , ϵ G ( B , τ , g 1 , ) , θ G ( B , g 1 , ) or θ G ( B , τ , g 1 , ) ) be the set of G -adherent points (resp. G -escape points, G - τ -escape points, G -reciprocating points or G - τ -reciprocating points) of a given set B Y for a given T-VDDS ( Y , g 1 , ) . Clearly, from the definitions, we have
α G ( B , g 1 , ) = τ > 0 G ( [ B ] τ , g 1 , ) = k = 1 G ( [ B ] 1 k , g 1 , ) ,
ϵ G ( B , τ , g 1 , ) = G ( Y [ B ] τ ¯ , g 1 , ) ,
ϵ G ( B , g 1 , ) = τ > 0 ϵ G ( B , τ , g 1 , ) ,
θ G ( B , τ , g 1 , ) = α G ( B , g 1 , ) ϵ G ( B , τ , g 1 , )
and
θ G ( B , g 1 , ) = α G ( B , g 1 , ) ϵ G ( B , g 1 , ) .
Theorem 3.
Assume that G is a Furstenberg family, and that ( Y , g 1 , ) is a T-VDDS. If G is compatible with the system ( Y , g 1 , ) , then the following hold:
(1)
α G ( B , g 1 , ) is a G δ set for any B Y .
(2)
θ G ( B , τ , g 1 , ) is a G δ set for any B Y and any τ > 0 .
Proof. 
From the condition, the set G ( F , g 1 , ) is a G δ set for any open set F Y . As
α G ( B , g 1 , ) = k = 1 G ( [ B ] 1 k , g 1 , ) ,
α G ( B , g 1 , ) is a G δ set. As
ϵ G ( B , τ , g 1 , ) = G ( Y [ B ] τ ¯ , g 1 , )
and
θ G ( B , τ , g 1 , ) = α G ( B , g 1 , ) ϵ G ( B , τ , g 1 , ) ,
θ G ( B , τ , g 1 , ) is a G δ set. Thus, the proof is ended. □
Let C , D Y . C and D are said to be positively disjoint if ρ ( C , D ) is positive.
Theorem 4.
Assume that A , B Y , A, and B are positively disjoint, G is a Furstenberg family, and ( Y , g 1 , ) is a T-VDDS. If G is compatible with the system ( Y , g 1 , ) , then the following holds:
(1)
α G ( B , g 1 , ) ϵ G ( A , τ , g 1 , ) for some τ > 0 .
(2)
θ G ( A , τ , g 1 , ) α G ( A , g 1 , ) α G ( B , g 1 , ) for some τ > 0 .
Proof. 
As A and B are positively disjointed, there is some τ > 0 with [ A ] τ ¯ [ B ] τ ¯ = . So, one has
α G ( B , g 1 , ) = ε > 0 G G n G ( g 1 n ( [ B ] τ ) ) 1 G G n G ( g 1 n ( [ B ] τ ) ) 1 G G n G ( g 1 n ( Y [ A ] τ ¯ ) ) 1 .
This implies that
α G ( B , g 1 , ) ϵ G ( A , τ , g 1 , )
and θ G ( A , τ , g 1 , ) α G ( A , g 1 , ) α G ( B , g 1 , ) . □
Theorem 5.
Assume that A Y is nonempty, G is a Furstenberg family, and ( Y , g 1 , ) bis a T-VDDS. If G is compatible with the system ( Y , g 1 , ) , then one can find B Y with B and ρ ( A , B ) > 0 , satisfying that α G ( A , g 1 , ) and α G ( B , g 1 , ) are dense in Y, if and only if θ G ( A , ε , g 1 , ) is a G δ dense set in Y for some ε > 0 .
Proof. 
Assume that there is a B Y with B , ρ ( A , B ) > 0 , and α G ( A , g 1 , ) and α G ( B , g 1 , ) are dense in Y. From Theorem 3, α G ( A , g 1 , ) and α G ( B , g 1 , ) are G δ dense sets in Y. From Theorem 4, θ G ( A , ε , g 1 , ) α G ( A , g 1 , ) α G ( B , g 1 , ) for some ε > 0 . So, from Theorem 3, θ G ( A , ε , g 1 , ) is a G δ dense set in Y for the above ε > 0 . □
Now, we assume that θ G ( A , ε , g 1 , ) is a G δ dense set in Y for some ε > 0 . As α G ( A , g 1 , ) θ G ( A , ε , g 1 , ) , α G ( A , g 1 , ) is a dense set in Y. Let B = Y [ A ] ε . Then, B , ρ ( A , B ) > 0 and α G ( B , g 1 , ) θ G ( A , ε , g 1 , ) . So, α G ( B , g 1 , ) is a dense set in Y.

3.3. Chaos with Respect to a Furstenberg Family for a T-VDDS

For a given T-VDDS ( Y , g 1 , ) , an G -reciprocating point (resp. G - τ -reciprocating point) of the diagonal Δ Y for the product system ( Y × Y , g 1 , × g 1 , ) is called an G -scrambled pair (resp. G - τ -scrambled pair) of the system ( Y , g 1 , ) . A subset S Y is called an G -scrambled scrambled set for a given T-VDDS ( Y , g 1 , ) if any ( u , v ) S × S ( u v ) is an G -scrambled pair of this system. A subset S Y is called a strongly G -scrambled scrambled set for a given T-VDDS ( Y , g 1 , ) if there is a τ > 0 , such that any two different points in S is an G - τ -scrambled pair of this system. A given T-VDDS ( Y , g 1 , ) is called generically G -chaotic if the set of all G -scrambled pairs of this system is a G δ set, which is dense in Y × Y . A given T-VDDS ( Y , g 1 , ) is called generically strongly G -chaotic if there is a τ > 0 that satisfies that the set of all G - τ -scrambled pairs of this system is a G δ set, which is dense in Y × Y .
Theorem 6.
Assume that τ > 0 and ( Y , g 1 , ) are a T-VDDS. Then, the following hold:
(1)
A pair ( u , v ) of points in Y is an M ¯ ( 0 ) -scrambled pair (resp. M ¯ ( 0 ) -τ-scrambled pair) of the system ( Y , g 1 , ) if and only if the pair is a scrambled pair (resp. τ-scrambled pair) in the Li–Yorke sense for the system ( Y , g 1 , ) .
(2)
A set S Y is an M ¯ ( 0 ) -scrambled (resp. strongly M ¯ ( 0 ) -scrambled) set for the system ( Y , g 1 , ) , if and only if the set is a scrambled set (resp. strongly scrambled set) in the Li–Yorke sense for the system ( Y , g 1 , ) .
(3)
A pair ( u , v ) of points in Y is an M ¯ ( 1 ) -scrambled pair (resp. M ¯ ( 1 ) -τ-scrambled pair) of the system ( Y , g 1 , ) , if and only if the pair is a scrambled pair (resp. τ-scrambled pair) in the distribution sense for the system ( Y , g 1 , ) .
(4)
A set S Y is an M ¯ ( 1 ) -scrambled (resp. strongly M ¯ ( 1 ) -scrambled) set for the system ( Y , g 1 , ) , if and only if the set is a scrambled set (resp. strongly scrambled set) in the distribution sense for the system ( Y , g 1 , ) .
Proof. 
The proof is immediate and omitted. □

3.4. Criteria for a Generically Strongly G -Chaotic T-VDDS

Theorem 7.
Assume that G is a Furstenberg family and ( Y , g 1 , ) is a T-VDDS. If G is compatible with the system ( Y × Y , g 1 , × g 1 , ) , then the system ( Y , g 1 , ) is generically strongly G -chaotic, if and only if the following hold:
(1)
α G ( Δ Y , g 1 , × g 1 , ) is dense in Y × Y , and
(2)
There exists a nonempty B Y × Y that is positively disjoint with Δ Y , satisfying that α G ( B , g 1 , × g 1 , ) is dense in Y × Y .
Proof. 
The proof is direct and omitted for brevity. □
Theorem 8.
Assume that G is a Furstenberg family, ( Y , g 1 , ) is a T-VDDS, and A , C Y . Then,
α G ( A × C , g 1 , × g 1 , ) α κ B ( A , g 1 , ) × α G ( C , g 1 , ) .
Proof. 
For any τ > 0 , choose τ 1 > 0 with [ A ] τ 1 × [ C ] τ 1 [ A × C ] τ . Let
( u , v ) α κ B ( A , g 1 , ) × α G ( C , g 1 , ) .
Then, u α κ B ( A , g 1 , ) and v α G ( C , g 1 , ) . This means
N g 1 , ( u , [ A ] τ 1 ) κ B
and
N g 1 , ( v , [ C ] τ 1 ) G .
From the hypothesis and the definition, one has
N g 1 , × g 1 , ( ( u , v ) , [ A × C ] τ ) N g 1 , × g 1 , ( ( u , v ) , [ A ] τ 1 × [ C ] τ 1 ) N g 1 , ( u , [ A ] τ 1 ) · N g 1 , ( v , [ C ] τ 1 ) G .
Consequently, ( u , v ) α G ( A × C , g 1 , × g 1 , ) . □
Theorem 9.
Assume that G is a full Furstenberg family, and that ( Y , g 1 , ) is a T-VDDS, and let G be compatible with the product system ( Y × Y , g 1 , × g 1 , ) . If there are a point p Y and a A Y with A and ρ ( p , A ) > 0 , such that α κ B ( p , g 1 , ) and α G ( A , g 1 , ) are dense, then the system ( Y , g 1 , ) is generically strongly G -chaotic.
Proof. 
From the hypothesis and Theorem 8, one can see that
α κ B ( { ( p , p ) } , g 1 , × g 1 , )
is dense in Y × Y , and that
α κ B ( { p } × A , g 1 , × g 1 , )
is dense in Y × Y . As G is full,
κ B G .
Therefore,
α G ( { ( p , p ) } , g 1 , × g 1 , )
is dense in Y × Y . Clearly,
[ Δ Y ] τ [ { ( p , p ) } ] τ
for any τ > 0 . So,
α G ( { ( p , p ) } , g 1 , × g 1 , ) α G ( [ Δ Y ] , g 1 , × g 1 , ) .
Hence,
α G ( [ Δ Y ] , g 1 , × g 1 , )
is dense in Y × Y . From Theorem 7, the system ( Y , g 1 , ) is generically strongly G -chaotic. □
Theorem 10.
Assume that ( Y , g 1 , ) is a T-VDDS, p Y is a fixed point such that j = 1 ( g 1 j ( { p } ) ) 1 is dense, and B Y is invariant with B , ρ ( p , B ) > 0 , and j = 1 ( g 1 j ( A ) ) 1 is dense. If G is a full Furstenberg family that is compatible with the system ( Y × Y , g 1 , × g 1 , ) , then the system ( Y , g 1 , ) is generically strongly G -chaotic. Consequently, the system ( Y , g 1 , ) is generically strongly M ¯ ( 1 ) -chaotic.
Proof. 
From the hypothesis, we can see that
α κ B ( { p } , g 1 , )
is dense in Y, and that
α κ B ( A , g 1 , )
is dense in Y. As G is full,
κ B G .
Therefore,
α G ( A , g 1 , )
is dense in Y. From Theorem 9, the system ( Y , g 1 , ) is generically strongly G -chaotic. From Theorems 2 and 9, the system ( Y , g 1 , ) is generically strongly M ¯ ( 1 ) -chaotic. □
For any given integer m 2 , we let the set N m = { 1 , 2 , , m } be endowed with the discrete topology and the space Σ m = j = 1 N m be endowed with the product topology. The compact metric space Σ m is said to be the symbolic space generated by m different elements. The shift map σ on the space Σ m is defined by σ ( y 1 y 2 ) = y 2 y 3 for any y 1 y 2 Σ m . Obviously, 11 Σ m and 22 Σ m are the fixed points of the shift map σ j , where σ j = σ j σ j 1 σ 2 σ = σ j ( j + 1 ) 2 for every integer j 1 . Then, we obtain a T-VDDS ( Σ m , σ 1 , ) , given by sequences ( σ j ) j = 1 of continuous maps σ j . As an application, we have the following example.
Example 1.
If G is a full Furstenberg family that is compatible with the product system ( Σ M × Σ M , σ 1 , × σ 1 , ) , then the system ( Σ M , σ 1 , ) is generically strongly G -chaotic. Consequently, the system ( Σ M , σ 1 , ) is generically strongly M ¯ ( 1 ) -chaotic.
Proof. 
Clearly, 11 Σ m and 22 Σ m are the fixed points of the system σ 1 , . Also, it is easy to show that the conditions of Theorem 10 are satisfied for these two fixed points. From Theorem 10, the result of Example 1 holds. □
Remark 1.
For any countably infinite set of functions { g 1 , g 2 , } , in order for results to be independent of the numbering, we need a condition on the family G , namely that if B G , then H ( B ) G for any permutation of the set of positive integers.

4. Conclusions

In recent years, numerous researchers have delved into T-VDDSs and made significant progress. This study utilizes the Furstenberg family theory to establish G -scrambled pairs for a T-VDDS and explores certain characteristics of the collection of G -scrambled pairs. Additionally, we introduce the concept of generically G -chaotic T-VDDSs and generically strongly G -chaotic T-VDDSs, establish a condition sufficient for T-VDDSs to be generically strongly G -chaotic, and present an example of a generically strongly M ¯ ( 1 ) -chaotic T-VDDS. Our future research will focus on the practical applications of these systems.

Author Contributions

Conceptualization, Y.L.; validation, J.Z.; formal analysis, J.Z. and T.L.; investigation, J.S.; writing original draft, R.L. and Y.L.; writing review and editing, 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 Natural Science Foundation of Sichuan Province (No. 2024NSFSC1406), the Opening Project of Artificial Intelligence Key Laboratory of Sichuan Province (No. 2018RZJ03), the Key Scientific and Technological Research Project of Science and Technology Department of Zhanjiang City (No. 2010C3112005), and the Scientific Research Project of SUSE (No. 2024RC08).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The data presented in this study are available on request from the corresponding author.

Conflicts of Interest

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

References

  1. Li, T.Y.; Yorke, J.A. Period three implies chaos. Am. Math. Mon. 1975, 82, 985–992. [Google Scholar] [CrossRef]
  2. Xiong, J.C.; Lü, J.; Tan, F. Furstenberg family and chaos. Sci. China Ser. A 2007, 50, 1325–1333. [Google Scholar] [CrossRef]
  3. Tan, F.; Xiong, J.C. Chaos via Furstenberg family couple. Topol. Its Appl. 2009, 156, 525–532. [Google Scholar] [CrossRef]
  4. Zhu, P.X.; Yang, Q.G. Li-Yorke chaos in weak topology of the n-dimensional linear systems. J. Math. Anal. Appl. 2023, 529, 127574. [Google Scholar] [CrossRef]
  5. Bernardes, N.C., Jr.; Bonilla, A.; Peris, A. Mean Li-Yorke chaos in Banach spaces. J. Funct. Anal. 2020, 278, 108343. [Google Scholar] [CrossRef]
  6. Dai, X.P.; Tang, X.J. Devaney chaos, Li–Yorke chaos, and multi-dimensional Li–Yorke chaos for topological dynamics. J. Differ. Equations 2017, 263, 5521–5553. [Google Scholar] [CrossRef]
  7. Akhmet, M.U.; Fen, M.O. Attraction of Li–Yorke chaos by retarded SICNNs. Neurocomputing 2015, 147, 330–342. [Google Scholar] [CrossRef]
  8. Yin, Z.B.; He, S.N.; Huang, Y. On Li–Yorke and distributionally chaotic direct sum operators. Topol. Its Appl. 2018, 239, 35–45. [Google Scholar] [CrossRef]
  9. Schweizer, B.; Smital, J. Measures of chaos and a spectral decomposition of dynamical systems on the interval. Trans. Am. Math. Soc. 1994, 344, 737–854. [Google Scholar] [CrossRef]
  10. Lu, T.X.; Zhu, P.Y. Further discussion on chaos in duopoly games. Chaos Solitons Fractals 2013, 52, 45–48. [Google Scholar] [CrossRef]
  11. Kim, C.; Ju, H.H.; Chen, M.H.; Raith, P. A-coupled-expanding and distributional chaos. Chaos Solitons Fractals 2015, 77, 291–295. [Google Scholar] [CrossRef]
  12. Kolyada, S.; Snoha, S. Topological entropy of non-autononous dynamical systems. Random Comput. Dyn. 1996, 4, 205–233. [Google Scholar]
  13. 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, 110979. [Google Scholar] [CrossRef]
  14. Canovas, J.S. Li–Yorke chaos in a class of nonautonomous discrete systems. J. Differ. Equations Appl. 2011, 17, 479–486. [Google Scholar] [CrossRef]
  15. Dvorakova, J. Chaos in nonautonomous discrete dynamical systems. Commun. Nonlinear Sci. Numer. Simul. 2012, 17, 4649–4652. [Google Scholar] [CrossRef]
  16. Pi, J.M.; Lu, T.X.; Xue, Y.F. Transitivity and shadowing properties of non-autonomous discrete dynamical systems. Int. J. Bifurc. Chaos 2022, 32, 2250246. [Google Scholar] [CrossRef]
  17. Jiang, Y.X.; Lu, T.X.; Pi, J.M.; Anwar, W. The retentivity of four kinds of shadowing properties in non-autonomous discrete dynamical systems. Entropy 2022, 24, 397. [Google Scholar] [CrossRef] [PubMed]
  18. Dastjerdi, D.A.; Aghaee, M. Shift limits of a non-autonomous system. Topol. Its Appl. 2023, 326, 108394. [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.

Share and Cite

MDPI and ACS Style

Li, R.; Li, Y.; Lu, T.; Zhao, J.; Su, J. Furstenberg Family and Chaos for Time-Varying Discrete Dynamical Systems. Entropy 2024, 26, 674. https://doi.org/10.3390/e26080674

AMA Style

Li R, Li Y, Lu T, Zhao J, Su J. Furstenberg Family and Chaos for Time-Varying Discrete Dynamical Systems. Entropy. 2024; 26(8):674. https://doi.org/10.3390/e26080674

Chicago/Turabian Style

Li, Risong, Yongjiang Li, Tianxiu Lu, Jiazheng Zhao, and Jing Su. 2024. "Furstenberg Family and Chaos for Time-Varying Discrete Dynamical Systems" Entropy 26, no. 8: 674. https://doi.org/10.3390/e26080674

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