1. Introduction
Chaotic properties of a dynamical system have been extensively discussed since the introduction of the term chaos by Li and Yorke in 1975 [
1] and Devaney in 1989 [
2]. To describe some kind of unpredictability in the evolution of a dynamical system, other definitions of chaos have also been proposed, such as generic chaos [
3], dense chaos [
4], Li–Yorke sensitivity [
5], and so on. An important generalization of Li–Yorke chaos is distributional chaos, which is given in 1994 by B. Schweizer and J. Smítal [
6]. Then, theories related to scrambled sets are discussed extensively (see [
7,
8,
9,
10,
11,
12] and others). In 1997, the Furstenberg family was introduced by E. Akin [
13]. J. Xiong, F. Tan described chaos with a couple of Furstenberg Families.
-chaos has also been defined [
14]. Moreover,
-sensitivity was given in [
15] and shadowing properties were discussed in [
16]. Most existing papers studied the chaoticity in autonomous discrete systems
. However, if a sequence of perturbations to a system are described by different functions, then there are a sequence of maps to describe them, giving rise to non-autonomous systems. Non-autonomous discrete systems were precisely introduced in [
17], in connection with non-autonomous difference equations (see [
18,
19] and some references therein).
Let (briefly, X) be a compact metric space and consider a sequence of continuous maps , denoted by . This sequence defines a non-autonomous discrete system . The orbit of any point is given by the sequence , where for , and is the identity map.
Call a compound system of .
Also, denote
by
and denote
for
. By [
5], if
converges uniformly to a map
f. Then, for any
, the sequence
converges uniformly to
.
In the present work, some notions relating to Furstenberg families and properties
,
are recalled in
Section 2 and
Section 3.
Section 4 states some definitions about
-chaos. In
Section 5, it is proved that, under the conditions of property
and positive shift-invariant,
is
-chaos (strong
-chaos, strong
-chaos) implies
(
) is
-chaos (strong
-chaos, strong
-chaos). If the conditions property
and negative shift-invariant both hold, the above conclusion can be inversed. As a conclusion, for arbitrary
s and
t in
, for every
,
and
can share the same
-scrambled set (Theorem 3).
In this paper, it is always assumed that all the maps
,
, are surjective. It should be noted that this condition is needed by most papers dealing with this kind of system (for example, [
20,
21,
22,
23]). It is assumed that sequence
converges uniformly. The aim of this paper is to investigate the
-scrambled sets of
.
2. Furstenberg Families
Let be the collection of all subsets of the positive integers set . A collection is called a Furstenberg family if it is hereditary upwards, i.e., and imply . Obviously, the collection of all infinite subsets of is a Furstenberg family, denoted by .
Define the dual family
of a Furstenberg family
by
It is clear that
is a Furstenberg family and
(see [
13]).
For , , let and . Furstenberg family is positive shift-invariant if for every and any . Furstenberg family is negative shift-invariant if for every and any . Furstenberg family is shift-invariant if it is positive shift-invariant and negative shift-invariant.
The following shows a class of Furstenberg families which is related to upper density.
Let
. The upper density and the lower density of
F are defined as follows:
where
denotes the cardinality of the set
A.
For any s in , set .
Proposition 1. For any s in , is shift-invariant Furstenberg family. And .
Proof. - (i)
Let
, then,
(where
),
Thus, (i.e., ) implies (i.e., ). So, are Furstenberg families.
- (ii)
Let
, that is,
. Denote
(where
,
), then
and
for any
.
and
So, is shift-invariant.
- (iii)
Obviously,
This completes the proof.
☐
3. Properties , of Furstenberg Families
Definition 1. Let k be a positive integer and be a Furstenberg family.
- (1)
For any , if there exists an integer such that , we say have property ;
- (2)
If , we say have property .
The following proposition is given by [
24]. For completeness, we give the proofs.
Proposition 2. For any and any , have properties and .
Proof. - (1)
If , , , i.e., there exists an integer such that . The following will discuss the case .
If , . , , obviously, there exist such that .
If , suppose properties does not hold. Then there exists a such that for every .
For any , put which satisfied . One can find a sufficiently large number N such that, , (where denotes the cardinality of the set ). Then , where denotes the complementary set of .
Give an integer
,
. By the definition of
,
if
. And
if
,
and
. Then
So,
Put
, then
This contradicts to .
- (2)
Similarly, just consider the case , .
Suppose properties
does not hold. Then there exists an integer
such that
. Put
which satisfied
. One can find a sufficiently large number
N such that,
,
. Give a
,
. By the definition of
,
if
. And
if
and
. Then
This contradicts to .
This completes the proof.
☐
4. -Chaos in Non-Autonomous Systems
Now, we state the definition of -chaos in nonautonomous systems.
Definition 2. Let be a compact metric space, and are two Furstenberg families. is called a -scrambled set of (briefly, ), if , the following two conditions are satisfied:
- (i)
, ;
- (ii)
, .
The pair which satisfies the above two conditions is called an -scrambled pair of .
is said to be -chaotic if there exists an uncountable -scrambled set of . If , is said to be -chaotic and is an -scrambled pair. is said to be strong -chaotic if there are some and an uncountable subset such that for any with , the following two conditions holds:
- (i)
for all ;
- (ii)
.
is said to be strong -chaos if it is strong -chaotic and .
Let us recall the definitions of Li-Yorke chaos and distributional chaos in non-autonomous systems (see [
25,
26]).
Definition 3. Assume that is a non-autonomous discrete system. If with , is called a Li–Yorke pair if The set is called a Li–Yorke scrambled set if all points with , is a Li–Yorke pair. is Li–Yorke chaotic if X contains an uncountable Li–Yorke scrambled set.
Assume that
is a non-autonomous discrete system. For any pair of points
, define the upper and lower (distance) distributional functions generated by
as
and
respectively. Where
is the characteristic function of the set
, i.e.,
when
or
when
.
Definition 4. is distributionally chaotic if exists an uncountable subset such that for any pair of distinct points , we have that for all and for some .
The set D is a distributionally scrambled set and the pair a distributionally chaotic pair.
It is not difficult to obtain that the pair
is a
-scrambled pair if and only if
is a Li–Yorke scrambled pair, and the pair
is a
-scrambled pair if and only if
is a distributionally scrambled pair. In fact,
Then, for any and for some is equivalent to that and . for any and for some is equivalent to that and .
Hence, -chaos is Li–Yorke chaos and -chaos is distributional Chaos.
5. Main Results
Theorem 1. Let and are two Furstenberg families with property , where k is a positive integer. is positive shift-invariant. If the system is -chaos, then the system is -chaos too.
Proof. If D is an -scrambled set of , the following proves that D is an -scrambled set of .
- (i)
Since X is compact and are continuous, then, for any , are uniformly continuous (where are freely chosen from the sequence ). That is, for any , there exists a , , implies ().
Since
D is an
-scrambled set of
, then,
, for the above
, we have
And because
have property
, there exists some
such that
By the selection of
, we put
, then
Write , then .
By the positive shift-invariant of and , we have . And with the hereditary upwards of , for any , , .
- (ii)
Since
D is a
-scrambled set of
, then, for the above
,
, such that
. And because
have property
, then, there exists some
such that
X is compact and are continuous, then, for any , are uniformly continuous (where are freely chosen from the sequence ). For the above , , satisfied , inequality holds.
The following will prove that .
Suppose
, then
By the selection of
, we put
, then
This contradicts .
Hence, for in (i), there exists a such that .
Combining with (i) and (ii), is -chaos.
This completes the proof.
☐
Theorem 2. Let and are two Furstenberg families with property , where k is a positive integer. is negative shift-invariant. If the system is -chaos, then the system is -chaos too.
Proof. If D is a -scrambled set of , the following prove that D is a -scrambled set of .
- (i)
Similar to Theorem 1, for any , are uniformly continuous (where are freely chosen from the sequence ). That is, for any , there exists a , , implies ().
For any pair of distinct points
, for the above
, one has
By the selection of
, for
,
, put
, then
. And because
have property
, then
Notice that , then .
- (ii)
Since D is an -scrambled set of , then, for the above , there exist , such that .
For any , are uniformly continuous (where are freely chosen from the sequence ), then, for the above , there exist such that implies . That is, implies .
,
, put
, then
Since is negative shift-invariant, then . And because have property , then , i.e., . Combining with the hereditary upwards of , we have .
By (i) and (ii), D is an -scrambled set of .
This completes the proof.
☐
Similarly, the following corollaries hold.
Corollary 1. Let and are two Furstenberg families with property , where k is a positive integer. is positive shift-invariant. If the system is -chaos (strong -chaos, or strong -chaos), then the system is -chaos (strong -chaos, or strong -chaos).
Corollary 2. Let and are two Furstenberg families with property , where k is a positive integer. is negative shift-invariant. If the system is -chaos (strong -chaos, or strong -chaos), then the system is -chaos (strong -chaos, or strong -chaos).
Combining with Propositions 1 and 2, Theorems 1 and 2, and Corollarys 1 and 2, the following conclusions are obtained.
Theorem 3. Let s and t are arbitrary two numbers in , then
- (1)
If D is an -scrambled set (or strong -scrambled set) of , then, for every , D is an -scrambled set(or strong -scrambled set) of .
- (2)
For some positive integer k, if D is an -scrambled set (or strong -scrambled set) of , then D is an -scrambled set (or strong -scrambled set) of .
Proof. - (1)
By Proposition 1, is shift-invariant (obviously positive shift-invariant). And because are two Furstenberg families with property (Proposition 2). Then, according to the proof of Theorem 1, if D is an -scrambled set of , then, for every , D is an -scrambled set of .
- (2)
In the same way, (2) holds.
This completes the proof.
☐
With the preparations in
Section 4, we have
Corollary 3. - (1)
If D is a Li–Yorke scrambled set (or distributionally scrambled set) of , then, for every , D is a Li–Yorke scrambled set (or distributionally scrambled set) of .
- (2)
For some positive integer k, if D is a Li–Yorke scrambled set (or distributionally scrambled set) of , then, D is a Li–Yorke scrambled set (or distributionally scrambled set) of .
Remark 1. In the non-autonomous systems, the iterative properties of Li–Yorke chaos and distributional chaos are discussed in [25,26] before. The conclusions in Corollary 3 remains consistent with them. This paper has presented several properties of -chaos, strong -chaos, and strong -chaos. There are some other problems, such as generically -chaos and -sensitivity, to discuss. Moreover, property is closely related to congruence theory. Follow this line, one can consider other Furstenberg families which consist of number sets with some special characteristics.