# Anticontrol of Chaos for a Class of Delay Difference  Equations Based on  Heteroclinic Cycles Connecting Repellers

Authors: Zongcheng Li
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper is concerned with anticontrol of chaos for a class of delay difference equations via the feedback control technique. The controlled system is first reformulated into a high-dimensional discrete dynamical system. Then, a chaotification theorem based on the heteroclinic cycles connecting repellers for maps is established. The controlled system is proved to be chaotic in the sense of both Devaney and Li-Yorke. An illustrative example is provided with computer simulations.


---

## Body

## 1. Introduction

Anticontrol of chaos (or called chaotification) is a process that makes a nonchaotic system chaotic or enhances a chaotic system to produce a stronger or different type of chaos. In recent years, it has been found that chaos can actually be useful under some circumstances, for example, in human brain analysis [1, 2], heartbeat regulation [3, 4], encryption [5], digital communications [6], and so forth. So, sometimes it is useful and even important to make a system chaotic or create new types of chaos. This has attracted increasing interest in research on chaotification of dynamical systems due to the great potential of chaos in many nontraditional applications.In the pursuit of chaotifying discrete dynamical systems, a simple yet mathematically rigorous chaotification method was first developed by Chen and Lai [7–9] from a feedback control approach. After that, many chaotification schemes appeared for discrete dynamical systems based on the feedback control approach. The reader is referred to Chen and Shi [10] and Wang and Chen [11] for a survey of chaotification of discrete dynamical systems, as well as some references cited therein.It is well known that the time delay appears in many realistic systems with feedback in science and engineering. Meanwhile, it has been shown that introducing delays to an undelayed system can be beneficial, especially for chaotic systems. This is the delayed feedback control method, which is widely used in chaos control. For continuous-time control systems, we refer to [12] and the references therein. In [12], the authors developed a unified computational approach for solving optimal state-delay control problems and proved that the approach was very effective for parameter identification and delayed feedback control. For discrete-time control systems, we refer to [13] and the references therein. In [13], the authors obtained the necessary and sufficient conditions for stabilizability of discrete-time systems via delayed feedback control.To the best of our knowledge, there are few results on chaotification of delay difference equations. Motivated by the delayed feedback control method, we studied the chaotification problem for a class of delay difference equations with at least two fixed points. Since the sawtooth function and the sine function have some favourable properties, some of which are similar, they are often used as controllers; see [10, 11, 14–16] and so forth. Particularly, we succeeded in using the sine function as a controller to chaotify linear delay difference equations in [16]. This motivates us to use the sine function as the controller and employ a feedback control approach to study the chaotification problem for a class of delay difference equations. It is proved that the controlled system is chaotic in the sense of both Devaney and Li-Yorke, by applying the result of heteroclinic cycles connecting repellers; see [17] for the result and some references therein.The rest of the paper is organized as follows. In Section2, the chaotification problem under investigation is described, and some concepts, lemmas, and reformulation of the controlled system are introduced. In Section 3, the chaotification problem is studied and a chaotification scheme is established. An example is provided to illustrate the theoretical result with computer simulations in Section 4. Finally, Section 5 concludes the paper.


## 2. Preliminaries

In this section, we describe the chaotification problem, give a reformulation of the delay difference equation, and introduce some fundamental concepts and lemmas, which will be used in the next section.


### 2.1. Description of Chaotification Problem

In this paper, we consider chaotification of the following delay difference equation:(1)
x
(
n
+
1
)
=
f
(
x
(
n
-
k
)
,
x
(
n
)
)
,
n
≥
0
,
where k
≥
1 is a fixed integer and f
:
D
⊂
R
2
→
R is a map. Equation (1) can be viewed as a discrete analogue of many one-dimensional delay differential equations by using the forward Euler scheme, such as the well-known Mackey-Glass equation
(2)
x
˙
(
t
)
=
-
μ
x
(
t
)
+
g
(
x
(
t
-
τ
)
)
,
where μ
>
0, τ
>
0 is the delay, and g is a one-dimensional nonlinear function. Equation (2) is a prototype for a retarded functional differential equation which has many applications in sciences. Special cases of (2) or its discretization have been studied by many authors; for instance, see [18–22] and the references therein.From the above discussion, we see that the delay difference equation (1) is indeed very general. There exist many papers which are concerned with the existence of chaotic behavior for special forms of functions f. For example, see [21, 22] and references therein. However, (1) cannot be chaotic for a more general class of functions f. The object of this paper is to design a simple control input sequence {
v
(
n
)
} such that the output of the controlled system
(3)
x
(
n
+
1
)
=
f
(
x
(
n
-
k
)
,
x
(
n
)
)
+
v
(
n
)
,
n
≥
0
,
exhibits chaos in the sense of both Devaney and Li-Yorke for a more general class of functions f. The controller to be designed in this paper is in the form of
(4)
v
(
n
)
=
α
sin
⁡
(
β
x
(
n
-
k
)
)
,
where α and β are two undetermined positive parameters.For convenience, defineg
(
x
,
y
)
:
=
f
(
x
,
y
)
+
α
sin
(
β
x
) throughout the rest of the paper. Let f
x
(
x
,
y
) and f
y
(
x
,
y
) denote the first-order partial derivatives of f with respect to the first and the second variables at the point (
x
,
y
), respectively. In the following, by B
r
(
z
) and B
¯
r
(
z
) denote the open and closed balls of radius r centered at z.


### 2.2. Reformulation

Here, we reformulate (1) and (3) into two special high-dimensional discrete dynamical systems. The following transform method is used by many researchers; for example, see [16, 21] and some references therein.By setting(5)
u
j
(
n
)
≔
x
(
n
+
j
-
k
-
1
)
,
1
≤
j
≤
k
+
1
,
n
≥
0
,
equation (1) and the controlled system (3) with controller (4) can be written as the following k
+
1-dimensional discrete systems on R
k
+
1:
(6)
u
(
n
+
1
)
=
F
(
u
(
n
)
)
,
(7)
u
(
n
+
1
)
=
G
(
u
(
n
)
)
,
respectively, where u
=
(
u
1
,
u
2
,
…
,
u
k
+
1
)
T
∈
R
k
+
1, and the maps F
,
G
:
R
k
+
1
→
R
k
+
1 are given by
(8)
F
(
u
1
(
n
)
u
2
(
n
)
⋮
u
k
(
n
)
u
k
+
1
(
n
)
)
=
(
u
2
(
n
)
u
3
(
n
)
⋮
u
k
+
1
(
n
)
f
(
u
1
(
n
)
,
u
k
+
1
(
n
)
)
)
,
G
(
u
1
(
n
)
u
2
(
n
)
⋮
u
k
(
n
)
u
k
+
1
(
n
)
)
=
(
u
2
(
n
)
u
3
(
n
)
⋮
u
k
+
1
(
n
)
f
(
u
1
(
n
)
,
u
k
+
1
(
n
)
)
+
α
sin
(
β
u
1
(
n
)
)
)
.The mapG is called the map induced by g. System (7) is called the system induced by (3) in the Euclidean space R
k
+
1. It is evident that a solution {
x
(
n
-
k
)
,
…
,
x
(
n
)
}
n
=
1
∞ of (3) with an initial condition {
x
(
-
k
)
,
…
,
x
(
0
)
} corresponds to a solution {
u
(
n
)
}
n
=
1
∞ of system (7) with an initial condition u
(
0
)
=
(
u
1
(
0
)
,
…
,
u
k
+
1
(
0
)
)
T
∈
R
k
+
1. We say that the solution {
u
(
n
)
}
n
=
1
∞ of system (7) is induced by the solution {
x
(
n
-
k
)
,
…
,
x
(
n
)
}
n
=
1
∞ of (3). Therefore, we can investigate the dynamical behavior of system (3) by investigating that of its induced system (7) in R
k
+
1. There is the same conclusion between systems (6) and (1). The idea in the above definitions is motivated by [21], where the authors say that the induced system and the original system are equivalent.


### 2.3. Some Basic Concepts and Lemmas

Since Li and Yorke [23] first introduced a precise mathematical definition of chaos, there have been several different definitions of chaos, some stronger and some weaker, depending on the requirements in different problems; see [24–27] and so forth. For convenience, we list two definitions of chaos in the sense of Li-Yorke and Devaney, which are used in this paper.Definition 1.
Let(
X
,
d
) be a metric space, F
:
X
→
X a map, and S a set of X with at least two distinct points. Then S is called a scrambled set of F if for any two distinct points x
,
y
∈
S, (i)
liminf
⁡
n
→
∞
⁡
d
(
F
n
(
x
)
,
F
n
(
y
)
)
=
0;
(ii)
limsup
⁡
n
→
∞
⁡
d
(
F
n
(
x
)
,
F
n
(
y
)
)
>
0.The map F is said to be chaotic in the sense of Li-Yorke if there exists an uncountable scrambled set S of F.Remark 2.
There are three conditions in the original characterization of chaos in Li-Yorke’s theorem [23]. Besides conditions (i) and (ii), the third one is that, for all x
∈
S and for all periodic points p of F,
(9)
lim
⁡
sup
⁡
n
→
∞
d
(
F
n
(
x
)
,
F
n
(
p
)
)
>
0
.
But conditions (i) and (ii) together imply that the scrambled set S contains at most one point x that does not satisfy the above condition. Hence, the third condition is not essential and can be removed.Definition 3 (see [24]).
Let(
X
,
d
) be a metric space. A map F
:
V
⊂
X
→
V is said to be chaotic on V in the sense of Devaney if (i)
the set of the periodic points ofF is dense in V;
(ii)
F is topologically transitive in V;
(iii)
F has sensitive dependence on initial conditions in V.Remark 4.
By the result of Banks et al. [28], conditions (i) and (ii) together imply condition (iii) if F is continuous in V. Consequently, condition (iii) is redundant in the above definition if F is continuous in V. It has been proved in [29] that, under some conditions, chaos in the sense of Devaney is stronger than that in the sense of Li-Yorke.For convenience, some definitions of relevant concepts given in [30] are listed below.Definition 5 (see [30, Definitions 2.1 and 2.4]).
Let(
X
,
d
) be a metric space and F
:
X
→
X a map. A point z
∈
X is called an expanding fixed point (or a repeller) of F in B
¯
r
(
z
) for some constant r
>
0, if F
(
z
)
=
z and there exists a constant λ
>
1 such that
(10)
d
(
F
(
x
)
,
F
(
y
)
)
≥
λ
d
(
x
,
y
)
∀
x
,
y
∈
B
¯
r
(
z
)
.
The constant λ is called an expanding coefficient of F in B
¯
r
(
z
). Furthermore, z is called a regular expanding fixed point of F in B
¯
r
(
z
) if z is an interior point of F
(
B
r
(
z
)
). Otherwise, z is called a singular expanding fixed point of F in B
¯
r
(
z
).
Now, we introduce some relative concepts for system (3), which are motivated by [15, Definitions 5.1 and 5.2]. There are identical concepts for system (1).Definition 6.
Consider the following.(i)
A pointx
∈
R
k
+
1 is called an m-periodic point of system (3) if x
∈
R
k
+
1 is an m-periodic point of its induced system (7); that is, F
m
(
x
)
=
x, F
j
(
x
)
≠
x, and 1
≤
j
≤
m
-
1. In the special case of m
=
1, x is called a fixed point or a steady state of system (3).
(ii)
The concepts of density of periodic points, topological transitivity, sensitive dependence on initial conditions, and the invariant set for system (3) are defined similarly to those for its induced system (7) in R
k
+
1.
(iii)
System (3) is said to be chaotic in the sense of Devaney (or Li-Yorke) on V
⊂
R
k
+
1 if its induced system (7) is chaotic in the sense of Devaney (or Li-Yorke) on V
⊂
R
k
+
1.
The following two lemmas will be used in the next section.Lemma 7.
Assume that the mapf in (1) is continuously differentiable in a neighborhood of (
0,0
) with f
(
0,0
)
=
0 and satisfies
(11)
|
f
x
(
0,0
)
|
-
|
f
y
(
0,0
)
|
>
1
;
then the fixed point O
:
=
(
0
,
…
,
0
)
T
∈
R
k
+
1 of system (6) is a regular expanding fixed point in some norm in R
k
+
1.Proof.
It follows fromf
(
0,0
)
=
0 that O is a fixed point of system (6). Since f is continuously differentiable in a neighborhood of (
0,0
), F is continuously differentiable in some neighborhood of O. The Jacobian matrix of map F in system (6) at O is
(12)
D
F
(
O
)
=
(
0
1
0
⋯
0
0
0
1
⋯
0
⋯
⋯
⋯
⋯
⋯
0
0
0
⋯
1
f
x
(
0,0
)
0
0
⋯
f
y
(
0,0
)
)
(
k
+
1
)
×
(
k
+
1
)
,
and its characteristic equation is
(13)
λ
k
+
1
-
f
y
(
0,0
)
λ
k
-
f
x
(
0,0
)
=
0
.
From |
f
x
(
0,0
)
|
-
|
f
y
(
0,0
)
|
>
1, we can show that all the eigenvalues of D
F
(
O
) have absolute values larger than 1. Otherwise, suppose that there exists an eigenvalue λ
0 of D
F
(
O
) with |
λ
0
|
≤
1; then we get the following inequality:
(14)
1
+
|
f
y
(
0,0
)
|
≥
|
λ
0
k
+
1
-
f
y
(
0,0
)
λ
0
k
|
=
|
f
x
(
0,0
)
|
>
1
+
|
f
y
(
0,0
)
|
,
which is a contradiction. Then it follows from [31, Theorem 4.3] that there exist a positive constant r
* and a norm ∥
·
∥
* in R
k
+
1 such that F is continuously differentiable in B
¯
r
*
(
O
) and O is an expanding fixed point of F in B
¯
r
*
(
O
) in the norm ∥
·
∥
*; that is,
(15)
∥
F
(
x
)
-
F
(
y
)
∥
*
≥
μ
∥
x
-
y
∥
*
,
∀
x
,
y
∈
B
¯
r
*
(
O
)
,
where μ
>
1 is an expanding coefficient of F in B
¯
r
*
(
O
). Further, it follows from [30, Lemma 2.2] that O is a regular expanding fixed point of system (6) in the norm ∥
·
∥
* in R
k
+
1. This completes the proof.Since the result in the following lemma is related to the one-sided symbolic dynamical system(
∑
2
+
‍
,
σ
), we briefly recall some results of it for convenience. Let
(16)
∑
2
+
≔
{
s
=
(
s
0
,
s
1
,
s
2
,
…
)
:
s
j
=
0
or
1
}
with the distance
(17)
ρ
(
s
,
t
)
∶
=
∑
i
=
0
∞
‍
|
s
i
-
t
i
|
2
i
,
where s
=
(
s
0
,
s
1
,
s
2
,
…
) and t
=
(
t
0
,
t
1
,
t
2
,
…
). Then (
∑
2
+
‍
,
ρ
) is a complete metric space and a Cantor set. The shift map σ
:
∑
2
+
‍
→
∑
2
+
‍ defined by σ
(
(
s
0
,
s
1
,
s
2
,
…
)
)
=
(
s
1
,
s
2
,
…
) is continuous. The dynamical system defined by σ is called a one-sided symbolic dynamical system. It has plentiful dynamical behaviors; we refer to [24, 26] for details. Particularly, it is chaotic in the sense of both Devaney and Li-Yorke and has a positive topological entropy.Lemma 8 (see [17, Theorem 4.3 and Corollary 4.2]).
Let a mapf
:
R
n
→
R
n have k (≥2) different fixed points z
1
,
…
,
z
k
∈
R
n. Assume that (i)
for eachi, 1
≤
i
≤
k, z
i is an expanding fixed point of f in some norm ∥
·
∥
i;
(ii)
f has a k-heteroclinic cycle connecting fixed points z
1
,
…
,
z
k and is continuously differentiable in some neighborhood of each point x
0 on the cycle satisfying det
⁡
D
f
(
x
0
)
≠
0.Then for each i, 1
≤
i
≤
k, and for each neighborhood U
i of z
i, there exist a positive integer n
i and a Cantor set Λ
i
⊂
U
i such that f
n
i
:
Λ
i
→
Λ
i is topologically conjugate to the one-sided symbolic dynamical system σ
:
∑
2
+
‍
→
∑
2
+
‍. Consequently, there exists a compact and perfect invariant set D
i
=
⋃
j
=
0
n
i
-
1
f
j
(
Λ
i
)
⊂
R
n, containing the Cantor set Λ
i, such that f is chaotic on D
i in the sense of Devaney as well as in the sense of Li-Yorke.Remark 9.
Under the conditions in Lemma8, there exists a positive integer p, such that f
p has a regular and nondegenerate k-heteroclinic cycle connecting repellers z
1
,
…
,
z
k in the Euclidean norm ∥
·
∥. Therefore, Lemma 8 can be briefly stated as the following: “a regular and nondegenerate heteroclinic cycle connecting repellers in R
n implies chaos in the sense of both Devaney and Li-Yorke." We refer to [17] for details.


## 2.1. Description of Chaotification Problem

In this paper, we consider chaotification of the following delay difference equation:(1)
x
(
n
+
1
)
=
f
(
x
(
n
-
k
)
,
x
(
n
)
)
,
n
≥
0
,
where k
≥
1 is a fixed integer and f
:
D
⊂
R
2
→
R is a map. Equation (1) can be viewed as a discrete analogue of many one-dimensional delay differential equations by using the forward Euler scheme, such as the well-known Mackey-Glass equation
(2)
x
˙
(
t
)
=
-
μ
x
(
t
)
+
g
(
x
(
t
-
τ
)
)
,
where μ
>
0, τ
>
0 is the delay, and g is a one-dimensional nonlinear function. Equation (2) is a prototype for a retarded functional differential equation which has many applications in sciences. Special cases of (2) or its discretization have been studied by many authors; for instance, see [18–22] and the references therein.From the above discussion, we see that the delay difference equation (1) is indeed very general. There exist many papers which are concerned with the existence of chaotic behavior for special forms of functions f. For example, see [21, 22] and references therein. However, (1) cannot be chaotic for a more general class of functions f. The object of this paper is to design a simple control input sequence {
v
(
n
)
} such that the output of the controlled system
(3)
x
(
n
+
1
)
=
f
(
x
(
n
-
k
)
,
x
(
n
)
)
+
v
(
n
)
,
n
≥
0
,
exhibits chaos in the sense of both Devaney and Li-Yorke for a more general class of functions f. The controller to be designed in this paper is in the form of
(4)
v
(
n
)
=
α
sin
⁡
(
β
x
(
n
-
k
)
)
,
where α and β are two undetermined positive parameters.For convenience, defineg
(
x
,
y
)
:
=
f
(
x
,
y
)
+
α
sin
(
β
x
) throughout the rest of the paper. Let f
x
(
x
,
y
) and f
y
(
x
,
y
) denote the first-order partial derivatives of f with respect to the first and the second variables at the point (
x
,
y
), respectively. In the following, by B
r
(
z
) and B
¯
r
(
z
) denote the open and closed balls of radius r centered at z.


## 2.2. Reformulation

Here, we reformulate (1) and (3) into two special high-dimensional discrete dynamical systems. The following transform method is used by many researchers; for example, see [16, 21] and some references therein.By setting(5)
u
j
(
n
)
≔
x
(
n
+
j
-
k
-
1
)
,
1
≤
j
≤
k
+
1
,
n
≥
0
,
equation (1) and the controlled system (3) with controller (4) can be written as the following k
+
1-dimensional discrete systems on R
k
+
1:
(6)
u
(
n
+
1
)
=
F
(
u
(
n
)
)
,
(7)
u
(
n
+
1
)
=
G
(
u
(
n
)
)
,
respectively, where u
=
(
u
1
,
u
2
,
…
,
u
k
+
1
)
T
∈
R
k
+
1, and the maps F
,
G
:
R
k
+
1
→
R
k
+
1 are given by
(8)
F
(
u
1
(
n
)
u
2
(
n
)
⋮
u
k
(
n
)
u
k
+
1
(
n
)
)
=
(
u
2
(
n
)
u
3
(
n
)
⋮
u
k
+
1
(
n
)
f
(
u
1
(
n
)
,
u
k
+
1
(
n
)
)
)
,
G
(
u
1
(
n
)
u
2
(
n
)
⋮
u
k
(
n
)
u
k
+
1
(
n
)
)
=
(
u
2
(
n
)
u
3
(
n
)
⋮
u
k
+
1
(
n
)
f
(
u
1
(
n
)
,
u
k
+
1
(
n
)
)
+
α
sin
(
β
u
1
(
n
)
)
)
.The mapG is called the map induced by g. System (7) is called the system induced by (3) in the Euclidean space R
k
+
1. It is evident that a solution {
x
(
n
-
k
)
,
…
,
x
(
n
)
}
n
=
1
∞ of (3) with an initial condition {
x
(
-
k
)
,
…
,
x
(
0
)
} corresponds to a solution {
u
(
n
)
}
n
=
1
∞ of system (7) with an initial condition u
(
0
)
=
(
u
1
(
0
)
,
…
,
u
k
+
1
(
0
)
)
T
∈
R
k
+
1. We say that the solution {
u
(
n
)
}
n
=
1
∞ of system (7) is induced by the solution {
x
(
n
-
k
)
,
…
,
x
(
n
)
}
n
=
1
∞ of (3). Therefore, we can investigate the dynamical behavior of system (3) by investigating that of its induced system (7) in R
k
+
1. There is the same conclusion between systems (6) and (1). The idea in the above definitions is motivated by [21], where the authors say that the induced system and the original system are equivalent.


## 2.3. Some Basic Concepts and Lemmas

Since Li and Yorke [23] first introduced a precise mathematical definition of chaos, there have been several different definitions of chaos, some stronger and some weaker, depending on the requirements in different problems; see [24–27] and so forth. For convenience, we list two definitions of chaos in the sense of Li-Yorke and Devaney, which are used in this paper.Definition 1.
Let(
X
,
d
) be a metric space, F
:
X
→
X a map, and S a set of X with at least two distinct points. Then S is called a scrambled set of F if for any two distinct points x
,
y
∈
S, (i)
liminf
⁡
n
→
∞
⁡
d
(
F
n
(
x
)
,
F
n
(
y
)
)
=
0;
(ii)
limsup
⁡
n
→
∞
⁡
d
(
F
n
(
x
)
,
F
n
(
y
)
)
>
0.The map F is said to be chaotic in the sense of Li-Yorke if there exists an uncountable scrambled set S of F.Remark 2.
There are three conditions in the original characterization of chaos in Li-Yorke’s theorem [23]. Besides conditions (i) and (ii), the third one is that, for all x
∈
S and for all periodic points p of F,
(9)
lim
⁡
sup
⁡
n
→
∞
d
(
F
n
(
x
)
,
F
n
(
p
)
)
>
0
.
But conditions (i) and (ii) together imply that the scrambled set S contains at most one point x that does not satisfy the above condition. Hence, the third condition is not essential and can be removed.Definition 3 (see [24]).
Let(
X
,
d
) be a metric space. A map F
:
V
⊂
X
→
V is said to be chaotic on V in the sense of Devaney if (i)
the set of the periodic points ofF is dense in V;
(ii)
F is topologically transitive in V;
(iii)
F has sensitive dependence on initial conditions in V.Remark 4.
By the result of Banks et al. [28], conditions (i) and (ii) together imply condition (iii) if F is continuous in V. Consequently, condition (iii) is redundant in the above definition if F is continuous in V. It has been proved in [29] that, under some conditions, chaos in the sense of Devaney is stronger than that in the sense of Li-Yorke.For convenience, some definitions of relevant concepts given in [30] are listed below.Definition 5 (see [30, Definitions 2.1 and 2.4]).
Let(
X
,
d
) be a metric space and F
:
X
→
X a map. A point z
∈
X is called an expanding fixed point (or a repeller) of F in B
¯
r
(
z
) for some constant r
>
0, if F
(
z
)
=
z and there exists a constant λ
>
1 such that
(10)
d
(
F
(
x
)
,
F
(
y
)
)
≥
λ
d
(
x
,
y
)
∀
x
,
y
∈
B
¯
r
(
z
)
.
The constant λ is called an expanding coefficient of F in B
¯
r
(
z
). Furthermore, z is called a regular expanding fixed point of F in B
¯
r
(
z
) if z is an interior point of F
(
B
r
(
z
)
). Otherwise, z is called a singular expanding fixed point of F in B
¯
r
(
z
).
Now, we introduce some relative concepts for system (3), which are motivated by [15, Definitions 5.1 and 5.2]. There are identical concepts for system (1).Definition 6.
Consider the following.(i)
A pointx
∈
R
k
+
1 is called an m-periodic point of system (3) if x
∈
R
k
+
1 is an m-periodic point of its induced system (7); that is, F
m
(
x
)
=
x, F
j
(
x
)
≠
x, and 1
≤
j
≤
m
-
1. In the special case of m
=
1, x is called a fixed point or a steady state of system (3).
(ii)
The concepts of density of periodic points, topological transitivity, sensitive dependence on initial conditions, and the invariant set for system (3) are defined similarly to those for its induced system (7) in R
k
+
1.
(iii)
System (3) is said to be chaotic in the sense of Devaney (or Li-Yorke) on V
⊂
R
k
+
1 if its induced system (7) is chaotic in the sense of Devaney (or Li-Yorke) on V
⊂
R
k
+
1.
The following two lemmas will be used in the next section.Lemma 7.
Assume that the mapf in (1) is continuously differentiable in a neighborhood of (
0,0
) with f
(
0,0
)
=
0 and satisfies
(11)
|
f
x
(
0,0
)
|
-
|
f
y
(
0,0
)
|
>
1
;
then the fixed point O
:
=
(
0
,
…
,
0
)
T
∈
R
k
+
1 of system (6) is a regular expanding fixed point in some norm in R
k
+
1.Proof.
It follows fromf
(
0,0
)
=
0 that O is a fixed point of system (6). Since f is continuously differentiable in a neighborhood of (
0,0
), F is continuously differentiable in some neighborhood of O. The Jacobian matrix of map F in system (6) at O is
(12)
D
F
(
O
)
=
(
0
1
0
⋯
0
0
0
1
⋯
0
⋯
⋯
⋯
⋯
⋯
0
0
0
⋯
1
f
x
(
0,0
)
0
0
⋯
f
y
(
0,0
)
)
(
k
+
1
)
×
(
k
+
1
)
,
and its characteristic equation is
(13)
λ
k
+
1
-
f
y
(
0,0
)
λ
k
-
f
x
(
0,0
)
=
0
.
From |
f
x
(
0,0
)
|
-
|
f
y
(
0,0
)
|
>
1, we can show that all the eigenvalues of D
F
(
O
) have absolute values larger than 1. Otherwise, suppose that there exists an eigenvalue λ
0 of D
F
(
O
) with |
λ
0
|
≤
1; then we get the following inequality:
(14)
1
+
|
f
y
(
0,0
)
|
≥
|
λ
0
k
+
1
-
f
y
(
0,0
)
λ
0
k
|
=
|
f
x
(
0,0
)
|
>
1
+
|
f
y
(
0,0
)
|
,
which is a contradiction. Then it follows from [31, Theorem 4.3] that there exist a positive constant r
* and a norm ∥
·
∥
* in R
k
+
1 such that F is continuously differentiable in B
¯
r
*
(
O
) and O is an expanding fixed point of F in B
¯
r
*
(
O
) in the norm ∥
·
∥
*; that is,
(15)
∥
F
(
x
)
-
F
(
y
)
∥
*
≥
μ
∥
x
-
y
∥
*
,
∀
x
,
y
∈
B
¯
r
*
(
O
)
,
where μ
>
1 is an expanding coefficient of F in B
¯
r
*
(
O
). Further, it follows from [30, Lemma 2.2] that O is a regular expanding fixed point of system (6) in the norm ∥
·
∥
* in R
k
+
1. This completes the proof.Since the result in the following lemma is related to the one-sided symbolic dynamical system(
∑
2
+
‍
,
σ
), we briefly recall some results of it for convenience. Let
(16)
∑
2
+
≔
{
s
=
(
s
0
,
s
1
,
s
2
,
…
)
:
s
j
=
0
or
1
}
with the distance
(17)
ρ
(
s
,
t
)
∶
=
∑
i
=
0
∞
‍
|
s
i
-
t
i
|
2
i
,
where s
=
(
s
0
,
s
1
,
s
2
,
…
) and t
=
(
t
0
,
t
1
,
t
2
,
…
). Then (
∑
2
+
‍
,
ρ
) is a complete metric space and a Cantor set. The shift map σ
:
∑
2
+
‍
→
∑
2
+
‍ defined by σ
(
(
s
0
,
s
1
,
s
2
,
…
)
)
=
(
s
1
,
s
2
,
…
) is continuous. The dynamical system defined by σ is called a one-sided symbolic dynamical system. It has plentiful dynamical behaviors; we refer to [24, 26] for details. Particularly, it is chaotic in the sense of both Devaney and Li-Yorke and has a positive topological entropy.Lemma 8 (see [17, Theorem 4.3 and Corollary 4.2]).
Let a mapf
:
R
n
→
R
n have k (≥2) different fixed points z
1
,
…
,
z
k
∈
R
n. Assume that (i)
for eachi, 1
≤
i
≤
k, z
i is an expanding fixed point of f in some norm ∥
·
∥
i;
(ii)
f has a k-heteroclinic cycle connecting fixed points z
1
,
…
,
z
k and is continuously differentiable in some neighborhood of each point x
0 on the cycle satisfying det
⁡
D
f
(
x
0
)
≠
0.Then for each i, 1
≤
i
≤
k, and for each neighborhood U
i of z
i, there exist a positive integer n
i and a Cantor set Λ
i
⊂
U
i such that f
n
i
:
Λ
i
→
Λ
i is topologically conjugate to the one-sided symbolic dynamical system σ
:
∑
2
+
‍
→
∑
2
+
‍. Consequently, there exists a compact and perfect invariant set D
i
=
⋃
j
=
0
n
i
-
1
f
j
(
Λ
i
)
⊂
R
n, containing the Cantor set Λ
i, such that f is chaotic on D
i in the sense of Devaney as well as in the sense of Li-Yorke.Remark 9.
Under the conditions in Lemma8, there exists a positive integer p, such that f
p has a regular and nondegenerate k-heteroclinic cycle connecting repellers z
1
,
…
,
z
k in the Euclidean norm ∥
·
∥. Therefore, Lemma 8 can be briefly stated as the following: “a regular and nondegenerate heteroclinic cycle connecting repellers in R
n implies chaos in the sense of both Devaney and Li-Yorke." We refer to [17] for details.


## 3. A Chaotification Scheme

In this section, a chaotification scheme for the controlled system (3) with controller (4) is established for the case that the original system (1) has at least two fixed points. Here, we only need that the map f of the original system is continuously differentiable in a region containing two fixed points. In the case that the fixed points are more than two, if two of them satisfy conditions in the following theorem, then we can choose the two fixed points to establish a chaotification scheme by using Lemma 8 for k
=
2. If none of the two fixed points is the origin O, then we can choose a transformation of coordinates such that one fixed point becomes the origin O in a new coordinate system. Therefore, without loss of generality, we only discuss the case that the original system (1) has two fixed points O
=
(
0
,
…
,
0
)
T and P
:
=
(
x
*
,
…
,
x
*
)
T in R
k
+
1.Theorem 10.
Consider the controlled system (3) with controller (4). Assume that (i)
f is continuously differentiable in [
-
r
,
r
]
2 for some r
>
0 with f
(
0,0
)
=
0, which implies that there exist positive constants M and L such that for any (
x
,
y
)
∈
[
-
r
,
r
]
2
(18)
|
f
(
x
,
y
)
|
≤
M
,
|
f
x
(
x
,
y
)
|
≤
L
,
|
f
y
(
x
,
y
)
|
≤
L
;
(ii)
there exists a pointx
*
∈
(
-
r
,
r
) with x
*
≠
0 such that f
(
x
*
,
x
*
)
=
x
*.Then there exist two positive constants α
0 and β
0 satisfying
(19)
α
0
>
2
(
M
+
|
x
*
|
)
,
β
0
=
2
m
0
π
|
x
*
|
>
1
+
2
L
α
0
,
where m
0 is some positive integer, such that, for any α
>
α
0 and β
=
β
0, the controlled system (3) with controller (4) is chaotic in the sense of both Devaney and Li-Yorke.Proof.
In order to prove that system (3) with controller (4) is chaotic in the sense of both Devaney and Li-Yorke, we only need to prove that its reformulated system (7) is chaotic in the sense of both Devaney and Li-Yorke. Lemma 8 is used to prove this theorem. Thus it suffices to show that all the assumptions in Lemma 8 hold for k
=
2.
For convenience, letα
>
α
0 and β
=
2
m
π
/
|
x
*
|
>
(
1
+
2
L
)
/
α
0 throughout the proof, where m is an undetermined integer.
By assumption (i), we find thatg is continuously differentiable in [
-
r
,
r
]
2 and G is continuously differentiable in [
-
r
,
r
]
k
+
1. It is clear that g
(
0,0
)
=
0 and g
(
x
*
,
x
*
)
=
x
*. It can also easily be proved that O and P
=
(
x
*
,
…
,
x
*
)
T
∈
R
k
+
1 are two fixed points of G. From the last two relations of (18), it follows that
(20)
|
g
x
(
0,0
)
|
=
|
f
x
(
0,0
)
+
α
β
|
≥
α
β
-
|
f
x
(
0,0
)
|
≥
α
β
-
L
>
1
+
L
≥
1
+
|
f
y
(
0,0
)
|
=
1
+
|
g
y
(
0,0
)
|
.
Similarly, it can also be shown that
(21)
|
g
x
(
x
*
,
x
*
)
|
=
|
f
x
(
x
*
,
x
*
)
+
α
β
|
>
1
+
|
g
y
(
x
*
,
x
*
)
|
.
Then, it follows from Lemma 7 that O and P are two regular expanding fixed points of system (7). That is, there exist two positive constants r
1
<
r, r
2
<
r and two norms ∥
·
∥
1, ∥
·
∥
2 in R
k
+
1 such that O and P are two regular expanding fixed points of G in B
¯
r
1
(
O
) in norm ∥
·
∥
1 and in B
¯
r
2
(
P
) in norm ∥
·
∥
2, respectively. For convenience, we can choose r
1 and r
2 to be very small such that B
r
1
(
O
)
∩
B
r
2
(
P
)
=
∅.
Next, we need to show thatG has a 2-heteroclinic cycle connecting fixed points O and P. There exist small intervals U
1 containing 0 and U
2 containing x
* such that U
1
×
U
1
×
⋯
×
U
1
⊂
B
r
1
(
O
) and U
2
×
U
2
×
⋯
×
U
2
⊂
B
r
2
(
O
). Consider the following equation:
(22)
h
1
(
x
)
∶
=
f
(
x
,
x
*
)
+
α
sin
(
β
x
)
-
x
*
=
0
.
Obviously, h
1 is continuously differentiable in [
-
r
,
r
]. It is easy to see from (18) that
(23)
h
1
(
|
x
*
|
4
m
)
=
f
(
|
x
*
|
4
m
,
x
*
)
+
α
-
x
*
≥
α
-
M
-
|
x
*
|
>
0
,
h
1
(
3
|
x
*
|
4
m
)
=
f
(
3
|
x
*
|
4
m
,
x
*
)
-
α
-
x
*
≤
M
+
|
x
*
|
-
α
<
0
,
which implies that there exists a point x
1 with |
x
*
|
/
4
m
<
x
1
<
3
|
x
*
|
/
4
m such that h
1
(
x
1
)
=
0 by the continuity of h
1. Consider the following two equations:
(24)
h
2
(
x
)
∶
=
f
(
x
,
x
1
)
+
α
sin
(
β
x
)
-
x
*
=
0
,
h
3
(
x
)
∶
=
f
(
x
,
0
)
+
α
sin
(
β
x
)
=
0
.
With a similar method, we can also show that there exist two points x
2 with |
x
*
|
/
4
m
<
x
2
<
3
|
x
*
|
/
4
m and x
3 with |
x
*
|
+
|
x
*
|
/
4
m
<
x
3
<
|
x
*
|
+
3
|
x
*
|
/
4
m such that h
2
(
x
2
)
=
0 and   h
3
(
x
3
)
=
0. Similarly, the following equation
(25)
h
4
(
x
)
∶
=
f
(
x
,
x
3
)
+
α
sin
(
β
x
)
=
0
also has a solution x
4 with |
x
*
|
+
|
x
*
|
/
4
m
<
x
4
<
|
x
*
|
+
3
|
x
*
|
/
4
m such that h
4
(
x
4
)
=
0. We can choose a large positive integer m
0 such that for any m
≥
m
0 the points x
1, x
2 are in U
1 and x
3, x
4 are in U
2.
TakeO
0
=
(
x
2
,
x
1
,
…
,
x
1
)
T
∈
R
k
+
1. It is clear that O
0
∈
B
r
1
(
O
) and O
0
≠
O. Set O
j
=
G
(
O
j
-
1
) for 1
≤
j
≤
k. We can easily show that O
j
=
(
x
1
,
…
,
x
1
,
x
*
,
…
,
x
*
︸
j
)
T
∉
B
r
1
(
O
) for 1
≤
j
≤
k, and
(26)
G
k
+
1
(
O
0
)
=
P
.
TakeP
0
=
(
x
4
,
x
3
,
…
,
x
3
)
T
∈
R
k
+
1. It is also clear that P
0
∈
B
r
2
(
P
) and P
0
≠
P. Set P
j
=
G
(
P
j
-
1
) for 1
≤
j
≤
k. It can also easily be shown that P
j
=
(
x
3
,
…
,
x
3
,
0
,
…
,
0
︸
j
)
T
∉
B
r
2
(
P
) for 1
≤
j
≤
k, and
(27)
G
k
+
1
(
P
0
)
=
O
.
Therefore, G has a 2-heteroclinic cycle connecting repellers O and P.
Finally, we will show that(28)
det
⁡
D
G
(
O
j
)
≠
0
,
det
⁡
D
G
(
P
j
)
≠
0
,
for
0
≤
j
≤
k
.
We use the method of proof by contradiction to prove it. For simplicity, we only prove that condition (28) holds for O
0. Suppose that det
⁡
D
G
(
O
0
)
=
0. A direct calculation shows that, for any u
=
(
u
1
,
…
,
u
k
+
1
)
T
∈
R
k
+
1,
(29)
det
⁡
D
G
(
u
)
=
(
-
1
)
k
[
f
x
(
u
1
,
u
k
+
1
)
+
α
β
cos
⁡
⁡
(
β
u
1
)
]
.
Then it follows from (29) that
(30)
f
x
(
x
2
,
x
1
)
+
α
β
cos
⁡
⁡
(
β
x
2
)
=
0
.
Hence, cos
⁡
(
β
x
2
)
=
-
(
1
/
α
β
)
f
x
(
x
2
,
x
1
). On the other hand, it follows from h
2
(
x
2
)
=
0 that sin
(
β
x
2
)
=
(
1
/
α
)
[
x
*
-
f
(
x
2
,
x
1
)
]. Then, we get the following contradiction:
(31)
1
=
[
f
x
(
x
2
,
x
1
)
]
2
α
2
β
2
+
[
x
*
-
f
(
x
2
,
x
1
)
]
2
α
2
<
L
2
(
1
+
2
L
)
2
+
(
M
+
|
x
*
|
)
2
4
(
M
+
|
x
*
|
)
2
<
1
2
.
Therefore, det
⁡
D
G
(
O
0
)
≠
0. Similarly, we can prove that condition (28) holds for 0
≤
j
≤
k.
Therefore, all the assumptions in Lemma8 are satisfied for k
=
2. It follows from Lemma 8 that, for any α
>
α
0 and β
=
β
0, there exists regular and nondegenerate 2-heteroclinic cycle repellers O and P. Consequently, system (7) and thus system (3) with controller (4) are chaotic in the sense of both Devaney and Li-Yorke. This completes the proof.Remark 11.
From the proof of Theorem10, we see that there exists some positive integer m
0 such that, for any α
>
α
0, β
0
=
2
m
0
π
/
|
x
*
|
>
(
1
+
2
L
)
/
α
0, system (7) is chaotic in the sense of both Devaney and Li-Yorke. However, it is very difficult to determine the particular integer m
0 since the expanding area of a fixed point is not easy to obtain, and there are few methods to determine the concrete expanding area of a fixed point in the existing literatures. In practical problems, we can take the positive integer m
0 large enough such that controller (4) can be used to chaotify system (1).Remark 12.
There are many delay discrete dynamical systems which have more than two fixed points. As all or some of the fixed points satisfy assumptions in Theorem10, which are not very strict conditions, we can choose two of them and use the chaotification scheme of this paper to chaotify these systems. Since the result of Theorem 10 follows from the result of Lemma 8, there will be many chaotic invariant sets when using the chaotification scheme to chaotify these systems. Therefore, the chaotic behaviors induced by a heteroclinic cycle connecting repellers seemed to be more complex than those induced by a single snap-back repeller. The difference between them will be our future research.


## 4. An Example

In the last section, we present an example of chaotification for the delay difference equation (1) with computer simulations. The map f in (1) is taken as follows:
(32)
f
(
x
,
y
)
=
2
sin
⁡
[
π
12
(
x
+
y
)
]
.It is obvious thatf is continuously differentiable on R
2 and satisfies condition (18); that is, for any (
x
,
y
)
∈
R
2,
(33)
|
f
(
x
,
y
)
|
≤
2
,
|
f
x
(
x
,
y
)
|
≤
π
6
,
|
f
y
(
x
,
y
)
|
≤
π
6
,
where M
=
2 and L
=
π
/
6 in condition (18). It is also clear that f
(
0,0
)
=
0 and there exists a point x
*
=
1 such that f
(
1,1
)
=
1. Therefore, all the assumptions in Theorem 10 are satisfied. It follows from Theorem 10 that there exist two positive constants
(34)
α
0
>
2
(
M
+
|
x
*
|
)
=
6
,
β
0
=
2
m
0
π
=
2
m
0
π
|
x
*
|
>
3
+
π
18
>
1
+
2
L
α
0
,
where m
0 is some positive integer, such that, for any α
>
α
0 and β
=
β
0, the controlled system (3) with controller (4) is chaotic in the sense of both Devaney and Li-Yorke.In fact, it is obvious that the solutions of the uncontrolled system (6) are bounded in [
-
2,2
]
2 for k
=
1. There are three fixed points for the uncontrolled system (6); that is, O
=
(
0,0
)
T, P
=
(
1,1
)
T, Q
=
(
-
1
,
-
1
)
T. One can easily verify that O is an unstable fixed point and that P and Q are two stable fixed points. When we take an initial condition u
(
0
)
=
(
0.01,0.01
)
T, the solution u
(
n
) of the uncontrolled system (6) should tend to the stable fixed point P when n tends to infinity. This conforms to Figure 1, where the curve tends from (
0.01,0.01
)
T to the stable fixed point (
1,1
)
T and n is taken from 0 to 20000 for simulation. There is a similar conclusion for the case k
=
2. For simplicity, we omit it.Figure 1
2D computer simulation result shows simple dynamical behaviors of the uncontrolled system (6) in the (
u
1
,
u
2
) space for k
=
1, and n from 0 to 20000, with the initial condition u
(
0
)
=
(
0.01,0.01
)
T.In order to help better visualize the theoretical result of Theorem10, we take k
=
1,2, m
0
=
50 and
(35)
α
=
100
,
β
=
100
π
,
for computer simulations. Both of them satisfy the above conditions. Consequently, the controlled system (7) should be chaotic in the sense of both Devaney and Li-Yorke. It is obvious that the solutions of controlled system (7) are bounded in [
-
102,102
]
2 and [
-
102,102
]
3 for k
=
1 and k
=
2, respectively. The simulated results in Figures 2 and 4 show that the controlled system (7) indeed has complex behaviors, where n is taken from 0 to 20000.Figure 2
2D computer simulation result shows complex dynamical behaviors of the controlled system (7) in the (
u
1
,
u
2
) space for α
=
100, β
=
100
π, k
=
1, and n from 0 to 20000, with the initial condition u
(
0
)
=
(
0.01,0.01
)
T.In summary, the simulated results show that the uncontrolled system (6), that is, system (1), has simple dynamical behaviors, and the controlled system (7), that is, system (3) with controller (4), has complex dynamical behaviors; see Figures 1, 2, 3, and 4. The graphs presented indeed display an expected well-behaved structure in one moment, and after the chaotification treatment the referred system presents some behavior that resembles chaos. Nothing is less than expected.Figure 3
3D computer simulation result shows simple dynamical behaviors of the uncontrolled system (6) in the (
u
1
,
u
2
,
u
3
) space for k
=
2, and n from 0 to 20000, with the initial condition u
(
0
)
=
(
0.01,0.01,0.01
)
T.Figure 4
3D computer simulation result shows complex dynamical behaviors of the controlled system (7) in the (
u
1
,
u
2
,
u
3
) space for α
=
100, β
=
100
π, k
=
2, and n from 0 to 20000, with the initial condition u
(
0
)
=
(
0.01,0.01,0.01
)
T.


## 5. Conclusion

In this paper, we consider anticontrol of chaos for a class of delay difference equations via the feedback control technique. Based on the result that a regular and nondegenerate heteroclinic cycle connecting repellers for maps implies chaos, we establish a chaotification theorem. The controlled system is proved to be chaotic in the sense of both Devaney and Li-Yorke. It is noted that there are many delay discrete dynamical systems which have more than two fixed points. As all or some of the fixed points satisfy assumptions in Theorem10, which are not very strict conditions, we can choose two of them and use the chaotification scheme established in this paper to chaotify these systems. Numerical simulations confirm the theoretical analysis. However, the map of the original system needs to satisfy some conditions in Theorem 10. Therefore, it is very interesting to explore the chaotification scheme for more general maps, which will be our further research.



---

*Source: 260150-2014-04-13.xml*