1 Introduction

After the pioneering work of Berryman [1] in 1992, the dynamic relationship between predators and their preys has become one of the dominant themes in both ecology and mathematical ecology due to its universal existence and importance. Dynamic nature (including the local and global stability of the equilibrium, the persistence, permanence and extinction of species, the existence of periodic solutions and positive almost periodic solutions, bifurcation and chaos and so on) of predator-prey models has been investigated in a number of notable studies [226]. In many applications, the nature of permanence is of great interest. For example, Fan and Li [27] made a theoretical discussion on the permanence of a delayed ratio-dependent predator-prey model with Holling-type functional response. Chen [28] addressed the permanence of a discrete n-species delayed food-chain system. Zhao and Jiang [29] focused on the permanence and extinction for a non-autonomous Lotka-Volterra system. Chen [30] analyzed the permanence and global attractivity of a Lotka-Volterra competition system with feedback control. Zhao and Teng et al. [31] established the permanence criteria for delayed discrete non-autonomous-species Kolmogorov systems. For more research on the permanence behavior of predator-prey models, one can see [3244].

In 2010, Lv et al. [45] investigated the existence and global attractivity of a periodic solution to the following Lotka-Volterra predator-prey system:

{ d x 1 ( t ) d t = x 1 ( t ) [ r 1 ( t ) a 11 ( t ) x 1 ( t τ 11 ( t ) ) a 12 ( t ) x 2 ( t τ 12 ( t ) ) d x 1 ( t ) d t = a 13 ( t ) x 3 ( t τ 13 ( t ) ) ] , d x 2 ( t ) d t = x 2 ( t ) [ r 2 ( t ) + a 21 ( t ) x 1 ( t τ 21 ( t ) ) a 22 ( t ) x 2 ( t τ 22 ( t ) ) d x 2 ( t ) d t = a 23 ( t ) x 3 ( t τ 23 ( t ) ) ] , d x 3 ( t ) d t = x 3 ( t ) [ r 3 ( t ) + a 31 ( t ) x 1 ( t τ 31 ( t ) ) a 32 ( t ) x 2 ( t τ 32 ( t ) ) d x 3 ( t ) d t = a 33 ( t ) x 3 ( t τ 33 ( t ) ) ] ,
(1.1)

where x 1 (t) denotes the density of prey species at time t, x 2 (t) and x 3 (t) stand for the density of predator species at time t, r i , a i j C(R,[0,)) and τ i j (t)>0 (i,j=1,2,3). Using Krasnoselskii’s fixed point theorem and constructing the Lyapunov function, Lv et al. obtained a set of easily verifiable sufficient conditions which guarantee the permanence and global attractivity of system (1.1).

Many authors have argued that discrete time models governed by difference equations are more appropriate to describe the dynamics relationship among populations than continuous ones when the populations have non-overlapping generations. Moreover, discrete time models can also provide efficient models of continuous ones for numerical simulations [4, 16, 46]. Thus it is reasonable and interesting to investigate discrete time systems governed by difference equations. The principal object of this article is to propose a discrete analogue system (1.1) and explore its dynamics.

Following the ideas of [4, 11], we will discretize system (1.1). Assume that the average growth rates in system (1.1) change at regular intervals of time, then we can obtain the following modified system:

{ x ˙ 1 ( t ) x 1 ( t ) = r 1 ( [ t ] ) a 11 ( [ t ] ) x 1 ( [ t ] τ 11 ( [ t ] ) ) a 12 ( [ t ] ) x 2 ( [ t ] τ 12 ( [ t ] ) ) x ˙ 1 ( t ) x 1 ( t ) = a 13 ( [ t ] ) x 3 ( [ t ] τ 13 ( [ t ] ) ) , x ˙ 2 ( t ) x 2 ( t ) = r 2 ( [ t ] ) + a 21 ( [ t ] ) x 1 ( [ t ] τ 21 ( [ t ] ) ) a 22 ( [ t ] ) x 2 ( [ t ] τ 22 ( [ t ] ) ) x ˙ 2 ( t ) x 2 ( t ) = a 23 ( [ t ] ) x 3 ( [ t ] τ 23 ( [ t ] ) ) , x ˙ 3 ( t ) x 3 ( t ) = r 3 ( [ t ] ) + a 31 ( [ t ] ) x 1 ( [ t ] τ 31 ( [ t ] ) ) a 32 ( [ t ] ) x 2 ( [ t ] τ 32 ( [ t ] ) ) x ˙ 3 ( t ) x 3 ( t ) = a 33 ( [ t ] ) x 3 ( [ t ] τ 33 ( [ t ] ) ) ,
(1.2)

where [t] denotes the integer part of t, t(0,+) and t0,1,2, . We integrate (1.2) on any interval of the form [k,k+1), k=0,1,2, , and obtain

{ x 1 ( t ) = x 1 ( k ) exp { [ r 1 ( k ) a 11 ( k ) x 1 ( k τ 11 ( k ) ) a 12 ( k ) x 2 ( k τ 12 ( k ) ) x 1 ( t ) = a 13 ( k ) x 3 ( k τ 13 ( k ) ) ] ( t k ) } , x 2 ( t ) = x 2 ( k ) exp { [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) x 2 ( t ) = a 23 ( k ) x 3 ( k τ 23 ( k ) ) ] ( t k ) } , x 3 ( t ) = x 3 ( k ) exp { [ r 3 ( k ) + a 31 ( k ) x 1 ( k τ 31 ( k ) ) a 32 ( k ) x 2 ( k τ 32 ( k ) ) x 3 ( t ) = a 33 ( k ) x 3 ( k τ 33 ( k ) ) ] ( t k ) } ,
(1.3)

where for kt<k+1, k=0,1,2, .

Let tk+1, then (1.3) takes the following form:

{ x 1 ( k + 1 ) = x 1 ( k ) exp { r 1 ( k ) a 11 ( k ) x 1 ( k τ 11 ( k ) ) a 12 ( k ) x 2 ( k τ 12 ( k ) ) x 1 ( k + 1 ) = a 13 ( k ) x 3 ( k τ 13 ( k ) ) } , x 2 ( k + 1 ) = x 2 ( k ) exp { r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) x 2 ( k + 1 ) = a 23 ( k ) x 3 ( k τ 23 ( k ) ) } , x 3 ( k + 1 ) = x 3 ( k ) exp { r 3 ( k ) + a 31 ( k ) x 1 ( k τ 31 ( k ) ) a 32 ( k ) x 2 ( k τ 32 ( k ) ) x 3 ( k + 1 ) = a 33 ( k ) x 3 ( k τ 33 ( k ) ) } ,
(1.4)

which is a discrete time analogue of system (1.1), where k=0,1,2, .

For the point of view of biology, we shall consider (1.4) together with the initial conditions x i (0)0 (i=1,2,3). The principal object of this article is to explore the dynamics of system (1.4) applying the differential inequality theory to study the permanence of system (1.4). Using the method of Lyapunov function, we investigate the global asymptotic stability of system (1.4).

We assume that the coefficients of system (1.4) satisfy the following:

(H1) r i , a i j , τ i j with i,j=1,2,3 are non-negative sequences bounded above and below by positive constants.

Let τ= sup 1 i , j 3 , k Z { τ i j (k)}. We consider (1.4) together with the following initial conditions:

x i (θ)= φ i (θ)0,θN[τ,0]={τ,τ+1,,0}, φ i (0)>0.
(1.5)

It is not difficult to see that the solutions of (1.4) and (1.5) are well defined for all k0 and satisfy

x i (k)>0for kZ,i=1,2,3.

The remainder of the paper is organized as follows. In Section 2, basic definitions and lemmas are given, some sufficient conditions for the permanence of system (1.4) are established. In Section 3, a series of sufficient conditions for the global stability of system (1.4) are included. The existence and stability of system (1.4) are analyzed in Section 4. In Section 5, we give an example which shows the feasibility of the main results. Conclusions are presented in Section 6.

2 Permanence

For convenience, in the following discussion, we always use the notations:

f l = inf k Z f(k), f u = sup k Z f(k),

where f(k) is a non-negative sequence bounded above and below by positive constants. In order to obtain the main result of this paper, we shall first state the definition of permanence and several lemmas which will be useful in the proof of the main result.

Definition 2.1 [47]

We say that system (1.4) is permanent if there are positive constants M and m such that each positive solution ( x 1 (k), x 2 (k), x 3 (k)) of system (1.4) satisfies

m lim k + inf x i (k) lim k + sup x i (k)M(i=1,2,3).

Lemma 2.1 [47]

Assume that {x(k)} satisfies x(k)>0 and

x(k+1)x(k)exp { a ( k ) b ( k ) x ( k ) }

for kN, where a(k) and b(k) are non-negative sequences bounded above and below by positive constants. Then

lim k + supx(k) 1 b l exp ( a u 1 ) .

Lemma 2.2 [47]

Assume that {x(k)} satisfies

x(k+1)x(k)exp { a ( k ) b ( k ) x ( k ) } ,k N 0 ,

lim k + supx(k) x and x( N 0 )>0, where a(k) and b(k) are non-negative sequences bounded above and below by positive constants and N 0 N. Then

lim k + infx(k)min { a l b u exp { a l b u x } , a l b u } .

Now we state our permanence result for system (1.4).

Theorem 2.1 Let M 1 , M 2 , M 3 and m 1 be defined by (2.4), (2.10), (2.15) and (2.20), respectively. In addition to condition (H1), assume that the following conditions:

(H2) a 21 u M 1 > r 2 l , a 22 u M 1 > r 2 l , a 31 u M 1 > r 3 l

and

(H3) r 1 l > a 12 u M 1 + a 13 u M 3 , r 2 u > a 23 u M 3 , a 31 l m 1 > r 3 u + a 32 u M 2

hold, then system (1.4) is permanent, that is, there exist positive constants m i , M i (i=1,2,3) which are independent of the solution of system (1.4), such that for any positive solution ( x 1 (k), x 2 (k), x 3 (k)) of system (1.4) with the initial condition x i (0)0 (i=1,2,3), one has

m i lim k + inf x i (k) lim k + sup x i (k) M i .

Proof Let ( x 1 (k), x 2 (k), x 3 (k)) be any positive solution of system (1.4) with the initial condition ( x 1 (0), x 2 (0), x 3 (0)). It follows from the first equation of system (1.4) that

x ( k + 1 ) = x 1 ( k ) exp { [ r 1 ( k ) a 11 ( k ) x 1 ( k τ 11 ( k ) ) a 12 ( k ) x 2 ( k τ 12 ( k ) ) a 13 ( k ) x 3 ( k τ 13 ( k ) ) ] } x 1 ( k ) exp { r 1 ( k ) } x 1 ( k ) exp { r 1 u } .
(2.1)

It follows from (2.1) that

x 1 ( k τ 11 ( k ) ) x 1 (k)exp { r 1 u τ u } .
(2.2)

Substituting (2.2) into the first equation of system (1.4), we get

x 1 (k+1) x 1 (k) [ r 1 u a 11 l exp { r 1 u τ u } x 1 ( k ) ] .
(2.3)

It follows from (2.3) and Lemma 2.1 that

lim k + sup x 1 (k) 1 a 11 l exp { r 1 u τ u + r 1 u 1 } := M 1 .
(2.4)

For any positive constant ε>0, it follows from (2.4) that there exists N 1 >0 such that for all k> N 1 ,

x 1 (k) M 1 +ε.
(2.5)

For k N 1 + τ u , from (2.5) and the second equation of system (1.4), we have

x 2 ( k + 1 ) = x 2 ( k ) exp { [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) a 23 ( k ) x 3 ( k τ 23 ( k ) ) ] } x 2 ( k ) exp { [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) ] } x 1 ( k ) exp { [ r 2 l + a 21 u ( M 1 + ε ) ] } ,
(2.6)

which leads to

x 2 ( k τ 22 ( k ) ) x 2 (k)exp { [ r 2 l a 21 u ( M 1 + ε ) ] τ u } .
(2.7)

Substituting (2.7) into the second equation of system (1.4), we have

x 2 ( k + 1 ) = x 2 ( k ) exp { [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) a 23 ( k ) x 3 ( k τ 23 ( k ) ) ] } x 2 ( k ) exp { [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) ] } x 2 ( k ) [ r 2 l + a 21 u ( M 1 + ε ) a 22 l exp { [ r 2 l a 21 u ( M 1 + ε ) ] τ u } x 2 ( k ) ] .
(2.8)

Thus it follows from Lemma 2.1 and (2.8) that

lim k + sup x 2 (k) exp { r 2 l + a 22 u ( M 1 + ε ) 1 } a 22 l exp { [ r 2 l a 21 u ( M 1 + ε ) ] τ u } .
(2.9)

Setting ε0, we obtain

lim k + sup x 2 (k) exp { r 2 l + a 22 u M 1 } a 22 l exp { ( r 2 l a 21 u M 1 ) τ u } := M 2 .
(2.10)

For k N 1 + τ u , from (2.5) and the third equation of system (1.4), we have

x 3 ( k + 1 ) = x 3 ( k ) [ r 3 ( k ) + a 31 ( k ) x 1 ( k τ 31 ( k ) ) a 32 ( k ) x 2 ( k τ 32 ( k ) ) a 33 ( k ) x 3 ( k τ 33 ( k ) ) ] x 3 ( k ) [ r 3 ( k ) + a 31 ( k ) x 1 ( k τ 31 ( k ) ) ] x 3 ( k ) [ r 3 l + a 31 u ( M 1 + ε ) ] ,
(2.11)

which leads to

x 3 ( k τ 33 ( k ) ) x 3 (k)exp { [ r 3 l a 31 u ( M 1 + ε ) ] τ u } .
(2.12)

Substituting (2.12) into the third equation of system (1.4) leads to

x 3 (k+1) x 3 (k) { r 3 l + a 31 u ( M 1 + ε ) a 33 l exp { [ r 3 l a 31 u ( M 1 + ε ) ] τ u } x 3 ( k ) } .
(2.13)

In view of Lemma 2.1 and (2.13), one has

lim k + sup x 3 (k) exp { r 3 l + a 31 u ( M 1 + ε ) 1 } a 33 l exp { [ r 3 l a 31 u ( M 1 + ε ) ] τ u } .
(2.14)

Setting ε0, we get

lim k + sup x 3 (k) r 3 l + a 31 u M 1 a 33 l exp { ( r 3 l a 31 u M 1 ) τ u } := M 3 .
(2.15)

For k N 1 + τ u , it follows from the first equation of system (1.4) that

x 1 ( k + 1 ) = x 1 ( k ) [ r 1 ( k ) a 11 ( k ) x 1 ( k τ 11 ( k ) ) a 12 ( k ) x 2 ( k τ 12 ( k ) ) a 13 ( k ) x 3 ( k τ 13 ( k ) ) ] x 1 ( k ) [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] ,
(2.16)

which leads to

x 1 ( k τ 11 ( k ) ) x 1 (k)exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } .
(2.17)

Substituting (2.17) into the first equation of system (1.4), we obtain

x 1 ( k + 1 ) x 1 ( k ) { r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } x 1 ( k ) } .
(2.18)

According to Lemma 2.2, it follows from (2.18) that

lim k + inf x 1 (k)min{ A 1 ε , A 2 ε },
(2.19)

where

A 1 ε = r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } × exp { r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } } M 1 , A 2 ε = r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } .

Setting ε0 in (2.19), we can get

lim k + inf x 1 (k) 1 2 min{ A 1 , A 2 }:= m 1 ,
(2.20)

where

A 1 = r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } × exp { r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } } M 1 , A 2 = r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } .

For k N 1 + τ u , from the second equation of system (1.4), we have

x 2 ( k + 1 ) = x 2 ( k ) [ r 2 ( k ) + a 21 ( k ) x 1 ( k τ 21 ( k ) ) a 22 ( k ) x 2 ( k τ 22 ( k ) ) a 23 ( k ) x 3 ( k τ 23 ( k ) ) ] x 2 ( t ) [ r 2 u + a 21 l ( m 1 ε ) a 22 u ( M 2 + ε ) a 23 u ( M 3 + ε ) ] ,
(2.21)

which leads to

x 2 ( k τ 22 ( k ) ) x 2 (k)exp { [ r 2 u a 21 l ( m 1 ε ) + a 22 u ( M 2 + ε ) + a 23 u ( M 3 + ε ) ] τ u } .
(2.22)

Substituting (2.22) into the second equation of system (1.4) leads to

x 2 ( k + 1 ) x 2 ( k ) { r 2 u a 22 u exp { [ r 2 u a 21 l ( m 1 ε ) + a 22 u ( M 2 + ε ) + a 23 u ( M 3 + ε ) ] τ u } x 2 ( k ) a 23 u ( M 3 + ε ) } .
(2.23)

By Lemma 2.2 and (2.23), we can get

lim k + inf x 2 (k)min{ B 1 ε , B 2 ε },
(2.24)

where

B 1 ε = r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } × exp { r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } } M 1 , B 2 ε = r 2 u a 23 u ( M 3 + ε ) a 22 u exp { [ r 2 u a 21 l ( m 1 ε ) + a 22 u ( M 2 + ε ) + a 23 u ( M 3 + ε ) ] τ u } .

Setting ε0 in the above inequality, we have that

lim k + inf x 2 (k) 1 2 min{ B 1 , B 2 }:= m 2 ,
(2.25)

where

B 1 = r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } × exp { r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } } M 1 , B 2 = r 2 u a 23 u M 3 a 22 u exp { [ r 2 u a 21 l m 1 + a 22 u M 2 + a 23 u M 3 ] τ u } .

For k N 1 + τ u , it follows from the third equation of system (1.4) that

x 3 ( k + 1 ) = x 3 ( k ) [ r 3 ( k ) + a 31 ( k ) x 1 ( k τ 31 ( k ) ) a 32 ( k ) x 2 ( k τ 32 ( k ) ) a 33 ( k ) x 3 ( k τ 33 ( k ) ) ] x 3 ( t ) [ r 3 u + a 31 l ( m 1 ε ) a 32 u ( M 2 + ε ) a 33 u ( M 3 + ε ) ] .
(2.26)

Hence

x 3 ( k τ 33 ( k ) ) x 3 (k)exp { [ r 3 u a 31 l ( m 1 ε ) + a 32 u ( M 2 + ε ) + a 33 u ( M 3 + ε ) ] τ u } .
(2.27)

Substituting (2.27) into the third equation of system (1.4), we derive

x 3 ( k + 1 ) x 3 ( k ) { r 3 u + a 31 l ( m 1 ε ) a 32 ( M 2 + ε ) a 33 exp { [ r 3 u a 31 l ( m 1 ε ) + a 32 u ( M 2 + ε ) + a 33 u ( M 3 + ε ) ] τ u } x 3 ( k ) } .
(2.28)

In view of Lemma 2.2 and (2.28), one has

lim K + inf x 3 (k)min{ C 1 ε , C 2 ε },
(2.29)

where

C 1 ε = r 1 l a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) a 11 u exp { [ r 1 l a 11 u ( M 1 + ε ) a 12 u ( M 2 + ε ) a 13 u ( M 3 + ε ) ] τ u } × exp { r 3 u + a 31 l ( m 1 ε ) a 32 u ( M 2 + ε ) a 33 exp { [ r 3 u a 31 l ( m 1 ε ) + a 32 u ( M 2 + ε ) + a 33 u ( M 3 + ε ) ] τ u } } M 1 , C 2 ε = r 3 u + a 31 l ( m 1 ε ) a 32 u ( M 2 + ε ) a 33 exp { [ r 3 u a 31 l ( m 1 ε ) + a 32 u ( M 2 + ε ) + a 33 u ( M 3 + ε ) ] τ u } .

Setting ε0 in (2.29) leads to

lim k + inf x 3 (k) 1 2 min{ C 1 , C 2 }:= m 3 ,
(2.30)

where

C 1 = r 1 l a 12 u M 2 a 13 u M 3 a 11 u exp { [ r 1 l a 11 u M 1 a 12 u M 2 a 13 u M 3 ] τ u } × exp { r 3 u + a 31 l m 1 a 32 u M 2 a 33 exp { [ r 3 u a 31 l m 1 + a 32 u M 2 + a 33 u M 3 ] τ u } } M 1 , C 2 = r 3 u + a 31 l m 1 a 32 u M 2 a 33 exp { [ r 3 u a 31 l m 1 + a 32 u M 2 + a 33 u M 3 ] τ u } .

In view of (2.4), (2.10), (2.15), (2.20), (2.25) and (2.30), we can conclude that system (1.4) is permanent. The proof of Theorem 2.1 is complete. □

Remark 2.1 Under the assumption of Theorem 2.1, the set [ m 1 , M 1 ]×[ m 2 , M 2 ]×[ m 3 , M 3 ] is an invariant set of system (1.4).

3 Global stability

In this section, we formulate the stability property of positive solutions of system (1.4) when all the time delays are zero.

Theorem 3.1 Let τ i j =0 (i,j=1,2,3). In addition to (H1)-(H3), assume further that (H4)

δ 1 = max { | 1 a 11 u M 1 | , | 1 a 11 l m 1 | } + a 12 u M 2 + a 13 u M 3 < 1 , δ 2 = max { | 1 a 22 u M 2 | , | 1 a 22 l m 3 | } + a 21 u M 1 + a 23 u M 3 < 1 , δ 3 = max { | 1 a 33 u M 3 | , | 1 a 33 l m 3 | } + a 31 u M 1 + a 32 u M 2 < 1 .

Then, for any positive solution ( x 1 (k), x 2 (k), x 3 (k)) and ( x 1 (k), x 2 (k), x 3 (k)) of system (1.4), we have

lim k [ x i ( k ) x i ( k ) ] =0(i=1,2,3).

Proof Let

x i (k)= x i (k)exp ( u i ( k ) ) ,i=1,2,3.
(3.1)

Then system (1.4) is equivalent to

{ u 1 ( k + 1 ) = u 1 ( k ) a 11 ( k ) x 1 ( k ) ( exp ( u 1 ( k ) ) 1 ) u 1 ( k + 1 ) = a 12 ( k ) x 2 ( k ) ( exp ( u 2 ( k ) ) 1 ) u 1 ( k + 1 ) = a 13 ( k ) x 3 ( k ) ( exp ( u 3 ( k ) ) 1 ) , u 2 ( k + 1 ) = u 2 ( k ) + a 21 ( k ) x 1 ( k ) ( exp ( u 1 ( k ) ) 1 ) u 2 ( k + 1 ) = a 22 ( k ) x 2 ( k ) ( exp ( u 2 ( k ) ) 1 ) u 2 ( k + 1 ) = a 23 ( k ) x 3 ( k ) ( exp ( u 3 ( k ) ) 1 ) , u 3 ( k + 1 ) = u 3 ( k ) a 31 ( k ) x 1 ( k ) ( exp ( u 1 ( k ) ) 1 ) u 3 ( k + 1 ) = a 32 ( k ) x 2 ( k ) ( exp ( u 2 ( k ) ) 1 ) u 3 ( k + 1 ) = a 33 ( k ) x 3 ( k ) ( exp ( u 3 ( k ) ) 1 ) .
(3.2)

Then

{ u 1 ( k + 1 ) = u 1 ( k ) a 11 ( k ) x 1 ( k ) ( exp ( θ 11 ( k ) u 1 ( k ) ) u 1 ( k ) u 1 ( k + 1 ) = a 12 ( k ) x 2 ( k ) ( exp ( θ 12 ( k ) u 2 ( k ) ) u 2 ( k ) u 1 ( k + 1 ) = a 13 ( k ) x 3 ( k ) ( exp ( θ 13 ( k ) u 3 ( k ) ) u 3 ( k ) , u 2 ( k + 1 ) = u 2 ( k ) + a 21 ( k ) x 1 ( k ) ( exp ( θ 21 ( k ) u 1 ( k ) ) u 1 ( k ) u 2 ( k + 1 ) = a 22 ( k ) x 2 ( k ) ( exp ( θ 22 ( k ) u 2 ( k ) ) u 2 ( k ) u 2 ( k + 1 ) = a 23 ( k ) x 3 ( k ) ( exp ( θ 23 ( k ) u 3 ( k ) ) u 3 ( k ) , u 3 ( k + 1 ) = u 3 ( k ) + a 31 ( k ) x 1 ( k ) ( exp ( θ 31 ( k ) u 1 ( k ) ) u 1 ( k ) u 3 ( k + 1 ) = a 32 ( k ) x 2 ( k ) ( exp ( θ 32 ( k ) u 2 ( k ) ) u 2 ( k ) u 3 ( k + 1 ) = a 33 ( k ) x 3 ( k ) ( exp ( θ 33 ( k ) u 3 ( k ) ) u 3 ( k ) ,
(3.3)

where θ i j (k)[0,1] (i,j=1,2,3). To complete the proof, it suffices to show that

lim k + u i (k)=0(i=1,2,3).
(3.4)

In view of (H4), we can choose ε>0 small enough such that

δ 1 ε =max { | 1 a 11 u ( M 1 + ε ) | , | 1 a 11 l ( m 1 ε ) | } + a 12 u ( M 2 +ε)+ a 13 u ( M 3 +ε)<1,
(3.5)
δ 2 ε =max { | 1 a 22 u ( M 2 + ε ) | , | 1 a 22 l ( m 3 ε ) | } + a 21 u ( M 1 +ε)+ a 23 u ( M 3 +ε)<1,
(3.6)
δ 3 ε =max { | 1 a 33 u ( M 3 + ε ) | , | 1 a 33 l ( m 3 ε ) | } + a 31 u ( M 1 +ε)+ a 32 u ( M 2 +ε)<1.
(3.7)

For above ε>0, in view of Theorem 2.1 in Section 2, there exists k N such that

m i ε x i (k), x i (k) M i +ε(i=1,2,3)

for all k k .

Noticing that θ i j (k)[0,1] (i,j=1,2,3) implies that x i (k)exp( θ j i (k) u i (k)) lies between x i (k) and x i (k). From (3.3), we have

u 1 ( k + 1 ) max { | 1 a 11 u ( M 1 + ε ) | , | 1 a 11 l ( m 1 ε ) | } | u 1 ( k ) | + a 12 u ( M 2 + ε ) | u 2 ( k ) | + a 13 u ( M 3 + ε ) | u 3 ( k ) | ,
(3.8)
u 2 ( k + 1 ) max { | 1 a 22 u ( M 2 + ε ) | , | 1 a 22 l ( m 3 ε ) | } | u 2 ( k ) | + a 21 u ( M 1 + ε ) | u 1 ( k ) | + a 23 u ( M 3 + ε ) | u 3 ( k ) | ,
(3.9)
u 3 ( k + 1 ) max { | 1 a 33 u ( M 3 + ε ) | , | 1 a 33 l ( m 3 ε ) | } | u 3 ( k ) | + a 31 u ( M 1 + ε ) | u 1 ( k ) | + a 32 u ( M 2 + ε ) | u 2 ( k ) | .
(3.10)

Let ρ=max{ δ 1 ε , δ 2 ε , δ 3 ε }, then ρ<1. By (3.8)-(3.10), for k k , we have

max { | u 1 ( k + 1 ) | , | u 2 ( k + 1 ) | , | u 3 ( k + 1 ) | } ρmax { | u 1 ( k ) | , | u 2 ( k ) | , | u 3 ( k ) | } ,

which implies

max { | u 1 ( k ) | , | u 2 ( k ) | , | u 3 ( k ) | } ρ k k max { | u 1 ( k ) | , | u 2 ( k ) | , | u 3 ( k ) | } .

Thus (3.4) holds true and the proof is complete. □

4 Existence and stability of a periodic solution

In this section, we further assume that τ i j =0 (i,j=1,2,3) and the coefficients of system (1.4) satisfy the following condition:

(H5) There exists a positive integer ω such that for kN, 0< r i (k+ω)= r i (k), 0< a i j (k+ω)= a i j (k) (i,j=1,2,3).

Theorem 4.1 Assume that (H1)-(H5) are satisfied, then system (1.4) with all the delays τ i j =0 (i,j=1,2,3) admits at least one positive ω-periodic solution which we denote by ( x 1 (k), x 2 (k), x 3 (k)).

Proof As pointed out in Remark 2.1 of Section 2,

D 3 = def [ m 1 , M 1 ]×[ m 2 , M 2 ]×[ m 3 , M 3 ]

is an invariant set of system (1.4). Then we define a mapping F on D 3 by

F ( x 1 ( 0 ) , x 2 ( 0 ) , x 3 ( 0 ) ) = ( x 1 ( ω ) , x 2 ( ω ) , x 3 ( ω ) ) ,for  ( x 1 ( 0 ) , x 2 ( 0 ) , x 3 ( 0 ) ) D 3 .

Clearly, F depends continuously on ( x 1 (0), x 2 (0), x 3 (0)). Thus F is continuous and maps the compact set D 3 into itself. Therefore, F has a fixed point. It is not difficult to see that the solution ( x 1 (k), x 2 (k), x 3 (k)) passing through this fixed point is an ω-periodic solution of system (1.4). The proof of Theorem 4.1 is complete. □

Theorem 4.2 Assume that (H1)-(H5) are satisfied, then system (1.4) with all the delays τ i j =0 (i,j=1,2,3) has a globally stable positive ω-periodic solution.

Proof Under assumptions (H1)-(H5), it follows from Theorem 4.1 that system (1.4) with all the delays τ i j =0 (i,j=1,2,3) admits at least one positive ω-periodic solution. In addition, Theorem 3.1 ensures that the positive solution is globally stable. Hence the proof. □

5 Numerical example

In this section, we will give an example which shows the feasibility of the main results (Theorem 2.1) of this paper. Let us consider the following discrete system:

{ x 1 ( k + 1 ) = x 1 ( k ) exp { ( 0.5 + 0.03 sin k π 2 ) ( 0.4 + 0.02 sin k π 2 ) x 1 ( k 1 ) x 1 ( k + 1 ) = ( 0.04 + 0.02 cos k π 2 ) x 2 ( k 1 ) ( 0.03 + 0.02 cos k π 2 ) x 3 ( k 1 ) } , x 2 ( k + 1 ) = x 2 ( k ) exp { ( 0.085 + 0.05 cos k π 2 ) + ( 0.5 + 0.3 sin k π 2 ) x 1 ( k 1 ) x 2 ( k + 1 ) = ( 0.26 + 0.02 sin k π 2 ) x 2 ( k 1 ) ( 0.5 + 0.04 cos k π 2 ) x 3 ( k 1 ) } , x 3 ( k + 1 ) = x 3 ( k ) exp { ( 0.075 + 0.03 sin k π 2 ) + ( 0.5 + 0.02 cos k π 2 ) x 1 ( k 1 ) x 3 ( k + 1 ) = ( 0.24 + 0.04 sin k π 2 ) x 2 ( k 1 ) ( 0.4 + 0.06 cos k π 2 ) x 3 ( k 1 ) } .
(5.1)

Here

r 1 ( k ) = 0.5 + 0.03 sin k π 2 , r 2 ( t ) = 0.085 + 0.05 cos k π 2 , r 3 ( t ) = 0.075 + 0.03 sin k π 2 , a 11 ( k ) = 0.4 + 0.02 sin k π 2 , a 12 ( k ) = 0.03 + 0.02 cos k π 2 , a 13 ( k ) = 0.03 + 0.02 cos k π 2 , a 21 ( k ) = 0.5 + 0.3 sin k π 2 , a 22 ( k ) = 0.26 + 0.02 sin k π 2 , a 23 ( k ) = 0.5 + 0.04 cos k π 2 , a 31 ( k ) = 0.5 + 0.02 cos k π 2 , a 32 ( k ) = 0.24 + 0.04 sin k π 2 , a 33 ( k ) = 0.4 + 0.06 cos k π 2 , τ i j ( k ) = 1 ( i , j = 1 , 2 , 3 ) .

All the coefficients r i (k) (i=1,2,3), a i j (k) (i,j=1,2,3), τ i j (k) (i,j=1,2,3) are functions with respect to k, and it is not difficult to obtain that

{ r 1 u = 0.53 , r 1 l = 0.47 , r 2 u = 0.135 , r 2 l = 0.035 , r 3 u = 0.105 , r 3 l = 0.045 , a 11 u = 0.402 , a 11 l = 0.038 , a 12 u = 0.05 , a 12 l = 0.01 , a 13 u = 0.05 , a 13 l = 0.01 , a 21 u = 0.8 , a 21 l = 0.3 , a 22 u = 0.28 , a 22 l = 0.24 , a 23 u = 0.54 , a 23 l = 0.46 , a 31 u = 0.52 , a 31 l = 0.48 , a 32 u = 0.28 , a 32 l = 0.20 , a 33 u = 0.46 , a 34 l = 0.34 , τ i j u = τ i j l = 1 ( i , j = 1 , 2 , 3 ) .

It is easy to examine that the coefficients of system (5.1) satisfy all the conditions of Theorem 2.1. Thus system (5.1) is permanent which is shown in Figures 1-3.

Figure 1
figure 1

The dynamic behavior of the first component of the solution ( x 1 (k), x 2 (k), x 3 (k)) of system ( 5.1 ).

Figure 2
figure 2

The dynamic behavior of the second component of the solution ( x 1 (k), x 2 (k), x 3 (k)) of system ( 5.1 ).

Figure 3
figure 3

The dynamic behavior of the third component of the solution ( x 1 (k), x 2 (k), x 3 (k)) of system ( 5.1 ).

6 Conclusions

In this paper, we have investigated the dynamic behavior of a discrete Lotka-Volterra predator-prey model with time-varying delays. Sufficient conditions which ensure the permanence of the system are established. Moreover, we also analyze the global stability of the system with all the delays τ i j (k)=0 (i,j=1,2,3) and deal with the existence and stability of the system. We have shown that delay has important influence on the permanence of the system. Therefore, delay is an important factor to decide the permanence of the system. When all the delays are zero, we obtain some sufficient conditions which guarantee the global stability of the system. Computer simulations are carried out to explain our main theoretical results.