Some equilibrium, stability, instability and oscillatory results for an extended discrete epidemic model with evolution memory

Manuel De la Sen; Santiago Alonso-Quesada

doi:10.1186/1687-1847-2013-234

Research
Open Access
Published: 07 August 2013

Some equilibrium, stability, instability and oscillatory results for an extended discrete epidemic model with evolution memory

Manuel De la Sen¹ &
Santiago Alonso-Quesada¹

Advances in Difference Equations volume 2013, Article number: 234 (2013) Cite this article

1354 Accesses
3 Citations
Metrics details

Abstract

This paper investigates the existence and potential uniqueness of equilibrium points and some stability, instability and oscillatory properties of a discrete nonlinear epidemic model, which generalises previous Stevic’s model, whose solutions possess memory from a finite chain of preceding samples. An application example is provided where the proposed model is ‘ad hoc’ adapted to a class of SIS models widely used in epidemiology.

1 Introduction

In this paper, some properties of equilibrium points as well as some stability and instability properties of the following nonlinear discrete epidemic model are investigated:

x n + 1 = max (0, (1 − ∑ j = 0 k − 1 F (x n − j)) (1 − M (x ¯ n) e − A G (x ¯ n))), n ∈ N 0,

(1.1)

with $N 0 = N ∪ {0}$ , where $x ¯ n = (x n, x n − 1, …, x n − q + 1)$ is a $q (∈ N)$ -tuple of values of the solution sequence previous to its $(n + 1)$ th value and $F : R 0 + → R$ and $M, G : R 0 + q → R$ under any set of initial conditions $x i ≥ 0$ ; $i = 1 − p, 2 − p, …, 0$ , where $p = max (k, q)$ , and $A ∈ R +$ is a weighting forgetting factor in the model. Note that such sets of initial conditions guarantee that the associated solution sequence ${x n}$ , $n ∈ N 0 ∪ (− p ¯)$ , where $p ¯ = {1, 2, …, p}$ , is nonnegative by construction. It has to be pointed out that Stevic studied negative solutions of the epidemic model

x n + 1 = max (0, (1 − ∑ j = 0 k − 1 x n − j) (1 − e − A x n))

(1.2)

for $A ∈ (0, ∞)$ and also described and interpreted prior work on nonnegative solutions of the same epidemic model and their stability, instability and oscillation properties [1]. See also [2–5] for some related work. Later on, the discrete epidemic model was extended to include two coupled extended difference equations [6]. It turns out that both continuous-type and discrete-type epidemic models are of great importance in research nowadays because of its intrinsic interest in medical applications and because of their rich dynamics which make them also attractive to mathematicians involved in the investigations of nonlinear differential and difference equations. See, for instance, [7–11]. Note that discrete modelling techniques are very relevant in the study of ecology and biology problems as well, like, for instance, the discretization of logistic equations [12] leading to discrete models such as those related to the well-known Riecker, Beverton-Holt and Hassel equations (see, for instance, [13–21] and references therein). A way of establishing a direct generalisation of Zhang-Shi’s [5], Stevic’s [1], and Papaschinopoulos et al.’s [6] analysis for a related epidemic model is to restrict the codomains of the various functions to be nonnegative by defining them as $F : R 0 + → R 0 +$ ; $M, G : R 0 + q → R 0 +$ , where $R 0 + = {z ∈ R : z ≥ 0} = R + ∪ {0}$ with $R + = {z ∈ R : z > 0}$ . However, under a more general discussion, it can be allowed for the functions to have ranges in R. The function $F : R 0 + → R$ is assumed to be upper-bounded and lower-bounded by known polynomials in x of degree q. The constraint $max (∑ j = 0 k − 1 F (x n − j), M (x ¯ n) e − A G (x ¯ n)) ≤ 1$ for $j ∈ N 0 +$ is not assumed so that both sequences $(1 − ∑ j = 0 k − 1 F (x n − j))$ , $(1 − M (x ¯ n) e − A G (x ¯ n))$ may be eventually negative in (1.1) while generating a nonnegative solution sequence. Note that the solution evolution of the proposed model can be interpreted as the propagation of the infection (say, roughly speaking, the infected population or a normalised value for it) from certain initial conditions and subject to weighting factor parameterization and a number of discrete delays. A considerable freedom of implementation of the proposed model in terms of choices of the parameterization structures F, M, A and the number of terms in the parameterization sequences is allowed. The above model remembers, in a much more general context and discretized version, the original Bernoulli proposal to introduce a simple epidemic model with just a single variable being the solution of a scalar equation. However, this model can be useful for situations involving two (or even three) variables as, for instance, the SI-epidemic model when the total population remains constant for all time during the illness cycle, i.e. for the case when mortality caused by the disease is not expected, or even for models of three variables. Related interpretations and practical use are addressed in the simulated examples, and it has to be pointed out that simple structures for epidemic models are often preferred in medical structures compared to complex alternative structures. A simulated example is also provided with a detailed study combining the proposed epidemic models with a class of SIS epidemic models that have been previously known in the background literature [16, 17]. Finally, it has to be pointed out that the properties of stability, instability and oscillatory behaviour of the solutions are very relevant issues in the study of epidemic models. See, for instance, [16–21] and references therein. Thus, the study and associated discussion provided concerning the proposed model pay a special attention to them.

2 Equilibrium points

To study the existence of potential equilibrium points, we set the values of solution sequence (1.1) to a constant one x, which yields

x = max (0, (1 − k F (x)) (1 − M (x ¯) e − A G (x ¯))),

(2.1)

where $x ¯ = (x, x, …, x)$ is in $R q$ . Define $g : R 0 + → R$ as follows:

g (x) = max (0, (1 − k F (x)) (1 − M (x ¯) e − A G (x ¯))) − x .

(2.2)

Note that $x ∈ R 0 +$ is an equilibrium point of (1.1) if and only if $g (x) = 0$ . The existence of equilibrium points of (1.1) are subject to the following direct result.

Theorem 2.1 The following properties hold.

(i)
$x = 0$ is an equilibrium point of (1.1) if and only if $g (0) = 0$ , equivalently if and only if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ , where $0 ∈ R$ and $0 ¯ = (0, 0, …, 0) ∈ R q$ , equivalently if and only if
$(F (0) = 1 / k) ∨ (M (0 ¯) = e A G (0 ¯)) ∨ ([(F (0) ≠ 1 / k) ∧ M (0 ¯) ≠ e A G (0 ¯)] ⇔ [(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0]),$

where the symbols ‘∨’ and ‘∧’ stand for ‘or’ and ‘and’ (i.e. for logic disjunction and conjunction, respectively).

(ii)
$x ∈ R +$ (respectively, $x ∈ R 0 +$ ) is a positive (respectively, a nonnegative) equilibrium point of (1.1) if and only $g (x) = 0$ for such $x ∈ R +$ (respectively, for such $x ∈ R 0 +$ ). If $g (x) ≠ 0 ⇔ (1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≠ x > 0$ ; $∀ x ∈ [x 1, x 2] ⊂ R 0 +$ , then there is no equilibrium point of (1.1) within the real interval $[x 1, x 2]$ . Finally, a necessary condition for $x ∈ R 0 +$ (respectively, for $x ∈ R +$ ) to be an equilibrium point of (1.1) is that $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≥ 0$ (respectively, $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) > 0$ ).
(iii)
There is no positive (respectively, no nonnegative) equilibrium point of (1.1) if and only if $g (x) ≠ 0$ ; $∀ x ∈ R +$ (respectively, if and only if $g (x) ≠ 0$ ; $∀ x ∈ R 0 +$ ).
(iv)
$x = 0$ is the unique nonnegative equilibrium point of (1.1) if and only if $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≤ 0$ ; $∀ x ∈ R 0 +$ .

Proof It follows that $x = 0$ is an equilibrium point of (1.1) if and only if $g (0) = 0 ⇔ (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ from (2.1)-(2.2). This proves directly Property (i). To prove Property (ii), note that the logic proposition $g (x) ≠ 0 ⇔ (1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≠ x > 0$ for any $x ∈ [x 1, x 2] ⊂ R +$ is equivalent to its contrapositive logic proposition $¬ ∃ x ∈ [x 1, x 2]$ such that $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≤ 0 ⇔ g (x) = 0$ (‘¬’ stands for logic negation) so that there is no equilibrium point of (1.1) in $[x 1, x 2]$ . This proves the first part of Property (ii). The last part of Property (ii) follows by contradiction since $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≤ 0$ implies $g (x) = − x < 0$ ; $∀ x ∈ R +$ , so that there is no positive equilibrium point of (1.1), and, on the other hand, $g (x) = 0$ if and only if $x = 0$ is an equilibrium point, which is impossible since $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ . Hence, Property (ii). Property (iii) is direct since any equilibrium point of (1.1) in $R 0 +$ implies and is implied by the condition $g (x) = 0$ . The sufficiency part of Property (iv) follows since the given condition implies that $g (0) = 0$ , then $x = 0$ is an equilibrium point of (1.1) and $g (x) = − x < 0$ for $x ∈ R +$ , so that there is no positive equilibrium point of (1.1). The necessity part of Property (iv) follows since $x = 0$ is an equilibrium point of (1.1) only if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ , which is unique in $R 0 +$ , since any $x ∈ R +$ is an equilibrium point of (1.1) only if $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) > 0$ from Property (ii). □

Some parts of the subsequent analysis are simplified subject to the following assumption.

Assumption 2.2 $F : R 0 + → R$ is differentiable on $R 0 +$ and $M, G : R 0 + q → R$ are differentiable in $R 0 + q$ .

Note that if Assumption 2.2 holds, then $g : R 0 + → R$ is also everywhere differentiable. The following result is a direct conclusion of Theorem 2.1.

Theorem 2.3 A sufficient condition for $x 1 ∈ R 0 +$ to be the unique equilibrium point of (1.1) is that $g (x 1) = 0$ and $g : R 0 + → R$ fulfils one of the conditions below:

(a)
strictly monotone in $R 0 +$ ;
(b)
non-decreasing (or, respectively, decreasing) in $[x 1, ∞)$ and, furthermore, strictly increasing (or, respectively, strictly decreasing) in some real subinterval $[x 1, x 3) ⊆ [x 1, ∞)$ of nonzero measure and, in addition if $x 1 ∈ R +$ , either strictly decreasing (or, respectively, strictly increasing) in some interval $[x 2, x 1] ⊂ R 0 +$ of nonzero measure and, correspondingly, either decreasing (or, respectively, non-decreasing) in some (eventually being of zero measure) interval $[0, x 2]$ ;
(c)
non-decreasing (or, respectively, decreasing) in $[0, ∞)$ and, furthermore, strictly increasing (or, respectively, strictly decreasing) in some real subinterval $[x 2, x 1) ⊆ [0, x 1)$ of nonzero measure.

The result also holds under Assumption 2.2 if $g ′ : R + → R$ is continuous, nonzero, and has a constant sign in some real intervals $[x 2, x 1) ⊆ [0, x 1)$ and $(x 1, x 3) ⊆ [x 1, ∞)$ of nonzero measure while being identically zero in $[0, x 2) ∪ [x 3, ∞)$ .

Proof If $g (x 1) = 0$ for some $x 1 ∈ R 0 +$ and $g : R 0 + → R$ is strictly monotone, then $g (x) ≠ 0$ ; $∀ x (≠ x 1) ∈ R 0 +$ so that there is no equilibrium point of (1.1) other than $x 1$ on $R 0 +$ . The result has been proven under Condition (a). Now, assume that $g : R 0 + → R$ is strictly increasing in $[x 1, x 3) ⊆ [x 1, ∞)$ and non-decreasing in $[x 1, ∞)$ . Then, $g (x) ≥ g (x 3) > g (y) > g (x 1) = 0$ ; $∀ x ∈ (x 3, ∞)$ , $∀ y ∈ (x 1, x 3)$ . If $g : R 0 + → R$ is strictly decreasing in $[x 1, x 3) ⊆ [x 1, ∞)$ and decreasing in $[x 1, ∞)$ , then $0 = g (x 1) > g (y) > g (x 3) ≥ g (x)$ ; $∀ y ∈ (x 1, x 3)$ , $∀ x ∈ (x 3, ∞)$ . Thus, $x 1$ is the unique equilibrium point of (1.1) in $[x 1, ∞)$ . The result under Condition (b) is already proven for $x 1 = 0$ but not yet for $x 1 ∈ R +$ . Thus, assume now that $x 1 ∈ R +$ , that the above conditions hold and that, in addition, $g : R 0 + → R$ is either strictly decreasing (or, respectively, strictly increasing) in some interval $[x 2, x 1] ⊂ R 0 +$ of nonzero measure and, correspondingly, is either decreasing (or, respectively, non-decreasing) within an interval $[0, x 2]$ being of zero or nonzero measure. Then, there is no $x (≠ x 1) ∈ R 0 +$ being an equilibrium point of (1.1). Hence, the result fully follows under Condition (b). A particular case occurs when the function is continuously differentiable and either strictly increasing or strictly decreasing in each of the real intervals $[0, x 1)$ and $(x 1, ∞)$ . Hence, the theorem. □

Theorem 2.4 Assume that $F : R 0 + → R$ satisfies ${x ∈ R + : F (x) = 1 / k} = ∅$ and that Assumption 2.2 holds with all the derivatives referred to as being everywhere continuous in their definition domains. Define $m ′ : R 0 + → R$ as

m ′ (x) = (A G ′ (x) + k F ′ (x) 1 − k F (x)) M (x ¯) − 1 + k F ′ (x) 1 − k F (x) e A G (x ¯); ∀ x ∈ R 0 + .

(2.3)

Then the following properties hold.

(i)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ , and
$M ′ (x) = m ′ (x) + ε (x); ∀ x ∈ R 0 +$
(2.4)

for some given everywhere continuous $ε : R 0 + → R 0 +$ if $g (0) < 0$ , where

g ′ (0) = {− 1 if (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0, [M (0 ¯) A G ′ (0 ¯) − M ′ (0 ¯)] (1 − k F (0)) e − A G (0 ¯) + k F ′ (0) (M (0 ¯) e − A G (0 ¯) − 1) − 1 if (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0 .

(2.5)

Then $x = 0$ is the unique nonnegative equilibrium point of (1.1) in $R 0 +$ .

(ii)
Property (i) also holds if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ and if $M ′ (x) = m ′ (x) − ε (x)$ ; $∀ x ∈ R 0 +$ with $g ′ (0) > 0$ , where
$g ′ (0) = [M (0 ¯) A G ′ (0 ¯) − M ′ (0 ¯)] (1 − k F (0)) e − A G (0 ¯) + k F ′ (0) (M (0 ¯) e − A G (0 ¯) − 1) − 1$
(2.6)

and $ε : R 0 + → R 0 +$ is everywhere continuous.

(iii)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ . Then $∃ x 1 ∈ R +$ , which satisfies $g (x 1) = 0$ , is a unique nonnegative equilibrium point of (1.1) if $M ′ (x) = m ′ (x) + ε (x)$ subject to (2.5) with $ε : R 0 + → R 0 +$ being everywhere continuous, (strictly) positive in $[0, x 1 + ε 0]$ for some sufficiently large $ε 0 ∈ R 0 +$ , and decreasing in $R 0 +$ .
(iv)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $g (0) = (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ . Then, $¬ ∃ x 1 ∈ R 0 +$ is a nonnegative equilibrium point of (1.1) if $M ′ (x) = m ′ (x) − ε (x)$ with $ε : R 0 + → R 0 +$ is everywhere continuous.

Proof Property (i) is first proven. Direct calculation from (2.2) under Assumption 2.2 yields

g ′ (x) = (1 − k F (x)) (A G ′ (x ¯) M ′ (x ¯) − M (x ¯)) e − A G (x ¯) − k F ′ (x) (1 − M (x ¯) e − A G (x ¯)) − 1 = [M (x ¯) (A G ′ (x ¯) (1 − k F (x)) + k F ′ (x)) − M ′ (x ¯) (1 − k F (x))] e − A G (x ¯) − k F ′ (x) − 1 = [M (x ¯) A G ′ (x ¯) − M ′ (x ¯)] (1 − k F (x)) e − A G (x ¯) + k F ′ (x) (M (x ¯) e − A G (x ¯) − 1) − 1

(2.7)

for any $x ∈ R 0 +$ such that $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≥ 0$ , and $g ′ (x) = − 1$ for any $x ∈ R 0 +$ such that $(1 − k F (x)) (1 − M (x ¯) e − A G (x ¯)) ≤ 0$ . It is assumed that $g ′ (0) = a − 1 < g (0) = 0$ , obtained from (2.5), where $a = a (0)$ is defined by

a = {0 if (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0, [M (0 ¯) A G ′ (0 ¯) − M ′ (0 ¯)] (1 − k F (0)) e − A G (0 ¯) + k F ′ (0) (M (0 ¯) e − A G (0 ¯) − 1) otherwise .

(2.8)

Define $m ′ : R 0 + → R$ as

m ′ (x) = (A G ′ (x) + k F ′ (x) 1 − k F (x)) M (x ¯) − 1 + k F ′ (x) 1 − k F (x) e A G (x ¯); ∀ x ∈ R 0 +,

(2.9)

which is everywhere continuous in $R +$ since the subset of its second-class discontinuity points is empty by hypothesis. Then, from (2.4), one has for any $x ∈ R +$ such that $F (x) ≠ 1 / k$ , then for any $x ∈ R +$ since ${x ∈ R + : F (x) = 1 / k} = ∅$ , that

g ′ (x) ≤ 0 ⇔ M ′ (x) ≥ m ′ (x); g ′ (x) < 0 ⇔ M ′ (x) > m ′ (x); g ′ (x) = 0 ⇔ M ′ (x) = m ′ (x); ∀ x ∈ R +,

(2.10a)

g ′ (x) ≥ 0 ⇔ M ′ (x) ≤ m ′ (x); g ′ (x) > 0 ⇔ M ′ (x) < m ′ (x); ∀ x ∈ R + .

(2.10b)

Now, $x = 0$ is an equilibrium point of (1.1), equivalently, $g (0) = 0$ , with $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ and $g ′ (0) = a − 1 < 0$ with $a = 0$ if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0$ and $a = a (0) = (M (0 ¯) A G ′ (0 ¯) − M ′ (0 ¯)) (1 − k F (0)) e − A G (0 ¯) + k F ′ (0) (M (0 ¯) e − A G (0 ¯) − 1) < 1$ if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ . In both cases, $g ′ (0) < 0$ and, since $g ′ : R 0 + → R$ is continuous from (2.3)-(2.4), since ${x ∈ R + : F (x) = 1 / k} = ∅$ implies that $m ′ : R 0 + → R$ is continuous, there is some $x 1 ∈ R +$ such that $g : R 0 + → R$ is strictly decreasing on $[0, x 1)$ from (2.4)-(2.5). Thus, $0 ≠ g (x) < g (0) = 0$ ; $∀ x ∈ [0, x 1)$ and $g (x) ≤ g (x 1) < g (0) = 0$ ; $∀ x ∈ R +$ since $g : R 0 + → R$ is decreasing in $R 0 +$ if (2.10a) holds. Hence, Property (i). Property (ii) is a dual property of (i) with $g ′ (0) = a − 1 > g (0) = 0$ and $g : R 0 + → R$ being non-decreasing in $R 0 +$ under (2.10b).

Property (iii) holds since $g (0) = (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ (so that $x = 0$ is not an equilibrium point of (1.1)) with $g : R 0 + → R$ being strictly decreasing in $[0, x 1 + ε 0]$ and decreasing on $[0, ∞)$ from (2.10a) for some $x 1 ∈ R +$ (since $ε : R 0 + ∖ [0, x 1 + ε 0] → R +$ ) which exists so that $g (x) ≤ g (x 1 + ε) < g (x 1) = 0 < g (y)$ ; $∀ x (> x 1), y (< x 1) ∈ R +$ . Then $x 1$ is the unique equilibrium point of (1.1) in $R 0 +$ if $ε 0$ is large enough. Property (iv) holds since $g (0) > 0$ (so that $x = 0$ is not an equilibrium point of (1.1)) with $g : R 0 + → R$ being non-decreasing in $[0, ∞)$ from (2.10b). Then there is no equilibrium point of (1.1) in $R 0 +$ . □

The existence of the zero equilibrium and another positive equilibrium point of (1.1) can be given by a direct extension of Theorem 2.4(i)-(ii) as follows.

Theorem 2.5 Assume that $F : R 0 + → R$ satisfies ${x ∈ R + : F (x) = 1 / k} = ∅$ and that Assumption 2.2 holds with all the derivatives referred to as being everywhere continuous in their definition domains. Then the following properties hold.

(i)
Assume, in addition, that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ , $M ′ (x) = m ′ (x) + ε (x)$ ; $∀ x ∈ [0, x 1)$ and $M ′ (x) = m ′ (x) − ε (x)$ ; $∀ x ∈ [x 1, ∞)$ for some $x 1 ∈ R +$ , any continuous $ε : R 0 + → R +$ with $g ′ (0) < 0$ satisfying (2.5) (i.e. $g ′ (0) = a − 1 < 0$ if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ and $g ′ (0) = − 1 < 0$ if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0$ ). Then, $x = 0$ and $x = x 2 > x 1$ for some $x 2 ∈ R +$ are the only two nonnegative equilibrium points of (1.1) in $R 0 +$ .
(ii)
Property (i) also holds if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ and if $M ′ (x) = m ′ (x) − ε (x)$ ; $∀ x ∈ [0, x 1)$ and $M ′ (x) = m ′ (x) + ε (x)$ ; $∀ x ∈ [x 1, ∞)$ for some $x 1 ∈ R +$ and $g ′ (0) > 0$ , according to (2.6), for any continuous $ε : R 0 + → R +$ .

Outline of proof The proof of Property (i) follows with $g : R 0 + → R$ being strictly decreasing on some interval $[0, x 1)$ with $g ′ (0) < 0$ and strictly increasing on $[x 1, ∞)$ since $g ′ (0) = − 1 < 0$ if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) < 0$ and $g ′ (0) = a − 1 < 0$ if $g (0) = (1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ . Then there is $x 2 (> x 1) ∈ R +$ such that $0 = g (0) > g (x) > g (x 1) < g (y) < g (x 2) = 0 < g (z)$ ; $∀ x ∈ (0, x 1)$ , $x ∈ (x 1, x 2)$ , $∀ z ∈ (x 2, ∞)$ . Then there is no $x ∈ R 0 +$ other than $x = 0$ and $x = x 2$ such that $g (x) = 0$ . Hence, Property (i). The proof of Property (ii) is similar by noting that $0 = g (0) < g (x) < g (x 1) > g (y) > g (x 2) = 0 > g (z)$ with $g (x)$ being strictly increasing in $[0, x 1)$ and strictly decreasing in $(x 1, ∞)$ . Hence, the result. □

Note that the conditions of Theorem 2.5 can be relaxed in the sense that it is not necessary for $g : R 0 + → R$ to be strictly monotone in $(x 2, ∞)$ but non-decreasing for Part (i) and decreasing for Part (ii).

Examples 2.6 (1) If we consider the particular case $p = 1$ , $x = x ¯$ , $F (x) = G (x) = x$ , then $F (0) = G (0) = 0$ , $M (x) = M (0) = 1$ so that $F ′ (x) = G ′ (x) = F ′ (0) = G ′ (0) = 1$ , $M ′ (x) = M ′ (0) = 0$ , one gets from Theorem 2.4(i) that the condition $M ′ (0) = 0 ≥ A − 1$ , equivalently, $0 < A ≤ 1$ , leads to $x = 0$ being an equilibrium point of (1.1). Also, one has again from Theorem 2.4(i) that $g (0) = 0$ and the following condition holds for $x ∈ [0, 1 / k)$ and $0 < A ≤ 1$ :

0 = M ′ (x) ≥ m ′ (x) = A − 1 1 − k x (e A x + k (e A x − 1)) .

Then $x = 0$ is the only equilibrium point of (1.1) if $0 < A ≤ 1$ for any $k ∈ N$ , since $g : R 0 + → R +$ is decreasing for $x ∈ [0, 1 / k)$ from the above inequality and $g ′ (0) < 0$ implies that $¬ ∃ x 1 ∈ R +$ such that $g (x 1) = 0$ . This coincides with former results obtained in [1, 2] for $k = 1$ .

(2)
Consider the equilibrium equation $x = (1 + k x) (e A x + 1)$ of $x n + 1 = (1 + ∑ j = 0 k − 1 x n − j) (1 + e A x n)$ with $min (x 1 − i : i ∈ p ¯) ≥ 0$ . Thus, $F (x) = G (x) = − x$ , $F ′ (x) = G ′ (x) = − 1$ , $M (x) = − 1$ , $M ′ (x) = 0$ , $g (0) = 2$ , $g ′ (0) = A + 2 k − 1 > 0$ , and $g : R 0 + → R +$ is not decreasing for $A ≥ 0$ since
$0 = M ′ (x) ≥ m ′ (x) = A + 1 1 + k x (k (e − A x + 1) − e − A x)$

cannot hold for $x ∈ R 0 +$ . Thus, $¬ ∃ x ∈ R 0 +$ is an equilibrium point for any $A ≥ 0$ .

Theorems 2.3, 2.4 and 2.5 may be extended by removing the condition ${x ∈ R + : F (x) = 1 / k} = ∅$ and the continuity of the derivatives of the vector functions in Assumption 2.2 by allowing such derivatives to be impulsive at the points of $x ∈ R +$ such that $F (x) = 1 / k$ , if any. The sign of eventual impulses should be such that they do not change the needed non-decreasing, decreasing or strictly monotone properties of $g : R 0 + → R$ . We denote in the following by $f (x −)$ the left limits and by $f (x)$ the right limits of functions at points of the functions $f : R 0 + → R$ which are distinct if such functions are discontinuous at x. Such an extension is as follows.

Theorem 2.7 Let Assumption 2.2 hold with $F : R 0 + → R$ being continuous on $R 0 + ∖ S imp$ and impulsive on $S imp$ , and $M ′, G ′ : R 0 + p → R$ being continuous on $R 0 + p ∖ S ¯ imp$ and impulsive on $S ¯ imp$ , where $S imp = {x ∈ R + : F (x) = 1 / k}$ and $S ¯ imp = {x ¯ = (x, x, …, x) ∈ R 0 + p : x ∈ S imp}$ which can be empty or nonempty (note that $x ¯ ∈ S ¯ imp$ if and only if $x ∈ S imp$ ). Let the function $m ′ : R 0 + → R$ be defined in (2.3). Then the following properties hold.

(i)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) ≤ 0$ , and $M ′ (x) = m ′ (x) + ε (x)$ ; $∀ x ∈ R 0 +$ for some continuous $ε : R 0 + → R 0 +$ being everywhere continuous and satisfying (2.5). Then $x = 0$ is the unique nonnegative equilibrium point of (1.1) in $R 0 +$ provided that either $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) = 0$ or $sgn (F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯)) < 0$ ; $∀ x ∈ S imp$ .
(ii)
Property (i) also holds if $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) = 0$ and if $M ′ (x) = m ′ (x) − ε (x)$ ; $∀ x ∈ R 0 +$ with $ε : R 0 + → R 0 +$ being everywhere continuous and satisfying (2.6) and $g ′ (0) > 0$ provided that either $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) = 0$ or $sgn (F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯)) > 0$ ; $∀ x ∈ S imp$ .
(iii)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ . Then, $∃ x 1 ∈ R +$ , which satisfies $g (x 1) = 0$ , is then a unique nonnegative equilibrium point of (1.1) if $M ′ (x) = m ′ (x) + ε (x)$ , with $ε : R 0 + → R 0 +$ being everywhere continuous and strictly decreasing in $[0, x 1]$ and decreasing in $(x 1, ∞)$ , provided that $g ′ (0)$ fulfils (2.5), $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) = 0$ , or $sgn (F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯)) < 0$ with $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) 1 − K F (x) ≤ − g (x −)$ ; $∀ x ∈ S imp$ . If $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) 1 − K F (x) = − g (x −)$ , then $x 1 = x$ .
(iv)
Assume that $F : R 0 + → R 0 +$ and $M, G : R 0 + q → R 0 +$ satisfy $(1 − k F (0)) (1 − M (0 ¯) e − A G (0 ¯)) > 0$ . Then $¬ ∃ x 1 ∈ R 0 +$ is a nonnegative equilibrium point of (1.1) if $M ′ (x) = m ′ (x) − ε (x)$ with $ε : R 0 + → R 0 +$ being everywhere continuous, and $g ′ (0)$ subject to (2.6), provided that either $F ′ (x) M (x ¯) − (1 + k F ′ (x)) e A G (x ¯) = 0$ or $sgn (F ′ (x) M (x ¯) − (1 + k F ′ (x) e) A G (x ¯)) > 0$ ; $∀ x ∈ S imp$ .

Outline of proof Note that the various extended conditions in Theorem 2.7(i)-(iv) with respect to those of Theorem 2.4 imply that $g (x) ≤ g (x −)$ (respectively, $g (x) ≥ g (x −)$ ) if $x ∈ S imp$ and $g : (x − ε, x) → R$ is decreasing (respectively, non-decreasing) for some $ε ∈ R +$ since the constraints $M ′ (x) = m ′ (x) ± ε (x)$ of Theorem 2.4 also hold at the discontinuities of $m ′ (x)$ at $x = − 1 / k$ . □

3 Stability results

A result on boundedness of the solutions of (1.1) and then its stability under certain parametrical constraints is now given as follows.

Theorem 3.1 Assume the following:

(1)
The real sequences ${F n}$ and ${M n}$ of respective general terms $F n = F (x n)$ and $M n = M (x ¯ n)$ satisfy the constraints $ν n x n ≤ F n ≤ μ n x n$ and $δ n max n − p + 1 ≤ i ≤ n x i ≤ M n ≤ ω n max n − p + 1 ≤ i ≤ n x i$ for some nonnegative real sequences ${ν n}$ , ${μ n}$ , ${δ n}$ and ${ω n}$ with $μ n ≥ ν n$ and $ω n ≥ δ n$ ; $∀ n ∈ N 0$ .
(2)
There are $a, b (≥ a) ∈ R 0 +$ such that $b ≥ x i ≥ a$ ; $i = 1 − p, 2 − p, …, 0$ .
(3)
$G : R 0 + q → R$ , which generates the real sequence ${G n}$ of general terms $G n = G (x n)$ satisfies the following constraints on $R 0 +$ :
$a ≤ G n (x) ≤ b if A ≥ 0; a ≥ G n (x) ≥ b if A < 0 .$

Then the following properties hold:

(i)
$b ≥ x i ≥ a$ ; $∀ i ∈ {1 − p, 2 − p, …, 0} ∪ N$ if the sequences ${ν n}$ , ${μ n}$ satisfy
$e A b a 2 (∑ j = 0 k − 1 ν n − j) [a + b (ω n e − A a + ∑ j = 0 k − 1 μ n − j) − 1] ≤ δ n ≤ ω n ≤ e A a b 2 (∑ j = 0 k − 1 μ n − j) [b + a (δ n e − A b + ∑ j = 0 k − 1 ν n − j) − 1];$
(3.1)

$∀ n ∈ N 0$ for given a, b, ${ν n}$ and ${μ n}$ .

(ii)
A sufficient condition for (3.1) to hold is
$(1 − 1 a b (∑ j = 0 k − 1 ν n − j) (∑ j = 0 k − 1 μ n − j)) − 1 e A b a 2 (∑ j = 0 k − 1 ν n − j) × [a − 1 + b (∑ j = 0 k − 1 μ n − j) + 1 ∑ j = 0 k − 1 ν n − j + b (∑ j = 0 k − 1 μ n − j − 1) a (∑ j = 0 k − 1 ν n − j)] ≤ δ n ≤ ω n ≤ (1 − 1 a b (∑ j = 0 k − 1 ν n − j) (∑ j = 0 k − 1 μ n − j)) − 1 e A a b 2 (∑ j = 0 k − 1 μ n − j) × [b − 1 + a (∑ j = 0 k − 1 ν n − j) + 1 ∑ j = 0 k − 1 μ n − j + a (∑ j = 0 k − 1 ν n − j − 1) b (∑ j = 0 k − 1 μ n − j)];$

$∀ n ∈ N 0$ provided that $(∑ j = 0 k − 1 ν n − j) (∑ j = 0 k − 1 μ n − j) ≠ 1 a b$ .

Proof Note that $1 − ω n x ¯ n e − A a ≤ 1 − M n e − A G n ≤ 1 − δ n x ¯ n e − A b$ ; $∀ n ∈ N 0$ since

[(a ≤ G n (x) ≤ b if A ≥ 0) ∧ (a ≥ G n (x) ≥ b if A < 0)] ⇒ [e A a ≤ e A G n ≤ e A b]; ∀ n ∈ N 0 .

Assume that $0 ≤ a ≤ x n ≤ b < ∞$ for some $a, b (≥ a) ∈ R +$ and $p (≥ n) ∈ N 0$ . Proceed now by complete induction by assuming that if there is some $n (≥ p) ∈ N$ such that $b ≥ x i ≥ a$ ; $∀ i ∈ n ¯$ , then $b ≥ x n + 1 ≥ a$ . If $x n + 1 = 0$ , this holds trivially for any $a, b (≥ a) ∈ R 0 +$ . Note that for $i ∈ n ¯$ ,

ν i a ≤ F i ≤ μ i b; e A a ≤ e A G i ≤ e A b, b ω i e − A a ≥ M i e − A G i ≥ a δ i e − A b,

(3.2)

1 − b ω i e − A a ≤ 1 − ω i x ¯ i e − A a ≤ 1 − M i e − A G i ≤ 1 − δ i x ¯ i e − A b ≤ 1 − a δ i e − A b .

(3.3)

If $x n + 1 ≠ 0$ then it satisfies from (1.1) by using (3.2)-(3.3) that

a ≤ a 2 δ n (∑ j = 0 k − 1 ν n − j) e − A b − b (ω n e − A a + ∑ j = 0 k − 1 μ n − j) + 1 ≤ x n + 1 = (1 − ∑ j = 0 k − 1 F n − j) (1 − M n e − A G n) = − F n + F n M n e − A G n + (∑ j = 1 k − 1 F n − j) M n e − A G n − (∑ j = 1 k − 1 F n − j) − M n e − A G n + 1 ≤ b 2 ω n (∑ j = 0 k − 1 μ n − j) e − A a − a (δ n e − A b + ∑ j = 0 k − 1 ν n − j) + 1 ≤ b;

(3.4)

$∀ n ∈ N 0$ provided that (3.1) holds. Thus, if $b ≥ x i ≥ a$ ; $i = 1 − p, 2 − p, …, 0$ , then $b ≥ x i ≥ a$ ; $∀ i ∈ {1 − p, 2 − p, …, 0} ∪ N$ . Hence, Property (i).

Property (ii) follows by replacing the lower-bound of $δ n$ of (3.1) in the upper-bound of $ω n$ to get a more stringent upper-bound $ω ¯ n$ of $ω n$ , which does not depend on $δ n$ since

ω n ≤ ω ¯ n = e A a b 2 (∑ j = 0 k − 1 μ n − j) [b − 1 + a (∑ j = 0 k − 1 ν n − j) + 1 a (∑ j = 0 k − 1 ν n − j) (a + b ω n e − A a + b ∑ j = 0 k − 1 μ n − j − 1)]; ∀ n ∈ N 0 .

In a close way, we can get a more stringent lower-bound $δ ̲ n$ of $δ n$ , which does not depend on $ω n$ since

δ n ≥ δ ̲ n = e A b a 2 (∑ j = 0 k − 1 ν n − j) [a − 1 + b (∑ j = 0 k − 1 μ n − j) + 1 b (∑ j = 0 k − 1 μ n − j) (b + a δ n e − A b + a ∑ j = 0 k − 1 ν n − j − 1)]; ∀ n ∈ N 0 .

□

Remark 3.2 (Brief historical note)

It can be pointed out that assumptions of the type in the assumption in Theorem 3.1 are very relevant to some classical control problems for both continuous-time or discrete-time descriptions of dynamic systems, like, for instance, those of absolute stability in the Lure and Popov (following Vasile Mihai Popov - Galati, Romania, 1928) senses or Popovian hyperstability [22]. Basically, if there are uncertainties in parameterization, which is a very common drawback from fabrication dispersion of components for devices constructed for applications, a robust regulator or controller, in general, has to be able to stabilise all the particular elements of the whole series within some error margin, not just the theoretically nominal one. The lack in appropriately formulating that problem implied during Second World War II a lack of well-regulated equilibrium positioning of guns of some Soviet military tanks with the associate lack of effectiveness in military operations. This was the initial point of the theory of Popov’s absolute stability later on being generalised to hyperstability after including the phenomena of existence of unmodelled dynamics. This was apparently one of the reasons for Popov’s decision of to investigate the simultaneous stabilization of devices of the same family subject to parametrical dispersion of components related to a theoretical nominal ideal device (source: old private communication by PhD supervisor ID Landau, a former Popov’s collaborator and later on a relevant researcher in the field, to the first author of this paper). See also [23] for relevant content honouring Popov’s work. In the context of this paper, we can attribute the unmodelled or parametrical errors to a non-exact parameterization of the epidemic model for each possible situation.

A set of stability and instability properties, implying, furthermore, that any nontrivial solution of (1.1) is strictly monotone for $n ∈ N 0$ , are presented in the next two results. Some of the properties depend on parametrical conditions of lower- and upper-bounding sequences of ${F n}$ .

Theorem 3.3 Assume that the real sequence ${F n}$ satisfies the constraints $∑ i = 0 m ν n i x n i ≤ F n ≤ ∑ i = 0 m μ n i x n i$ for some real sequences ${ν n i}$ , ${μ n i}$ with $μ n i ≥ ν n i$ ; $i ∈ m ¯ ∪ {0}$ , $∀ n ∈ N 0$ . The following properties hold.

(i)
Any nontrivial nonnegative solution ${x n}$ of (1.1) is uniformly bounded and strictly decreasing for $n ∈ N 0$ and initial conditions $1 ≥ min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≥ x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ , and then it converges to the zero equilibrium point under the following condition:
$([(∑ j = n − k + 1 n μ j 0 < 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≥ 0)] ∨ [(∑ j = n − k + 1 n μ j 0 > 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≤ 0)]) ∧ (M n ≥ e A G n); ∀ n ∈ N 0 .$
(3.5)
(ii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) is uniformly bounded and strictly decreasing for $n ∈ N 0$ and initial conditions $min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ , and then it converges to the zero equilibrium point under the following condition:
$[(∑ j = n − k + 1 n ν j 0 < 1) ∧ (ν j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯)] ∧ (M n ≤ e A G n); ∀ n ∈ N 0 .$
(3.6)

Proof Define $λ n = 1 − M n e − A G n$ . Thus, one gets

x n + 1 − x n = (1 − ∑ j = n − k + 1 n F j) λ n − x n < 0; ∀ n ∈ N 0

(3.7)

from (1.1) if $x n > 0$ , $∑ j = n − k + 1 n F j ≤ 1$ and $λ n ≤ 0$ , which is guaranteed with $M n ≥ e A G n$ ; $∀ n ∈ N 0$ , if for any $n ∈ N 0$ , the constraints $0 < x n < ⋯ < x 0 ≤ x − 1 ≤ ⋯ ≤ x − p + 1 ≤ min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i))$ hold for any given $n ∈ N 0 +$ , together with

∑ j = n − k + 1 n F j ≤ ∑ j = n − k + 1 n μ j 0 + ∑ j = n − k + 1 n ∑ i = 1 m μ j i x j i ≤ ∑ j = n − k + 1 n μ j 0 + ∑ j = n − k + 1 n ∑ i = 1 m μ j i max (x j, x j m) ≤ ∑ j = n − k + 1 n μ j 0 + ∑ j = n − k + 1 n ∑ i = 1 m μ j i x j ≤ ∑ j = n − k + 1 n μ j 0 + (∑ j = n − k + 1 n ∑ i = 1 m μ j i) x − p + 1 ≤ 1

(3.8a)

so that

0 < x n + 1 < x n < ⋯ < x 0 ≤ x − p + 1 ≤ min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)); ∀ n ∈ N 0

(3.8b)

provided that $min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≥ x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ . It has been proven by complete induction that for any given $n ∈ N 0$ ,

0 < x n < ⋯ < x 0 ≤ x − 1 ≤ ⋯ ≤ x − p + 1 ≤ min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≤ 1 ⇒ 0 < x n + 1 < x n < ⋯ < x 0 ≤ x − p + 1 ⇒ 0 ≤ min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≤ 1 .

(3.9)

A close result also holds involving non-strict inequalities if $x n = 0$ , $∑ j = n − k + 1 n F j ≤ 1$ and $λ n ≤ 0$ or if $x n ≥ 0$ , $∑ j = n − k + 1 n F j > 1$ and $λ n ≥ 0$ , then $x j = 0$ ; $∀ j (≥ n + 1) ∈ N 0$ from (1.1). Then (3.5) guarantees the convergence to zero of the sequence ${x n}$ ; $n ∈ N 0$ which is, furthermore, strictly decreasing. Hence, Property (i).

To prove Property (ii), note that (3.7) also holds from (1.1) for $x n > 0$ if $∑ j = n − k + 1 n F j ≥ 1$ and $λ n ≥ 0$ , which is guaranteed with $M n ≤ e A G n$ ; $∀ n ∈ N 0 +$ , if $∑ j = n − k + 1 n ∑ i = 1 m ν j i ≤ 0$ , and then the complete induction method gives

min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0 > x n for any given n ∈ N 0,

together with

∑ j = n − k + 1 n F j ≥ ∑ j = n − k + 1 n ν j 0 − | ∑ j = n − k + 1 n ∑ i = 1 m ν j i | max (x j, x j m) ∑ j = n − k + 1 n F j ≥ ∑ j = n − k + 1 n ν j 0 − | ∑ j = n − k + 1 n ∑ i = 1 m ν j i | x − p + 1 ≥ 1 ⇒ min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) ⇒ > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0 > x n > x n + 1; ∀ n ∈ N 0

(3.10)

provided that $min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ . On the other hand, if $x n ≥ 0$ with $∑ j = n − k + 1 n F j ≥ 1$ and $λ n ≥ 0$ or if $x n ≥ 0$ , $∑ j = n − k + 1 n F j ≤ 1$ and $λ n ≤ 0$ , then $x j = 0$ ; $∀ j (≥ n + 1) ∈ N 0$ from (1.1). Then (3.6) guarantees the convergence to zero of the sequence ${x n}$ ; $n ∈ N 0$ which is, furthermore, strictly decreasing. Hence, Property (ii). □

A dual result to Theorem 3.3 concerned with the instability situations follows.

Theorem 3.4 The following properties hold.

(i)
Any nontrivial nonnegative solution ${x n}$ of (1.1) is strictly increasing for $n ∈ N 0$ and initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ , and then it tends to +∞ under the following condition:
$(e A G n (1 + 1 ∑ j = n − k + 1 n ν j 1) > M n ≥ e A G n) ∧ (∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ N 0$
(3.11)

with $M n > e A G n$ if $x n ≠ 0$ and $∑ j = n − k + 1 n μ j 1 > 0$ with ${F n}$ satisfying the same constraints as those of Theorem 3.3.

(ii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) is strictly increasing for $n ∈ N 0$ and initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ , and then it tends to +∞ under the following condition:
$(M n ≤ e A G n) ∧ (∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ N 0$
(3.12)

with $M n > e A G n$ if $x n ≠ 0$ and $∑ j = n − k + 1 n μ j 1 < 0$ .

Proof Assume that $x j > x j − 1 > ⋯ > x 0 ≥ x − 1 ≥ ⋯ ≥ x − p + 1$ for any given $j (≤ n) ∈ N 0$ . If $x n + 1 ≠ 0$ , then it follows that

x n + 1 = (1 − ∑ j = n − k + 1 n F j) (1 − M n e − A G n) = (∑ j = n − k + 1 n F j − 1) (M n e − A G n − 1) ≥ (∑ j = n − k + 1 n ν j 0 − 1 + ∑ j = n − k + 1 n ν j 1 x j + ∑ j = n − k + 1 n ∑ i = 2 m ν j i x j i) (M n e − A G n − 1) > x n ≥ (∑ j = n − k + 1 n ν j 0 − 1 + ∑ j = n − k + 1 n ν j 1 x j + ∑ j = n − k + 1 n ∑ i = 2 m ν j i min (x n, x n m)) (M n e − A G n − 1) > x n

if either

M n ≥ e A G n; ∑ j = n − k + 1 n ν j 1 > 1 1 − M n e − A G n; ∑ j = n − k + 1 n ν j 0 ≥ 1; ν j i ≥ 0; ∀ j, n ∈ N 0, ∀ i ∈ m ¯

(3.13)

with the first inequality being strict for any $x n ≠ 0$ , or

M n ≤ e A G n; ∑ j = n − k + 1 n | ν j 1 | > 1 1 − M n e − A G n; ∑ j = n − k + 1 n ν j 0 ≤ 1; ν j i ≤ 0; ∀ j, n ∈ N 0, ∀ i ∈ m ¯

(3.14)

with the first inequality being strict for any $x n ≠ 0$ , and the proof of Property (i) follows by complete induction after combining the first two conditions of (3.13). The proof of Property (ii) follows from (3.14) in the same way after combining the first two conditions which reduce to the first one. □

The constraints $∑ i = 0 m ν n i x n i ≤ F n ≤ ∑ i = 0 m μ n i x n i$ ; $∀ n ∈ N 0$ have been used in order to simplify the discussion. More general constraints can be used instead as, for instance, $∑ i = 0 m n ν n i x n i ≤ F n ≤ ∑ i = 0 m n μ n i x n i$ or $∑ i ∈ I n ν n i x n i ≤ F n ≤ ∑ i ∈ I n μ n i x n i$ , where ${m n}$ is a nonnegative sequence of polynomial degrees subject to $m ̲ ≤ m n ≤ m ¯$ ; $∀ n ∈ N 0$ and ${I n}$ is a nonnegative real sequence of sets of cardinal $(m n + 1)$ ; $∀ n ∈ N 0$ . The above second constraints are not necessarily of polynomial type. Theorems 3.3-3.4 have the following direct extensions such that the stability and instability conditions depend not only of the parameters but on the solution sequence as well.

Theorem 3.5 The following results hold.

(i)
Assume that the sequence ${M n}$ satisfies the constraint
$M n > e A G n (1 + x n (∑ j = n − k + 1 n ν j 0 − 1) + (∑ j = n − k + 1 n ∑ i = 1 m ν j i) min (x n, x n m)); ∀ n ∈ N 0 .$
(3.15)

Thus, any nontrivial nonnegative solution ${x n}$ of (1.1) under initial conditions $x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0 > 0$ is uniformly bounded and strictly decreasing and then converges to the zero equilibrium point. If the above inequality is non-strict, then any nontrivial solution still is uniformly bounded satisfying $x n ≤ x 0 ≤ x − p + 1 < + ∞$ , $∀ n ∈ N 0$ .

(ii)
Assume that the sequence ${M n}$ satisfies the constraint
$M n < e A G n (1 − x n (∑ j = n − k + 1 n μ j 0 − 1) + (∑ j = n − k + 1 n ∑ i = 1 m μ j i) max (x n, x n m)); ∀ n ∈ N 0 .$
(3.16)

Thus, any nontrivial nonnegative solution ${x n}$ of (1.1) under initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ is strictly increasing and then tends to +∞. If the above inequality is non-strict, then any nontrivial solution is bounded from below satisfying $x n + 1 ≥ x n ≥ x 0 ≥ x − p + 1 > 0$ , $∀ n ∈ N 0$ .

Proof Note that for $x n > 0$ and $x n + 1 ≥ 0$ , one has

x n + 1 = (1 − ∑ j = n − k + 1 n F j) (1 − M n e − A G n) ≤ x n ⇔ M n ≥ e A G n (1 + x n ∑ j = n − k + 1 n F j − 1); ∀ n ∈ N 0 .

(3.17)

If $x n = 0$ then $x j = 0$ ; $∀ j (≥ n) ∈ N 0$ from (1.1). Thus, Eq. (3.15) is a sufficient condition for (3.17) to hold. This proves the first part of Property (i) and the solution sequence is strictly decreasing. If the inequality in (3.15) is non-strict, then $x n + 1 ≤ x n ≤ x 0 ≤ x − p + 1$ ; $∀ n ∈ N 0$ leading to the second part of Property (i). Property (ii) follows by proving that (3.16) guarantees that

x n + 1 = max (0, (1 − ∑ j = n − k + 1 n F j) (1 − M n e − A G n)) > (≥) x n; ∀ n ∈ N 0 .

□

Theorems 3.3-3.4 may be combined to give mixed conditions for the solution to be oscillatory while being uniformly bounded as follows.

Theorem 3.6 Assume that the real sequence ${F n}$ satisfies the constraints: $∑ i = 0 m ν n i x n i ≤ F n ≤ ∑ i = 0 m μ n i x n i$ for some nonnegative real sequences ${ν n i}$ , ${μ n i}$ with $μ n i ≥ ν n i$ ; $i ∈ m ¯ ∪ {0}$ , $∀ n ∈ N 0$ . Then the following properties hold.

(i)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≥ x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ is uniformly bounded and oscillatory if it satisfies, for each two consecutive intervals on nonnegative integers, the following constraints:
$([(∑ j = n − k + 1 n μ j 0 < 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≥ 0)] ∨ [(∑ j = n − k + 1 n μ j 0 > 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≤ 0)]) ∧ (M n ≥ e A G n); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.18)

(e A G n (1 + 1 ∑ j = n − k + 1 n ν j 1) > M n ≥ e A G n) ∧ (∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.19)

with $M n > e A G n$ if $x n ≠ 0$ in (3.19), for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ . The solution is alternately strictly decreasing and strictly increasing for each two consecutive such intervals.

(ii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $min (1, min n ∈ N 0 + (1 − ∑ j = n − k + 1 n μ j 0 ∑ j = n − k + 1 n ∑ i = 1 m μ j i)) ≥ x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$([(∑ j = n − k + 1 n μ j 0 < 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≥ 0)] ∨ [(∑ j = n − k + 1 n μ j 0 > 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≤ 0)]) ∧ (M n ≥ e A G n); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.20)

(M n ≤ e A G n) ∧ (∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.21)

with $M n < e A G n$ if $x n ≠ 0$ in (3.21), for any given finite $j ∈ N 0$ and for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0 +$ with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ . The solution is alternately strictly decreasing and strictly increasing for each two consecutive such intervals.

(iii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$[(∑ j = n − k + 1 n ν j 0 < 1) ∧ (ν j i ≤ 0; ∀ j ∈ N 0, ∀ i ∈ m ¯)] ∧ (M n ≤ e A G n); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.22)

(e A G n (1 + 1 ∑ j = n − k + 1 n ν j 1) > M n ≥ e A G n) ∧ (∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.23)

with $M n > e A G n$ if $x n ≠ 0$ in (3.23), for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ . The solution is alternately strictly decreasing and strictly increasing for each two consecutive such intervals.

(iv)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $min (1, min n ∈ N 0 + (∑ j = n − k + 1 n ν j 0 − 1 | ∑ j = n − k + 1 n ∑ i = 1 m ν j i |)) > x − p + 1 ≥ ⋯ ≥ x − 1 ≥ x 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$[(∑ j = n − k + 1 n ν j 0 < 1) ∧ (ν j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯)] ∧ (M n ≤ e A G n); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.24)

(M n ≤ e A G n) ∧ (∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.25)

with $M n < e A G n$ if $x n ≠ 0$ in (3.25), for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ , with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ ; $∀ j ∈ N 0$ . The solution is alternately strictly decreasing and strictly increasing for each two consecutive such intervals.

(v)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$(e A G n (1 + 1 ∑ j = n − k + 1 n ν j 1) > M n ≥ e A G n) ∧ (∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.26)

([(∑ j = n − k + 1 n μ j 0 < 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≥ 0)] ∨ [(∑ j = n − k + 1 n μ j 0 > 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≤ 0)]); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.27)

with $M n > e A G n$ if $x n ≠ 0$ in (3.26), for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ . The solution is alternately strictly increasing and strictly decreasing for each two consecutive such intervals. If the above inequality is strict, then the solution converges asymptotically to the zero equilibrium point.

(vi)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$(M n ≤ e A G n) ∧ (∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.28)

([(∑ j = n − k + 1 n μ j 0 < 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≥ 0)] ∨ [(∑ j = n − k + 1 n μ j 0 > 1) ∧ (∑ j = n − k + 1 n ∑ i = 1 m μ j i ≤ 0)]); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.29)

with $M n < e A G n$ if $x n ≠ 0$ in (3.28), for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ ; $∀ j ∈ N 0$ . The solution is alternately strictly increasing and strictly decreasing for each two consecutive such intervals. If the above inequality is strict, then the solution converges asymptotically to the zero equilibrium point.

(vii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$(e A G n (1 + 1 ∑ j = n − k + 1 n ν j 1) > M n ≥ e A G n) ∧ (∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1),$
(3.30)

[(∑ j = n − k + 1 n ν j 0 < 1) ∧ (ν j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯)] ∧ (M n ≤ e A G n); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1)

(3.31)

with $M n > e A G n$ if $x n ≠ 0$ in (3.30) for any given finite $j ∈ N 0 +$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ , with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ ; $∀ j ∈ N 0$ . The solution is alternately strictly increasing and strictly decreasing for each two consecutive such intervals. If the above inequality is strict, then the solution converges asymptotically to the zero equilibrium point.

(viii)
Any nontrivial nonnegative solution ${x n}$ of (1.1) for initial conditions $x − p + 1 ≤ ⋯ ≤ x − 1 ≤ x 0 > 0$ is uniformly bounded and oscillatory if it satisfies the following constraints for each two consecutive intervals on nonnegative integers:
$(M n ≤ e A G n) ∧ (∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯); ∀ n ∈ [k (∑ i = 1 j + 1 n i), k (∑ i = 1 j + 2 n i) − 1),$
(3.32)

[(∑ j = n − k + 1 n ν j 0 < 1) ∧ (ν j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯)] ∧ (M n ≤ e A G n); ∀ n ∈ [k (∑ i = 1 j n i), k (∑ i = 1 j + 1 n i) − 1)

(3.33)

with $M n > e A G n$ if $x n ≠ 0$ in (3.32) for any given finite $j ∈ N 0$ for any set of finite numbers $n i ∈ N$ for $i ≥ 1$ , $i ∈ N 0$ , with $n 0 = 0$ , which satisfy $x k (∑ i = 1 j + 2 n i) − 1 ≤ x k (∑ i = 1 j + 1 n i) − 1$ ; $∀ j ∈ N 0$ . The solution is alternately strictly increasing and strictly decreasing for each two consecutive such intervals. If the above inequality is strict, then the solution converges asymptotically to the zero equilibrium point.

Proof Property (i) is proven directly as follows. For any given finite $j ∈ N 0$ , the solution subsequence ${x k (∑ i = 1 j + ℓ n i) − 1}$ satisfies the chain of inequalities $x k (∑ i = 1 j + ℓ n i) − 1 ≤ x k (∑ i = 1 j + ℓ − 1 n i) − 1 ≤ ⋯ ≤ x k (∑ i = 1 j − 1 n i) − 1 < + ∞$ ; $∀ ℓ ∈ N$ by construction for a set of finite $n i ∈ N$ . Thus, the whole solution cannot possess any other unbounded subsequence since this would be a contradiction to the above chain of finitely upper-bounded inequalities by taking account of the fact that all the numbers $n i ∈ N$ are finite. The solution is alternately strictly increasing and decreasing from Theorem 3.4(i) and Theorem 3.3(i). The first part of Property (ii) is a dual one to Property (i) and it is proven also from Theorems 3.3-3.4 and the existence of a bounded chain of finitely bounded non-strict inequalities as above. The second part is proven as follows. The conditions (3.18) and (3.19) lead to strictly increasing and strictly decreasing sequences of the solution of finite sizes $n i ∈ N$ , $i ∈ N 0$ , respectively. The strict inequality $x k (∑ i = 1 j + 2 n i) − 1 < x k (∑ i = 1 j + 1 n i) − 1$ ; $∀ j ∈ N 0$ , together with the fact that the above sequences of pair order are strictly decreasing from (3.9) and Property (ii), that is, $x k (∑ i = 1 2 j n i) > x k (∑ i = 1 2 j n i + 1) > ⋯ > x k (∑ i = 1 2 j n i + n i, 2 j + 1 + 1)$ , lead to the contradiction $0 = lim j → ∞ x k (∑ i = 1 2 j n i) > max 1 ≤ ℓ ≤ n i + 2 j − 1 (lim inf j → ∞ x k (∑ i = 1 2 j + ℓ n i)) > 0$ if $lim inf j → ∞ x k (∑ i = 1 j n i) > 0$ . Hence, Property (ii). The remaining properties are proven ‘mutatis-mutandis’. □

4 Global stability and instability

Consider, for the sake of a more complete discussion, the following generalisation of (1.1):

x n + 1 = θ n max (0, (1 − ∑ j = 0 k − 1 F (x n − j)) (1 − M (x ¯ n) e − A G (x ¯ n))); ∀ n ∈ N 0

(4.1)

for initial conditions $x i ≥ 0$ ; $i = 1 − p, 2 − p, …, 0$ , where the general term of the real sequence ${θ n}$ satisfies $θ n = θ n (x n) ∈ [0, 1]$ . This term can be interpreted as a total or partial ‘culling’ action on the infection in the sense that all of a part of the infected individuals are removed from the habitat by using, for instance, quarantine or simply removal. Physically, we can consider the first stage given by (1.1) producing the solution sequence $x n + 1 −$ , which replaces the current solution value $x n + 1$ in (1.1), and then the second stage involving an impulsive action leading to the value $x n + 1 ≡ x n + 1 +$ given by (4.1). If $θ n ≡ 1$ , then (4.1) is identical to (1.1). The global stability of (4.1) is discussed from Lyapunov stability theory as follows. Let us define a Lyapunov sequence candidate ${V n}$ for (4.1) of the general term $V n = V n (x n) = p n x n$ , where the general term of the sequence ${p n}$ satisfies $0 < p ̲ ≤ p n ≤ p ¯ < + ∞$ for some $p ̲, p ¯ (≥ p ̲) ∈ R +$ . The following result follows.

Theorem 4.1 Assume that the sequence ${F n}$ satisfies the constraint $∑ i = 0 m ν n i x n i ≤ F n ≤ ∑ i = 0 m μ n i x n i$ . Then the following properties hold.

(i)
Assume that $M n ≤ e A G n$ ; $∀ n ∈ N 0$ . Any solution sequence of (4.1) is uniformly bounded for any bounded set of initial conditions $x i ≥ 0$ ; $i = 1 − p, 2 − p, …, 0$ , if for any $n ∈ N 0$ , one of the following constraints holds:
$(∑ j = n − k + 1 n ν j 0 ≥ 1) ∧ (ν j i ≥ 0; ∀ j ∈ N 0, ∀ i ∈ m ¯) ∧ (θ n ∈ [0, max (1 (1 − M n e − A G n) ν n 1, 1)])$
(4.2)

and, furthermore, either $θ n < 1 (1 − M n e − A G n) ν n 1$ or $∑ j = n − k + 1 n ν j 0 > 1$ , or at least one inequality $ν j i ≥ 0$ is strict for each pair of integers $j ∈ [n − k + 1, n)$ , $i ∈ m ¯$ , or at least one $ν n i$ is positive for $i ∈ m ¯$ . If, furthermore, there is only an equilibrium point, then the solution sequence converges to such a point.

(ii)
Assume that $M n > e A G n$ ; $∀ n ∈ N 0$ . Any solution sequence of (4.1) is uniformly bounded for any bounded set of initial conditions $x i ≥ 0$ ; $i = 1 − p, 2 − p, …, 0$ , if for any $n ∈ N 0$ , one of the following constraints holds:
$(∑ j = n − k + 1 n μ j 0 ≤ 1) ∧ (μ j i ≤ 0; ∀ j ∈ N 0 +, ∀ i ∈ m ¯) ∧ ((θ n ∈ [0, max (1 (1 − M n e − A G n) | μ n 1 |, 1)]))$
(4.3)

and, furthermore, either $θ n < 1 (M n e − A G n − 1) | μ n 1 |$ or $∑ j = n − k + 1 n μ j 0 < 1$ , or at least one inequality $ν j i ≥ 0$ is strict for each pair of integers $j ∈ [n − k + 1, n)$ , $i ∈ m ¯$ , or at least one $μ n i$ is negative for $i = 2, 3, …, m$ . If, furthermore, there is only an equilibrium point, then the solution sequence converges to such a point.

(iii)
Assume that the sequence ${1 − M n e − A G n}$ is neither nonnegative nor nonpositive. Then, any solution sequence of (4.1) is uniformly bounded for any bounded set of initial conditions $x i ≥ 0$ ; $i = 1 − p, 2 − p, …, 0$ , if (4.2) holds for any $n ∈ N 0 +$ such that $M n < e A G n$ and (4.3) holds for any $n ∈ N 0$ such that $M n > e A G n$ . If, furthermore, there is only an equilibrium point, then the solution sequence converges to such a point.

Proof Since $V n = V n (x$