# Almost Periodic Sequence Solutions of a Discrete Predator-Prey System with Beddington-DeAngelis Functional Response

Authors: Zengji Du; Wenbin Li
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

This paper considers a discrete predator-prey system with Beddington-DeAngelis functional response. Sufficient conditions are obtained for the existence of the almost periodic solution which is uniformly asymptotically stable by constructing a Lyapunov function.


---

## Body

## 1. Introduction

In the past decades, the predator-prey competition models have been extensively studied by many authors (see [1–7]). Many excellent works have been done for the predator-prey model with functional response, such as Zhu and Wang [8] who considered a Volterra model with modified Leslie-Gower Holling-type II schemes. Cai et al. [9] studied the positive periodic solution for a multispecies competition-predator system with the Holling III functional and time delays. A well-known model of such systems is the predator-prey model with a Beddington-DeAngelis functional response which was originally proposed by Beddington [10] and DeAngelis et al. [11], independently. The dynamics of this model is described by the following differential equations:
(1)
x
˙
=
r
x
(
t
)
[
1
-
x
(
t
)
K
]
-
b
x
(
t
)
y
(
t
)
1
+
n
x
(
t
)
+
m
y
(
t
)
,
y
˙
=
y
(
t
)
[
-
d
+
f
b
x
(
t
)
1
+
n
x
(
t
)
+
m
y
(
t
)
]
,
where x and y represent prey and predator densities, respectively. Usually, the constant r is called intrinsic growth rate of the prey; K is the carrying capacity of the prey; b and n are positive constants that describe the effects of capture rate and handling time, respectively, on the feeding rate; d is the death rate of the predator; f is the birth rate of the predator; m
≥
0 (units: 1/predator) is a constant describing the magnitude of interference among predators. Many excellent works have been done for the predator-prey system with a Beddington-DeAngelis functional response, such as Fan and Kuang [12], Liu et al. [13], and Baek [14].It has been found that discrete time models governed by difference equations are more appropriate than the continuous ones when the populations have nonoverlapping generations. Discrete time models can also provide efficient computational models of continuous models for numerical simulations. There are some existing results on discrete predator-prey systems [15–17]. For example, in [15], by using the method of upper and lower solutions and the degree theory the authors have studied the existence of periodic positive solutions for a competitive system with two parameters. Zhang and Wang [16] studied the following discrete model:
(2)
x
(
k
+
1
)
=
x
(
k
)
exp
⁡
[
-
c
(
k
)
y
(
k
)
α
(
k
)
+
β
(
k
)
x
(
k
)
+
γ
(
k
)
y
(
k
)
]
a
(
k
)
-
b
(
k
)
x
(
k
)
-
c
(
k
)
y
(
k
)
α
(
k
)
+
β
(
k
)
x
(
k
)
+
γ
(
k
)
y
(
k
)
]
,
y
(
k
+
1
)
=
y
(
k
)
exp
⁡
[
+
f
(
k
)
y
(
k
)
α
(
k
)
+
β
(
k
)
x
(
k
)
+
γ
(
k
)
y
(
k
)
]
-
d
(
k
)
+
f
(
k
)
y
(
k
)
α
(
k
)
+
β
(
k
)
x
(
k
)
+
γ
(
k
)
y
(
k
)
]
.
The authors used the Mawhin’s coincidence degree theory to obtain some sufficient conditions for the existence of positive solutions.But, nowadays, models with almost periodic coefficient have drawn more attention. Li and Chen [18] considered the almost periodic solutions of the following discrete almost periodic logistic equation:
(3)
x
(
n
+
1
)
=
x
(
n
)
exp
⁡
{
r
(
n
)
(
1
-
x
(
n
)
K
(
n
)
)
}
.Niu and Chen [19] proposed the following model:
(4)
x
1
(
n
+
1
)
=
x
1
(
n
)
×
exp
⁡
[
×
(
1
-
x
1
(
n
)
K
1
(
n
)
-
μ
2
(
n
)
x
2
(
n
)
-
b
1
(
n
)
μ
1
(
n
)
)
]
r
1
(
n
)
×
(
1
-
x
1
(
n
)
K
1
(
n
)
-
μ
2
(
n
)
x
2
(
n
)
-
b
1
(
n
)
μ
1
(
n
)
)
]
,
x
2
(
n
+
1
)
=
x
2
(
n
)
×
exp
⁡
[
(
1
-
x
2
(
n
)
K
2
(
n
)
-
μ
1
(
n
)
x
1
(
n
)
-
b
2
(
n
)
μ
2
(
n
)
)
]
r
2
(
n
)
×
(
1
-
x
2
(
n
)
K
2
(
n
)
-
μ
1
(
n
)
x
1
(
n
)
-
b
2
(
n
)
μ
2
(
n
)
)
]
,
Δ
μ
1
(
n
)
=
-
α
1
(
n
)
μ
1
(
n
)
+
β
1
(
n
)
x
1
(
n
)
,
Δ
μ
2
(
n
)
=
-
α
2
(
n
)
μ
2
(
n
)
+
β
2
(
n
)
x
2
(
n
)
.
By constructing a suitable Lyapunov function, they obtained the existence and uniqueness of the almost periodic solution which is uniformly asymptotically stable.Li et al. [20] studied the following system:
(5)
x
(
k
+
1
)
=
x
(
k
)
×
exp
⁡
{
-
p
(
k
,
x
(
k
)
,
y
(
k
)
,
x
(
k
-
μ
)
,
y
(
k
-
ν
)
)
y
(
k
)
x
(
k
)
}
a
(
k
)
-
b
(
k
)
x
(
k
)
-
p
(
k
,
x
(
k
)
,
y
(
k
)
,
x
(
k
-
μ
)
,
y
(
k
-
ν
)
)
y
(
k
)
x
(
k
)
}
,



y
(
k
+
1
)
=
y
(
k
)
exp
⁡
{
c
(
k
)
-
d
(
k
)
y
(
k
)
x
(
k
-
μ
)
}
.
With the method of the theory of difference inequality and constructing a suitable Lyapunov function, they obtained the permanence and the almost periodic solution of the system.Inspired by the above papers, in this paper, we consider the following discrete predator-prey system:(6)
x
1
(
n
+
1
)
=
x
1
(
n
)
×
exp
⁡
[
r
1
(
n
)
(
1
-
x
1
(
n
)
K
1
(
n
)
)
-
b
(
n
)
x
2
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
]
,
x
2
(
n
+
1
)
=
x
2
(
n
)
×
exp
⁡
[
+
c
(
n
)
x
1
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
]
-
r
2
(
n
)
+
c
(
n
)
x
1
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
]
,
where x
1
(
n
) and x
2
(
n
) represent prey and predator densities at time t.From the point of view of biology, we assumed that the initial conditions of (6) are of the form
(7)
x
i
(
0
)
>
0
,
i
=
1,2
.
Then, it is easy to see that the solutions of (6) with the initial condition (7) are defined and remain positive for all n
∈
Z
+. Throughout this paper, for any bounded sequence {
a
(
n
)
}, we denote a
M
=
sup
⁡
n
∈
N
{
a
(
n
)
} and a
L
=
inf
⁡
n
∈
N
{
a
(
n
)
}, and we assume that (H1)
{
r
1
(
n
)
}, {
r
2
(
n
)
}, {
K
(
n
)
}, {
b
(
n
)
}, {
c
(
n
)
}, {
α
(
n
)
}, {
β
(
n
)
}, and {
γ
(
n
)
} are bounded nonnegative almost periodic sequences such that
(8)
0
<
r
1
L
≤
r
1
(
n
)
≤
r
1
M
,
0
<
r
2
L
≤
r
2
(
n
)
≤
r
2
M
,
0
<
K
L
≤
K
(
n
)
≤
K
M
,
0
<
α
L
≤
α
(
n
)
≤
α
M
,
0
<
β
L
≤
β
(
n
)
≤
β
M
,
0
<
γ
L
≤
γ
(
n
)
≤
γ
M
,
0
<
b
L
≤
b
(
n
)
≤
b
M
,
0
<
c
L
≤
c
(
n
)
≤
c
M
,
(H2)
r
1
L
-
(
b
M
/
γ
L
)
>
0,
(H3)
(
c
L
/
β
M
)
(
1
-
α
M
)
-
r
2
M
>
0.The organization of this paper is as follows. In Section2, we will introduce some definitions and several useful definitions and lemmas. In Section 3, by applying the theory of difference inequality, we get the permanence of system (6). In Section 4, by constructing a suitable Lyapunov function, we obtain the existence of the almost periodic solution for system (6) which is uniformly asymptotically stable. Finally, we give some examples and numerical simulations to verify our results.


## 2. Preliminaries

In this section, we will introduce some basic definitions and several useful lemmas.Definition 1.
System (6) is said to be permanent if there exist positive constants M
i, m
i, which are independent of the solutions of the system, such that any positive solution (
x
1
(
n
)
,
x
2
(
n
)
)
T of system (6) satisfies
(9)
m
i
≤
lim
⁡
n
→
+
∞
inf
⁡
x
i
(
n
)
≤
lim
⁡
n
→
+
∞
sup
⁡
x
i
(
n
)
≤
M
i
,
i
=
1,2
.Lemma 2 (see [21]).
Assume that{
x
(
n
)
} satisfies x
(
n
)
>
0 and
(10)
x
(
n
+
1
)
≤
x
(
n
)
exp
⁡
{
a
(
n
)
-
b
(
n
)
x
(
n
)
}
,
n
∈
N
,
where a
(
n
) and b
(
n
) are nonnegative sequences bounded above and below by positive constants. Then,
(11)
lim
⁡
n
→
+
∞
sup
⁡
x
(
n
)
≤
1
b
L
exp
⁡
{
a
M
-
1
}
.Lemma 3 (see [21]).
Assume that{
x
(
n
)
} satisfies x
(
n
)
>
0 and
(12)
x
(
n
+
1
)
≥
x
(
n
)
exp
⁡
⁡
{
a
(
n
)
-
b
(
n
)
x
(
n
)
}
,
n
≥
N
0
,
and lim
⁡
n
→
+
∞
sup
⁡
x
(
n
)
≤
x
*, x
(
N
0
)
>
0, where a
(
n
) and b
(
n
) are nonnegative sequences bounded above and below by positive constants and N
0
∈
N. Then,
(13)
lim
⁡
n
→
+
∞
inf
⁡
x
(
n
)
≥
min
⁡
⁡
{
a
L
b
M
exp
⁡
⁡
{
a
M
-
b
M
x
*
}
,
a
L
b
M
}
.Lemma 4 (see [22]).
Letx
(
n
) and b
(
n
) be nonnegative sequences defined on N, and c
≥
0 is a constant. If
(14)
x
(
n
)
≤
c
+
∑
s
=
0
n
-
1
‍
b
(
s
)
x
(
s
)
,
n
∈
N
,
then
(15)
x
(
n
)
≤
c
∏
s
=
0
n
-
1
‍
[
1
+
b
(
s
)
]
,
n
∈
N
.Definition 5 (see [23]).
A sequencex
:
Z
→
R is called an almost periodic sequence if the ϵ-translation number set of x
(16)
E
{
ϵ
,
x
}
=
{
τ
∈
Z
:
|
x
(
n
+
τ
)
-
x
(
n
)
|
<
ϵ
,
∀
n
∈
Z
}
is a relatively dense set in Z for all ϵ
>
0; that is, for any given ϵ
>
0, there exists an integer l
(
ϵ
)
>
0 such that each interval of length l
(
ϵ
) contains an integer τ
∈
E
{
ϵ
,
x
} such that
(17)
|
x
(
n
+
τ
)
-
x
(
n
)
|
<
ϵ
,
∀
n
∈
Z
,
τ is called the ϵ-translation number or ϵ
-almost period.Definition 6 (see [23]).
Letf
:
Z
×
D
→
R, where D is an open set in R; f
(
n
,
x
) is said to be almost periodic in n uniformly for x
∈
D, or uniformly almost periodic for short, if, for any ϵ
>
0 and any compact set S in D, there exists a positive integer l
(
ϵ
,
S
) such that any interval of length l
(
ϵ
,
S
) contains a integer τ for which
(18)
|
f
(
n
+
τ
,
x
)
-
f
(
n
,
x
)
|
<
ϵ
,
for all n
∈
Z and x
∈
S. τ is called the ϵ-translation number of f
(
n
,
x
).Lemma 7 (see [23]).
{
x
(
n
)
} is an almost periodic sequence if and only if for any sequence {
m
i
}
⊂
Z there exists a subsequence {
m
i
k
}
⊂
{
m
i
} such that x
(
n
+
m
i
k
) converges uniformly on n
∈
Z as k
→
∞. Furthermore, the limit sequence is also an almost periodic sequence.In [24], Zhang considered the following almost periodic difference system:
(19)
x
(
n
+
1
)
=
f
(
n
,
x
(
n
)
)
,
n
∈
Z
+
,
where f
:
Z
×
S
B
→
R, S
B
=
{
x
∈
R
:
∥
x
∥
<
B
}, and f
(
n
,
x
) is almost periodic in n uniformly for x
∈
S
B and is continuous in x. The product system of (19) is the following system:
(20)
x
(
n
+
1
)
=
f
(
n
,
x
(
n
)
)
,
y
(
n
+
1
)
=
f
(
n
,
y
(
n
)
)
,
and the following lemma is obtained.Lemma 8 (see [24]).
Suppose that there exists a Lyapunov functionalV
(
n
,
x
,
y
) defined for n
∈
Z
+, ∥
x
∥
<
B, ∥
y
∥
<
B satisfying the following conditions: [C1]
a
(
∥
x
-
y
∥
)
≤
V
(
n
,
x
,
y
)
≤
b
(
∥
x
-
y
∥
), where a
,
b
∈
T
^ with
(21)
T
^
=
{
a
∈
C
(
R
+
,
R
+
)
:
a
(
0
)
=
0
and
a
is
increasing
}
,
[C2]
|
V
(
n
,
x
1
,
y
1
)
-
V
(
n
,
x
2
,
y
2
)
|
≤
L
(
∥
x
1
-
x
2
∥
+
∥
y
1
-
y
2
∥
), where L
>
0 is a constant,
[C3]
Δ
V
(
20
)
≤
-
λ
V
(
n
,
x
,
y
), where 0
<
λ
<
1 is a constant and
(22)
Δ
V
(
20
)
=
V
(
n
+
1
,
f
(
n
,
x
)
,
f
(
n
,
y
)
)
-
V
(
n
,
x
,
y
)
.Moreover, if there exists a solutionφ
(
n
) of system (20) such that ∥
φ
(
n
)
∥
<
B
*
<
B for n
∈
Z
+, then there exists a unique uniformly asymptotically stable almost periodic solution p
(
n
) of system (20) which is bounded by B
*. In particular, if f
(
n
,
x
) is ω-periodic function, then there exists a unique uniformly asymptotically stable ω-periodic solution of (20).


## 3. Permanence

Theorem 9.
Assume that (H1), (H2), and (H3) hold, then every solution (
x
1
(
n
)
,
x
2
(
n
)
)
T of system (6) satisfies
(23)
x
i
*
≤
lim
⁡
n
→
+
∞
inf
⁡
x
i
(
n
)
≤
lim
⁡
n
→
+
∞
sup
⁡
x
i
(
n
)
≤
x
i
*
,
i
=
1,2
.
That is, system (6) is permanent, where
(24)
x
1
*
=
K
M
r
1
L
exp
⁡
⁡
{
r
1
M
-
1
}
,
x
1
*
=
K
L
(
r
1
L
γ
L
-
b
M
)
γ
L
r
1
M
exp
⁡
⁡
{
r
1
L
-
b
M
γ
L
-
r
1
M
K
L
x
1
*
}
,
x
2
*
=
exp
⁡
{
2
(
c
M
β
L
-
r
2
L
)
}
,
x
2
*
=
min
⁡
⁡
{
T
exp
⁡
{
c
L
(
1
-
α
M
)
-
r
2
M
β
M
β
M
-
c
M
γ
M
β
L
x
2
*
}
,
T
}
T
=
β
L
c
L
(
1
-
α
M
)
-
β
L
β
M
r
2
M
c
M
γ
M
β
M
.Proof.
Let(
x
1
(
n
)
,
x
2
(
n
)
)
T be any positive solution of system (6); from the first equation of system (6), it follows that
(25)
x
1
(
n
+
1
)
≤
x
1
(
n
)
exp
⁡
⁡
{
r
1
(
n
)
-
r
1
(
n
)
K
(
n
)
x
1
(
n
)
}
.
Thus, as a direct corollary of Lemma 2, it follows that
(26)
lim
⁡
n
→
+
∞
sup
⁡
x
1
(
n
)
≤
K
M
r
1
L
exp
⁡
⁡
{
r
1
M
-
1
}
≔
x
1
*
.
On the other hand, from the first equation of system (6), we obtain
(27)
x
1
(
n
+
1
)
≥
x
1
(
n
)
exp
⁡
⁡
{
r
1
(
n
)
-
r
1
(
n
)
K
(
n
)
x
1
(
n
)
-
b
(
n
)
x
2
(
n
)
γ
(
n
)
x
2
(
n
)
}
=
x
1
(
n
)
exp
⁡
⁡
{
r
1
(
n
)
-
b
(
n
)
γ
(
n
)
-
r
1
(
n
)
K
(
n
)
x
1
(
n
)
}
.
According to Lemma 3 and assumption (H2), we have
(28)
lim
⁡
n
→
+
∞
inf
⁡
x
1
(
n
)
≥
min
⁡
{
K
L
(
r
1
L
γ
L
-
b
M
)
γ
L
r
1
M
×
exp
⁡
{
r
1
L
-
b
M
γ
L
-
r
1
M
K
L
x
1
*
}
,
K
L
(
r
1
L
γ
L
-
b
M
)
γ
L
r
1
M
}
.
Notice that
(29)
r
1
M
/
K
L
r
1
L
-
b
M
/
γ
L
·
x
1
*
=
r
1
M
/
K
L
r
1
L
-
b
M
/
γ
L
·
K
M
r
1
L
exp
⁡
{
r
1
M
-
1
}
=
r
1
M
r
1
L
·
K
M
K
L
·
exp
⁡
{
r
1
M
-
1
}
r
1
L
-
b
M
/
γ
L
>
r
1
M
r
1
L
·
K
M
K
L
·
r
1
M
r
1
L
>
1
.
In the above inequality, using the Bernoulli inequality e
x
>
1
+
x, for x
>
-
1, one has
(30)
lim
⁡
n
→
+
∞
inf
⁡
x
1
(
n
)
≥
K
L
(
r
1
L
γ
L
-
b
M
)
γ
L
r
1
M
exp
⁡
⁡
{
r
1
L
-
b
M
γ
L
-
r
1
M
K
L
x
1
*
}
≔
x
1
*
.
From the second equation of system (6), we can obtain
(31)
x
2
(
n
+
1
)
≤
x
2
(
n
)
exp
⁡
⁡
{
-
r
2
(
n
)
+
c
(
n
)
β
(
n
)
}
.
Let x
2
(
n
)
=
exp
⁡
{
y
(
n
)
}; then
(32)
y
(
n
+
1
)
≤
y
(
n
)
+
c
(
n
)
β
(
n
)
-
r
2
(
n
)
≤
∑
s
=
0
n
‍
f
(
s
)
y
(
s
)
+
c
M
β
L
-
r
2
L
,
where
(33)
f
(
s
)
=
{
0
,
0
≤
s
≤
n
-
1
,
1
,
s
=
n
.
Since
(34)
c
M
β
L
-
r
2
L
≥
c
L
β
M
(
1
-
α
M
)
-
r
2
M
>
0
,
by applying Lemma 4, we have
(35)
y
(
n
+
1
)
≤
2
(
c
M
β
L
-
r
2
L
)
.
Thus,
(36)
lim
⁡
n
→
+
∞
sup
⁡
x
2
(
n
)
≤
exp
⁡
⁡
{
2
(
c
M
β
L
-
r
2
L
)
}
≔
x
2
*
.
By the second equation of system (6), we can get that
(37)
x
2
(
n
+
1
)
=
x
2
(
n
)
exp
⁡
[
+
c
(
n
)
x
1
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
]
-
r
2
(
n
)
+
c
(
n
)
x
1
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
]
=
x
2
(
n
)
exp
⁡
{
-
1
β
(
n
)
+
1
β
(
n
)
]
}
-
r
2
(
n
)
+
c
(
n
)
×
[
x
1
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
-
1
β
(
n
)
+
1
β
(
n
)
]
}
=
x
2
(
n
)
exp
⁡
{
c
(
n
)
β
(
n
)
-
r
2
(
n
)
-
c
(
n
)
β
(
n
)
×
α
(
n
)
+
γ
(
n
)
x
2
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
}
=
x
2
(
n
)
×
exp
⁡
{
c
(
n
)
β
(
n
)
×
(
1
-
α
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
)
-
r
2
(
n
)
-
c
(
n
)
β
(
n
)
×
γ
(
n
)
α
(
n
)
+
β
(
n
)
x
1
(
n
)
+
γ
(
n
)
x
2
(
n
)
x
2
(
n
)
}
≥
x
2
(
n
)
exp
⁡
{
c
L
β
M
(
1
-
α
M
)
-
r
2
M
-
c
M
γ
M
β
L
x
2
(
n
)
}
.
According to (H3), applying Lemma 3 to inequality (37), one has
(38)
lim
⁡
n
→
+
∞
inf
⁡
x
2
(
n
)
≥
min
⁡
⁡
{
T
exp
⁡
{
c
L
(
1
-
α
M
)
β
M
-
r
2
M
-
c
M
γ
M
β
L
x
2
*
}
,
T
}
≔
x
2
*
.
The proof of the theorem is completed.


## 4. Existence of Globally Attractive Almost Periodic Solutions

In this section, we study the existence of a globally attractive almost periodic sequence solution of system (6).First, we denote byΩ the set of all solutions (
x
1
(
n
)
,
x
2
(
n
)
) of system (6) satisfying x
i
*
≤
x
i
(
n
)
≤
x
i
*, i
=
1,2 for all n
∈
Z
+.In order to apply Lemma8, we should prove that there exists a bounded solution of system (6) and then construct an adaptive Lyapunov functional for system (6).Theorem 10.
Assume that (H1), (H2), and (H3) hold. Then Ω
≠
∅.Proof.
By the almost periodicity of{
r
1
(
n
)
}, {
r
2
(
n
)
}, {
K
(
n
)
}, {
b
(
n
)
}, {
c
(
n
)
}, {
α
(
n
)
}, {
β
(
n
)
}, and {
γ
(
n
)
}, there exists an integer valued sequence τ
p with τ
p
→
∞ as p
→
∞ such that
(39)
r
1
(
n
+
τ
p
)
⟶
r
1
(
n
)
,
r
2
(
n
+
τ
p
)
⟶
r
2
(
n
)
,
K
(
n
+
τ
p
)
⟶
K
(
n
)
,
b
(
n
+
τ
p
)
⟶
b
(
n
)
,
c
(
n
+
τ
p
)
⟶
c
(
n
)
,
α
(
n
+
τ
p
)
⟶
α
(
n
)
,
β
(
n
+
τ
p
)
⟶
β
(
n
)
,
γ
(
n
+
τ
p
)
⟶
γ
(
n
)
as p
→
∞ uniformly on Z
+.
Letϵ be an arbitrary small positive number. It follows from Theorem 9 that there exists a positive integer N
0 such that
(40)
x
i
*
-
ϵ
≤
x
i
(
n
)
≤
x
i
*
+
ϵ
,
i
=
1,2
,
∀
n
>
N
0
.
Write x
i
p
(
n
)
=
x
i
(
n
+
τ
p
), i
=
1,2, for n
≥
N
0
-
τ
p, p
=
1,2
,
…. For any positive integer q, it is easy to see that there exist sequence {
x
i
p
:
p
≥
q
,
i
=
1,2
} such that the sequence {
x
i
p
} have subsequences, denoted by x
i
p again, converging on any finite interval of Z as p
→
∞, respectively. Thus we have sequence y
i
(
n
) such that
(41)
x
i
p
⟶
y
i
(
n
)
,
i
=
1,2
for
n
∈
Z
+
as
p
⟶
∞
.
Combined with
(42)
x
1
p
(
n
+
1
)
=
x
1
p
(
n
)
exp
⁡
[
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
-
1
)
]
r
1
(
n
+
τ
p
)
(
1
-
x
1
p
(
n
)
K
(
n
+
τ
p
)
)
-
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
-
1
)
b
(
n
+
τ
p
)
x
2
p
(
n
)
×
(
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
α
(
n
+
τ
p
)
+
β
(
n
+
τ
p
)
x
1
p
(
n
)
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
-
1
]
,
x
2
p
(
n
+
1
)
=
x
2
p
(
n
)
exp
⁡
[
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
-
1
)
]
-
r
2
(
n
+
τ
p
)
+
c
(
n
+
τ
p
)
x
1
p
(
n
)
×
(
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
α
(
n
+
τ
p
)
+
β
(
n
+
τ
p
)
x
1
p
(
n
)
+
γ
(
n
+
τ
p
)
x
2
p
(
n
)
)
-
1
]
,
it gives
(43)
y
1
(
n
+
1
)
=
y
1
(
n
)
exp
⁡
[
r
1
(
n
)
(
1
-
y
1
(
n
)
K
(
n
)
)
b
(
n
)
y
2
(
n
)
α
(
n
)
+
β
(
n
)
y
1
(
n
)
+
γ
(
n
)
y
2
(
n
)
(
1
-
y
1
(
n
)
K
(
n
)
)
-
b
(
n
)
y
2
(
n
)
α
(
n
)
+
β
(
n
)
y
1
(
n
)
+
γ
(
n
)
y
2
(
n
)
]
,
y
2
(
n
+
1
)
=
y
2
(
n
)
exp
⁡
[
+
c
(
n
)
y
1
(
n
)
α
(
n
)
+
β
(
n
)
y
1
(
n
)
+
γ
(
n
)
y
2
(
n
)
]
-
r
2
(
n
)
+
c
(
n
)
y
1
(
n
)
α
(
n
)
+
β
(
n
)
y
1
(
n
)
+
γ
(
n
)
y
2
(
n
)
]
.
We can easily see that (
y
1
(
n
)
,
y
2
(
n
)
) is a solution of system (6); furthermore,
(44)
x
i
*
-
ϵ
≤
y
i
(
n
)
≤
x
i
*
+
ϵ
,
i
=
1,2
,
for
n
∈
Z
+
.
Since ϵ is an arbitrary small positive number, it follows that
(45)
x
i
*
≤
y
i
(
n
)
≤
x
i
*
,
i
=
1,2
,
for
n
∈
Z
+
.
The proof of theorem is completed.In the following, we denote(4)
∀
x
∈
[
x
1
*
,
x
1
*
]
,
∀
y
∈
[
x
2
*
,
x
2
*
]
,
g
(
n
,
x
,
y
)
=
α
(
n
)
+
β
(
n
)
x
+
γ
(
n
)
y
,
H
=
max
⁡
⁡
{
g
(
n
,
x
,
y
)
}
,
h
=
min
⁡
⁡
{
g
(
n
,
x
,
y
)
}
,
η
1
=
2
r
1
L
x
1
*
K
M
+
2
r
1
L
b
L
β
L
x
2
*
x
1
*
2
K
M
H
2
-
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
-
(
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
2
c
M
α
M
γ
M
x
1
*
2
x
2
*
+
c
M
2
α
M
x
1
*
2
)
×
(
h
4
)
-
1
)
-
c
M
α
M
x
1
*
+
(
c
M
γ
M
+
2
b
M
β
M
)
x
1
*
x
2
*
h
2
,
η
2
=
2
c
L
γ
L
x
1
*
x
2
*
H
2
-
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
-
(
(
α
M
2
b
M
2
x
2
*
4
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
4
+
b
M
2
β
M
2
x
1
*
2
x
2
*
4
+
c
M
γ
M
x
1
*
2
x
2
*
2
)
×
(
h
4
)
-
1
)
-
c
M
α
M
x
1
*
+
c
M
γ
M
x
1
*
x
2
*
h
2
,
η
=
min
⁡
{
η
1
,
η
2
}
.Theorem 11.
Suppose the conditions (H1), (H2), and (H3) are satisfied, and let 0
<
η
<
1; then there exists a uniqueness uniformly asymptotically stable almost periodic solution X
=
(
x
1
(
n
)
,
x
2
(
n
)
) of system (6) which is bounded by Ω for all n
∈
Z
+.Proof.
Letx
1
(
n
)
=
exp
⁡
{
p
1
(
n
)
}, x
2
(
n
)
=
exp
⁡
{
p
2
(
n
)
}. From system (6),we have
(47)
p
1
(
n
+
1
)
=
p
1
(
n
)
+
r
1
(
n
)
(
1
-
e
p
1
(
n
)
K
(
n
)
)
-
b
(
n
)
e
p
2
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
,
p
2
(
n
+
1
)
=
p
2
(
n
)
-
r
2
(
n
)
+
c
(
n
)
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
.
From Theorem 11, we know that the system (47) have bounded solution Y
(
n
)
=
(
p
1
(
n
)
,
p
2
(
n
)
) satisfying
(48)
ln
⁡
x
i
*
≤
p
i
(
n
)
≤
ln
⁡
x
i
*
,
i
=
1,2
,
n
∈
Z
+
.
Hence, |
p
i
(
n
)
|
≤
A
i, where A
i
=
max
⁡
⁡
{
|
ln
⁡
x
i
*
|
,
|
ln
⁡
x
i
*
|
}, i
=
1,2. For (
p
1
(
n
)
,
p
2
(
n
)
)
∈
R
2, we define the norm ∥
(
p
1
(
n
)
,
p
2
(
n
)
)
∥
=
|
p
1
(
n
)
|
+
|
p
2
(
n
)
|.
Consider the product system of system (47)
(49)
p
1
(
n
+
1
)
=
p
1
(
n
)
+
r
1
(
n
)
(
1
-
e
p
1
(
n
)
K
(
n
)
)
-
b
(
n
)
e
p
2
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
,
p
2
(
n
+
1
)
=
p
2
(
n
)
-
r
2
(
n
)
+
c
(
n
)
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
,
q
1
(
n
+
1
)
=
q
1
(
n
)
+
r
1
(
n
)
(
1
-
e
q
1
(
n
)
K
(
n
)
)
-
b
(
n
)
e
q
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
,
q
2
(
n
+
1
)
=
q
2
(
n
)
-
r
2
(
n
)
+
c
(
n
)
e
q
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
.
Suppose X
=
(
p
1
(
n
)
,
p
2
(
n
)
), Y
=
(
q
1
(
n
)
,
q
2
(
n
)
) are any two solutions of system (49) defined on Z
+
×
S
*
×
S
*; then ∥
X
∥
≤
A, ∥
Y
∥
≤
A, where A
=
A
1
+
A
2,
(50)
S
*
=
{
(
p
1
(
n
)
,
p
2
(
n
)
)
∣
ln
⁡
x
i
*
≤
p
i
(
n
)
≤
ln
⁡
x
i
*
,
i
=
1,2
,
n
∈
Z
+
{
(
p
1
(
n
)
,
p
2
(
n
)
)
∣
ln
⁡
x
i
*
≤
p
i
(
n
)
}
.
Consider a Lyapunov function defined onZ
+
×
S
*
×
S
* as follows:
(51)
V
(
n
,
X
,
Y
)
=
∑
i
=
1
2
‍
(
p
i
(
n
)
-
q
i
(
n
)
)
2
.
It is easy to see that the norm ∥
X
-
Y
∥
=
∑
i
=
1
2
|
(
p
i
(
n
)
-
q
i
(
n
)
)
| and the norm ∥
X
-
Y
∥
*
=
∑
i
=
1
2
(
p
i
(
n
)
-
q
i
(
n
)
)
2 are equivalent; that is, there exist two constants C
1
>
0, C
2
>
0, such that
(52)
C
1
∥
X
-
Y
∥
≤
∥
X
-
Y
∥
*
≤
C
2
∥
X
-
Y
∥
;
then
(53)
(
C
1
∥
X
-
Y
∥
)
2
≤
V
(
n
,
X
,
Y
)
≤
(
C
2
∥
X
-
Y
∥
)
2
.
Leta
∈
C
(
R
+
,
R
+
), a
(
x
)
=
C
1
2
x
2, b
∈
C
(
R
+
,
R
+
), and b
(
x
)
=
C
2
2
x
2; thus the condition [C1] in Lemma 8 is satisfied.
In addition,(54)
|
V
(
n
,
X
,
Y
)
-
V
(
n
,
X
~
,
Y
~
)
|
=
|
∑
i
=
1
2
‍
(
p
i
(
n
)
-
q
i
(
n
)
)
2
-
∑
i
=
1
2
‍
(
p
~
i
(
n
)
-
q
~
i
(
n
)
)
2
|
≤
|
(
p
1
(
n
)
-
q
1
(
n
)
)
2
-
(
p
~
1
(
n
)
-
q
~
1
(
n
)
)
2
|
+
|
(
p
2
(
n
)
-
q
2
(
n
)
)
2
-
(
p
~
2
(
n
)
-
q
~
2
(
n
)
)
2
|
=
|
p
1
(
n
)
-
q
1
(
n
)
+
p
~
1
(
n
)
-
q
~
1
(
n
)
|
×
|
p
1
(
n
)
-
q
1
(
n
)
-
p
~
1
(
n
)
+
q
~
1
(
n
)
|
+
|
p
2
(
n
)
-
q
2
(
n
)
+
p
~
2
(
n
)
-
q
~
2
(
n
)
|
×
|
p
2
(
n
)
-
q
2
(
n
)
-
p
~
2
(
n
)
+
q
~
2
(
n
)
|
≤
(
|
p
1
(
n
)
|
+
|
q
1
(
n
)
|
+
|
p
~
1
(
n
)
|
+
|
q
~
1
(
n
)
|
)
×
(
|
p
1
(
n
)
-
p
~
1
(
n
)
|
+
|
q
1
(
n
)
-
q
~
1
(
n
)
|
)
+
(
|
p
2
(
n
)
|
+
|
q
2
(
n
)
|
+
|
p
~
2
(
n
)
|
+
|
q
~
2
(
n
)
|
)
×
(
|
p
2
(
n
)
-
p
~
2
(
n
)
|
+
|
q
2
(
n
)
-
q
~
2
(
n
)
|
)
≤
L
{
|
p
1
(
n
)
-
p
~
1
(
n
)
|
+
|
q
1
(
n
)
-
q
~
1
(
n
)
|
+
|
p
2
(
n
)
-
p
~
2
(
n
)
|
+
|
q
2
(
n
)
-
q
~
2
(
n
)
|
}
=
L
{
∥
X
-
X
~
∥
+
∥
Y
-
Y
~
∥
}
,
where L
=
4
max
⁡
{
A
1
,
A
2
}. Hence, the condition [C2] of Lemma 8 is satisfied.
Finally, calculate theΔ
V of V
(
n
) along the solutions of (49); we can obtain
(55)
Δ
V
(
49
)
(
n
,
X
,
Y
)
=
V
(
n
+
1
,
X
,
Y
)
-
V
(
n
,
X
,
Y
)
=
∑
i
=
1
2
‍
(
p
i
(
n
+
1
)
-
q
i
(
n
+
1
)
)
2
-
∑
i
=
1
2
‍
(
p
i
(
n
)
-
q
i
(
n
)
)
2
=
(
p
1
(
n
+
1
)
-
q
1
(
n
+
1
)
)
2
-
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
(
p
2
(
n
+
1
)
-
q
2
(
n
+
1
)
)
2
-
(
p
2
(
n
)
-
q
2
(
n
)
)
2
.
In the view of (49), we get
(56)
(
p
1
(
n
+
1
)
-
q
1
(
n
+
1
)
)
2
-
(
p
1
(
n
)
-
q
1
(
n
)
)
2
=
[
(
p
1
(
n
)
-
q
1
(
n
)
)
-
r
1
(
n
)
K
(
n
)
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
-
b
(
n
)
(
e
p
2
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
e
q
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
)
]
2
-
(
p
1
(
n
)
-
q
1
(
n
)
)
2
=
[
(
p
1
(
n
)
-
q
1
(
n
)
)
-
r
1
(
n
)
K
(
n
)
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
-
b
(
n
)
(
e
p
2
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
+
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
-
e
q
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
)
]
2
-
(
p
1
(
n
)
-
q
1
(
n
)
)
2
=
[
(
r
1
(
n
)
K
(
n
)
)
(
p
1
(
n
)
-
q
1
(
n
)
)
-
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
-
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
r
1
(
n
)
K
(
n
)
)
]
2
-
(
p
1
(
n
)
-
q
1
(
n
)
)
2
=
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
2
+
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
2
-
2
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
(
p
1
(
n
)
-
q
1
(
n
)
)
-
2
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
p
1
(
n
)
-
q
1
(
n
)
)
+
2
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
,
(
p
2
(
n
+
1
)
-
q
2
(
n
+
1
)
)
2
-
(
p
2
(
n
)
-
q
2
(
n
)
)
2
=
[
×
(
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
e
q
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
)
]
(
p
2
(
n
)
-
q
2
(
n
)
)
+
c
(
n
)
×
(
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
e
q
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
)
]
2
-
(
p
2
(
n
)
-
q
2
(
n
)
)
2
=
[
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
+
c
(
n
)
(
e
p
1
(
n
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
+
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
-
e
q
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
)
]
2
-
(
p
2
(
n
)
-
q
2
(
n
)
)
2
=
[
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
+
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
-
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
]
2
-
(
p
2
(
n
)
-
q
2
(
n
)
)
2
=
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
2
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
2
+
c
2
(
n
)
γ
2
(
n
)
e
2
p
1
(
n
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
2
+
2
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
-
2
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
.
Substituting (56) into (55), we have
(57)
Δ
V
(
49
)
(
n
,
X
,
Y
)
=
V
(
n
+
1
,
X
,
Y
)
-
V
(
n
,
X
,
Y
)
=
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
+
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
2
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
]
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
2
+
(
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
+
c
2
(
n
)
γ
2
(
n
)
e
2
p
1
(
n
)
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
)
×
(
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
-
1
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
2
+
2
[
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
(
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
-
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
(
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
]
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
-
2
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
(
p
1
(
n
)
-
q
1
(
n
)
)
-
2
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
p
1
(
n
)
-
q
1
(
n
)
)
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
2
(
n
)
-
e
q
2
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
+
2
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
(
e
p
1
(
n
)
-
e
q
1
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
.
Using the mean value theorem, we get
(58)
e
p
i
(
n
)
-
e
q
i
(
n
)
=
ξ
i
(
n
)
(
p
i
(
n
)
-
q
i
(
n
)
)
,
i
=
1,2
,
where ξ
i
(
n
) lies between e
p
i
(
n
) and e
q
i
(
n
), i
=
1,2. From (57) and (58), we have
(59)
Δ
V
(
49
)
(
n
,
X
,
Y
)
=
V
(
n
+
1
,
X
,
Y
)
-
V
(
n
,
X
,
Y
)
=
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
ξ
1
2
(
n
)
+
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
2
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
2
(
n
)
-
2
×
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
ξ
1
(
n
)
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
ξ
1
2
(
n
)
]
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
[
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
]
(
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
+
c
2
(
n
)
γ
2
(
n
)
e
2
p
1
(
n
)
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
)
×
(
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
-
1
)
ξ
2
2
(
n
)
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
]
×
(
p
2
(
n
)
-
q
2
(
n
)
)
2
+
2
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
(
n
)
ξ
2
(
n
)
-
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
(
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
ξ
1
(
n
)
ξ
2
(
n
)
-
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
(
n
)
+
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
(
n
)
]
×
(
p
1
(
n
)
-
q
1
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
,
and we get
(60)
Δ
V
(
49
)
=
V
1
+
V
2
+
V
3
,
where
(61)
V
1
(
n
)
=
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
ξ
1
2
(
n
)
+
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
2
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
2
(
n
)
-
2
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
ξ
1
(
n
)
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
2
ξ
1
2
(
n
)
]
(
p
1
(
n
)
-
q
1
(
n
)
)
2
≤
[
-
2
r
1
L
b
L
β
L
x
2
*
x
1
*
2
K
M
H
2
+
r
1
M
2
x
1
*
2
K
L
2
-
2
r
1
L
x
1
*
K
M
]
(
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
c
M
2
α
M
x
1
*
2
+
2
c
M
α
M
γ
M
x
2
*
x
1
*
2
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
c
M
2
α
M
x
1
*
2
)
×
(
h
4
)
-
1
)
+
2
b
M
β
M
x
2
*
x
1
*
h
2
-
2
r
1
L
b
L
β
L
x
2
*
x
1
*
2
K
M
H
2
+
r
1
M
2
x
1
*
2
K
L
2
-
2
r
1
L
x
1
*
K
M
]
×
(
p
1
(
n
)
-
q
1
(
n
)
)
2
,
V
2
(
n
)
=
[
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
]
(
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
+
c
2
(
n
)
γ
2
(
n
)
e
2
p
1
(
n
)
(
b
2
(
n
)
e
2
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
2
)
×
(
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
-
1
)
ξ
2
2
(
n
)
-
2
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
]
×
(
p
2
(
n
)
-
q
2
(
n
)
)
2
≤
[
+
c
M
γ
M
x
1
*
2
x
2
*
2
)
×
(
h
4
)
-
1
)
-
2
c
L
γ
L
x
1
*
x
2
*
H
2
]
(
(
α
M
2
b
M
2
x
2
*
4
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
4
+
b
M
2
β
M
2
x
1
*
2
x
2
*
4
+
c
M
γ
M
x
1
*
2
x
2
*
2
(
(
α
M
2
b
M
2
x
2
*
4
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
4
)
×
(
h
4
)
-
1
)
-
2
c
L
γ
L
x
1
*
x
2
*
H
2
]
×
(
p
2
(
n
)
-
q
2
(
n
)
)
2
,
V
3
(
n
)
=
2
[
(
r
1
(
n
)
K
(
n
)
-
b
(
n
)
e
p
2
(
n
)
β
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
)
×
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
(
n
)
ξ
2
(
n
)
-
(
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
)
(
c
(
n
)
γ
(
n
)
e
p
1
(
n
)
)
g
2
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
2
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
×
ξ
1
(
n
)
ξ
2
(
n
)
-
b
(
n
)
e
p
2
(
n
)
(
α
(
n
)
+
β
(
n
)
e
p
1
(
n
)
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
2
(
n
)
+
c
(
n
)
α
(
n
)
+
c
(
n
)
γ
(
n
)
e
p
2
(
n
)
g
(
n
,
e
q
1
(
n
)
,
e
q
2
(
n
)
)
g
(
n
,
e
p
1
(
n
)
,
e
p
2
(
n
)
)
ξ
1
(
n
)
]
×
(
p
1
(
n
)
-
q
1
(
n
)
)
(
p
2
(
n
)
-
q
2
(
n
)
)
≤
2
[
c
M
α
M
x
1
*
+
c
M
γ
M
x
1
*
x
2
*
h
2
+
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
]
×
[
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
(
p
2
(
n
)
-
q
2
(
n
)
)
2
]
.
Hence,
(62)
Δ
V
(
49
)
≤
[
-
2
r
1
L
x
1
*
K
M
]
(
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
c
M
2
α
M
x
1
*
2
+
2
c
M
α
M
γ
M
x
2
*
x
1
*
2
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
c
M
2
α
M
x
1
*
2
)
×
(
h
4
)
-
1
)
+
2
b
M
β
M
x
2
*
x
1
*
h
2
-
2
r
1
M
b
M
β
M
x
2
*
x
1
*
2
K
L
h
2
+
r
1
M
2
x
1
*
2
K
L
2
-
2
r
1
L
x
1
*
K
M
]
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
[
+
c
M
γ
M
x
1
*
x
2
*
2
)
×
(
h
4
)
-
1
)
-
2
c
L
γ
L
x
1
*
x
2
*
H
2
]
(
(
α
M
2
b
M
2
x
2
*
3
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
3
+
b
M
2
β
M
2
x
1
*
2
x
2
*
4
+
c
M
γ
M
x
1
*
x
2
*
2
(
α
M
2
b
M
2
x
2
*
3
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
3
)
×
(
h
4
)
-
1
)
-
2
c
L
γ
L
x
1
*
x
2
*
H
2
]
×
(
p
2
(
n
)
-
q
2
(
n
)
)
2
+
[
c
M
α
M
x
1
*
+
c
M
γ
M
x
1
*
x
2
*
h
2
+
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
]
×
[
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
(
p
2
(
n
)
-
q
2
(
n
)
)
2
]
≤
-
[
-
c
M
α
M
x
1
*
+
(
c
M
γ
M
+
2
b
M
β
M
)
x
1
*
x
2
*
h
2
]
2
r
1
L
x
1
*
K
M
+
2
r
1
L
b
L
β
L
x
2
*
x
1
*
2
K
M
H
2
-
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
-
(
(
(
b
M
2
β
M
2
+
c
M
2
γ
M
2
)
x
1
*
2
x
2
*
2
+
2
c
M
α
M
γ
M
x
1
*
2
x
2
*
+
c
M
2
α
M
x
1
*
2
)
×
(
h
4
)
-
1
)
-
c
M
α
M
x
1
*
+
(
c
M
γ
M
+
2
b
M
β
M
)
x
1
*
x
2
*
h
2
]
×
(
p
1
(
n
)
-
q
1
(
n
)
)
2
-
[
2
c
L
γ
L
x
1
*
x
2
*
H
2
-
r
1
M
b
M
α
M
x
1
*
x
2
*
2
+
r
1
M
b
M
β
M
x
1
*
2
x
2
*
2
K
L
h
2
-
(
(
α
M
2
b
M
2
x
2
*
4
+
2
b
M
2
α
M
β
M
x
1
*
x
2
*
4
+
b
M
2
β
M
2
x
1
*
2
x
2
*
4
+
c
M
γ
M
x
1
*
2
x
2
*
2
)
×
(
h
4
)
-
1
)
-
c
M
α
M
x
1
*
+
c
M
γ
M
x
1
*
x
2
*
h
2
]
(
p
2
(
n
)
-
q
2
(
n
)
)
2
≤
-
η
1
(
p
1
(
n
)
-
q
1
(
n
)
)
2
-
η
2
(
p
2
(
n
)
-
q
2
(
n
)
)
2
≤
-
η
[
(
p
1
(
n
)
-
q
1
(
n
)
)
2
+
(
p
2
(
n
)
-
q
2
(
n
)
)
2
]
=
-
η
V
(
n
,
X
,
Y
)
,
where η
=
min
⁡
{
η
1
,
η
2
}. That is, there exists a positive constant 0
<
η
<
1 such that
(63)
Δ
V
(
49
)
≤
-
η
V
(
n
,
X
,
Y
)
.
From 0
<
η
<
1, the condition [C3] of Lemma 8 is satisfied. So, from Lemma 8, there exists a uniqueness uniformly asymptotically stable almost periodic solution X
(
n
)
=
(
p
1
(
n
)
,
p
2
(
n
)
) of (47) which is bounded by S
* for all n
∈
Z
+. Which means that there exists a uniqueness uniformly asymptotically stable almost periodic solution X
(
n
)
=
(
x
1
(
n
)
,
x
2
(
n
)
) of (6) which is bounded by Ω for all n
∈
Z
+. The proof is completed.


## 5. Application

Example 12.
Consider the following discrete model:(64)
x
1
(
n
+
1
)
=
x
1
(
n
)
×
exp
⁡
[
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
)
-
1
)
]
(
1.1
+
0.4
sin
(
n
)
)
(
1
-
x
1
(
n
)
)
-
(
0.3
-
0.2
cos
⁡
(
n
)
)
x
2
(
n
)
×
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
)
-
1
]
,



x
2
(
n
+
1
)
=
x
2
(
n
)
exp
⁡
[
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
)
-
1
)
]
-
(
0.8
+
0.2
sin
(
n
)
)
+
(
1.5
-
0.3
sin
(
n
)
)
x
1
(
n
)
×
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
(
+
(
0.6
+
0.1
cos
⁡
(
n
)
)
x
1
(
n
)
+
x
2
(
n
)
)
-
1
0.3
-
0.1
sin
(
n
)
)
-
1
]
,



with initial conditions (
0.9,0.6
); then system (64) is persistent and has a globally attractive almost periodic solution.By simple computation, we derive(65)
r
1
L
-
b
M
γ
L
=
0.2
>
0
,
c
L
β
M
(
1
-
α
M
)
-
r
2
M
≈
0.2857
>
0
.
Thus, the system (64) is persistent. Its integral curves and orbits are shown in Figure 1, respectively.Figure 1
The orbit of predator (x
2)-prey (x
1).



---

*Source: 380612-2014-07-17.xml*