- Research
- Open Access
- Published:

# On stability of delay difference equations with variable coefficients: successive products tests

*Advances in Difference Equations*
**volume 2012**, Article number: 177 (2012)

## Abstract

In this paper, we report an error in the paper of the first author in *Advances in Difference Equations*, 2009, article 104310, present the revised versions of the theorem with several examples, and outline the cases when the previous result is valid.

## 1 Introduction

The purpose of this short note is to indicate an error in the previous paper [1] published in ‘Advances in Difference Equations’ and an inaccuracy in the recent paper [2]; to present a corrected result for [1] and clarification for [2]; and to outline the cases when the analogue of the result of [1] is still correct.

Consider the equation

where \{{a}_{\ell}(n)\} are sequences of real numbers, and \{{h}_{\ell}(n)\} are sequences of integers such that there exists a nonnegative integer *τ* satisfying n-\tau \le {h}_{\ell}(n)\le n for all n\ge {n}_{0} and \ell =1,2,\dots ,m.

**Theorem A** *Suppose that* n-{h}_{\ell}(n)<d *for some* d\in \mathbb{N}, \ell =1,2,\dots ,m, *and there exists* r\in \mathbb{N} *such that*

*Then* (1) *is exponentially stable*.

**Example 1** (Counterexample to Theorem A)

Consider the delay difference equation

where

for some p,q\in \mathbb{R}. Simple computation gives us that the solution of (3) is

which is stable if and only if |q|<1. More precisely, we have {lim}_{n\to \mathrm{\infty}}|x(n)|=\mathrm{\infty} for any |q|>1 provided that x(0)\ne 0. If we compute (2) with r=1 for (3), we get

showing that the assumption of Theorem A is fulfilled if |pq|<1. However, we can find p,q\in \mathbb{R} such that |q|\ge 1 and |pq|<1, for instance, p=1/2 and q=6/5. In this case, the right-hand side in (6) is 3/5<1, but by (5) x(2l)={1.2}^{l}x(0), x(2l+1)=0.5\cdot {1.2}^{l}, which is a divergent sequence, the solution is unstable.

Hence, in general, Theorem A is incorrect.

Let us note that in [2] and further in this paper, we apply the idea of reduction of higher (but bounded) order equations to first-order matrix equations. This method was widely used in [3–5] and in the earlier paper [6].

Also, in the discussion section of [2], the inequality

is considered as a sufficient asymptotic stability condition for the trivial solution of the first-order matrix equation

Here {A}_{n} are d\times d matrices, \rho (A) is the spectral radius of the matrix *A*, \lambda \in (0,1), {n}_{0}\in \mathbb{N}, and k(n)\ge n is a certain number which exists for any n\ge {n}_{0}. Similarly, the condition

is treated as a sufficient exponential stability condition for the trivial solution. This is not true, as the example from [[7], Example 4.17, pp.190-191] illustrates (here k=1, k(n)=n); see also the recent review [8] and Example 2 below.

**Example 2** Equation (8), with

satisfies \rho ({A}_{n})=0.6\sqrt{2}<1 since both {A}_{2m} and {A}_{2m+1} have eigenvalues \pm 0.6\sqrt{2}. However, if we assume {X}_{0}={(0,1)}^{T}, then simple calculations lead to {X}_{2m}={(0,{1.44}^{m})}^{T}, thus the system is unstable.

On the other hand, if we use in Example 2 the norm

where \parallel \cdot \parallel is the Euclidean vector norm, instead of the spectral radius, then \parallel {A}_{mn}\parallel =\parallel {A}_{2m+1}\parallel =1.2>1 since \parallel {A}_{2m}{(0,1)}^{T}\parallel =\parallel {A}_{2m+1}{(1,0)}^{T}\parallel =1.2, where {B}^{T} is the transpose of *B*.

We will use the following result in the recovery of Theorem A, which was obtained in [9]; see also [10, 11].

**Theorem B** ([[9], Theorem 2])

*Let* m\in \mathbb{N} *and* f:\mathbb{Z}\times {\mathbb{R}}^{m}\to \mathbb{R}. *If there exists* \lambda \in (0,1) *such that*

*then*

*is globally exponentially stable*. *More precisely*, *any solution satisfies*

## 2 Main results

For k\in \mathbb{N}, define a sequence

for n\ge {n}_{0}+k(\tau +1).

**Theorem 1** (Correction of Theorem A)

*Suppose that there exists*
r\in \mathbb{N}
*such that*

*Then* (1) *is exponentially stable*.

*Proof* Let us prove for all k\in \mathbb{N} that

We proceed by induction in *k*. From (1), for k=1, we have

for all n\ge {n}_{0}+\tau +1. Thus, the claim is true for k=1. Assume now that the claim is true for some k\ge 1. From (12) and (13), for all n\ge {n}_{0}+(k+1)(\tau +1), we have

which shows that (12) is true when *k* is replaced with (k+1). Using (12) with k=r, we see that the solution is exponentially stable by Theorem B. □

Theorem 1 with r=1 immediately yields the following result.

**Corollary 1**
*Assume that*

*Then* (1) *is exponentially stable*.

**Remark 1** The claim of Theorem A for r=0 is correct.

Setting r=2 in Theorem 1, we obtain the following corollary, which is also proved in [[1], Theorem 2.17].

**Corollary 2**
*Assume that*

*Then* (1) *is exponentially stable*.

**Remark 2** Theorem A for the nondelay equation

is correct. Indeed, Theorem 1 reduces to Theorem A since for k\ge 1, we get

Setting r=3 in Theorem 1 gives us the following corollary.

**Corollary 3**
*Assume that*

*Then* (1) *is exponentially stable*.

**Example 3** Consider the delay difference equation (3) with (4), where p,q\in \mathbb{R}, which can be written in the two equivalent forms:

and

where

Computing \{{b}_{k}(n)\} defined by (11), we see that

Equation (3) is exponentially stable by Theorem 1 if |q|<1 because there always exists r\in \mathbb{N} such that |p{q}^{r-1}|<1 and |{q}^{r}|<1. From (5), we see that |q|<1 is the best possible condition for the global exponential stability of (3) with (4).

Application of a recent result [[12], Theorem 6] to (14) gives us (1+|p|)|q|<1, which implies |q|<1.

The so-called ‘3/2-test’ (see [13] and [[1], Theorem A]) can be applied to (15) if p>-1 and q>0, and ensures global exponential stability when

for which 0<q<3/4 is necessary.

It is obvious that these two results and Corollary 1 cannot deliver any answer for the exponential stability when p=1 and q=1/2.

As mentioned in Remark 2, Theorem A is valid for a nondelay scalar equation. Next, any higher-order (of the order not exceeding *d*) equation (1), with n-d<{h}_{\ell}(n)\le n, can be rewritten as the first-order system

where X(n)\in {\mathbb{R}}^{d}, A(n) are d\times d matrices. Indeed, denote X(0)={(x(-d+1),x(-d+2),\dots ,x(0))}^{T}, X(n)={(x(nd-d+1),x(nd-d+2),\dots ,x(nd))}^{T} and rewrite (1) as

where

Then we can define the matrix A(0)={(c(i,j))}_{i=1}^{d} as follows:

and X(1)=A(0)X(0). Similarly, we construct A(n), n\in \mathbb{N} and obtain system (16). Since \parallel X(n)\parallel \ge |x(j)|, j=nd-d+1,nd-d+2,\dots ,nd, exponential (asymptotical) stability of (16) implies the relevant stability of (1). We recall that (16) is exponentially stable if there exist {n}_{0}\in \mathbb{N}, L>0, and \mu \in (0,1) such that \parallel X(n)\parallel \le L{\mu}^{n}\parallel X(0)\parallel, n\ge {n}_{0}.

**Theorem 2** *If there exist* \lambda \in (0,1), M>0, *and* {n}_{0}\in \mathbb{N} *such that* \parallel A(n)\parallel \le M *and* \parallel {\prod}_{j=n}^{n+k-1}A(j)\parallel \le \lambda *for every* n\ge {n}_{0} *and for some positive integer* *k*, *then* (16) *is exponentially stable*.

*Proof* Without loss of generality, we can assume M>1 and {\prod}_{j=0}^{{n}_{0}-1}\parallel A(j)\parallel \le M. Further, for any n\ge {n}_{0} denote m=[\frac{n-{n}_{0}-1}{k}], where [t] is the integer part of *t*, and obtain the estimate

for n\ge {n}_{0}, where L={M}^{k+1}{\lambda}^{-1-{n}_{0}/k}, \mu ={\lambda}^{1/k}. □

**Example 4** (Example 6 in [2])

If in (16)

then both {A}_{2m} and {A}_{2m+1} have the norms exceeding one (they have eigenvalues of 5 and 7, respectively), but the product

has the norm \parallel {A}_{2m}{A}_{2m+1}\parallel =\parallel {A}_{2m+1}{A}_{2m}\parallel =0.7<1, thus (16) is exponentially stable.

**Example 5** Consider (16) with a 4-periodic matrix A(n), where {A}_{4m+j}=\left(\begin{array}{cc}0& -1.1\\ 1.1& 0\end{array}\right), m=0,1,2,\dots , j=1,2,3, {A}_{4m}=\left(\begin{array}{cc}0& -0.7\\ 0.7& 0\end{array}\right). Then \parallel {A}_{4m+j}\parallel =1.1>1, j=1,2,3, but (16) is exponentially stable since {A}_{n+3}{A}_{n+2}{A}_{n+1}{A}_{n}=\left(\begin{array}{cc}0.9317& 0\\ 0& 0.9317\end{array}\right) for any n=0,1,2,\dots , and \lambda =\parallel {A}_{n+3}{A}_{n+2}{A}_{n+1}{A}_{n}\parallel =0.9317<1.

## 3 Discussion

The dynamics of higher-order difference equations with variable coefficients, as well as of non-autonomous systems of difference equations, is much more complicated than that of the relevant autonomous models; see, for example, [8, 14]. For example, the fact that the spectral radius of each matrix is less than one does not imply exponential stability of the system. On the other hand, as demonstrated in Example 5, non-autonomous systems, where some matrices have norms exceeding one, can still be exponentially stable. The challenge is to extend recursive results to other type of stability, for example, asymptotic and {l}^{p} stability; see, for example, [3].

Regarding generalizations to some types of nonlinear models, the analogue of Theorem 1 can be found in [2], while Theorem 2 can be reformulated for the nonlinear first-order system

in the following way, with the same proof repeated.

**Theorem 3** *If there exist* \lambda \in (0,1), k\in \mathbb{N}, M>0, *and* {n}_{0}\in \mathbb{N} *such that* \parallel {F}_{n}(X)\parallel \le M\parallel X\parallel *and* \parallel {F}_{n+k-1}(\cdots {F}_{n+1}({F}_{n}(X))\cdots )\parallel \le \lambda \parallel X\parallel *for any* X\in {\mathbb{R}}^{d} *and* n\ge {n}_{0}, *then* (18) *is uniformly exponentially stable*.

Again, the case of possible asymptotic stability when

and {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}{\lambda}_{n}=1 is still to be considered.

## References

Berezansky L, Braverman E: Exponential stability of difference equations with several delays: recursive approach.

*Adv. Differ. Equ.*2009., 2009: Article ID 104310Braverman E, Karpuz B: On global asymptotic stability of nonlinear higher-order difference equations.

*J. Comput. Appl. Math.*2012, 236: 2803–2812. 10.1016/j.cam.2012.01.015Győri I, Horváth L:A new view of the {l}^{p}-theory for a system of higher order difference equations.

*Comput. Math. Appl.*2010, 59: 2918–2932. 10.1016/j.camwa.2010.02.010Győri I, Horváth L: Asymptotic constancy in linear difference equations: limit formulae and sharp conditions.

*Adv. Differ. Equ.*2010., 2010: Article ID 789302Győri I, Horváth L: Asymptotic behaviour of the solutions of a nonautonomous linear delay difference system.

*Appl. Math. Comput.*2010, 217: 4205–4216. 10.1016/j.amc.2010.09.071Berezansky L, Braverman E: On exponential dichotomy for linear difference equations with bounded and unbounded delay. In

*Differential and Difference Equations and Applications*. Hindawi Publ., New York; 2006:169–178.Elaydi S Undergraduate Texts in Mathematics. In

*An Introduction to Difference Equations*. Springer, New York; 2005.Pötzsche C: Bifurcations in nonautonomous dynamical systems: results and tools in discrete time. 69. In

*Proceedings of the Workshop ‘Future Directions in Difference Equations’*. Edited by: Liz E, Mañosa V. Servizo de Publicacións da Universidade de Vigo, Vigo; 2011:163–212. Vigo (Spain), June 13-17, 2011Liz E, Ferreiro JB: A note on the global stability of generalized difference equations.

*Appl. Math. Lett.*2002, 15: 655–659. 10.1016/S0893-9659(02)00024-1Berezansky L, Braverman E, Liz E: Sufficient conditions for the global stability of nonautonomous higher order difference equations.

*J. Differ. Equ. Appl.*2005, 11: 785–798. 10.1080/10236190500141050Stević S: Behavior of the positive solutions of the generalized Beddington-Holt equation.

*Panam. Math. J.*2000, 10: 77–85.El-Morshedy HA: New explicit global asymptotic stability criteria for higher order difference equations.

*J. Math. Anal. Appl.*2007, 336: 262–276. 10.1016/j.jmaa.2006.12.049Erbe LH, Xia H, Yu JS: Global stability of a linear nonautonomous delay difference equation.

*J. Differ. Equ. Appl.*1995, 1: 151–161. 10.1080/10236199508808016Győri I, Horváth L:{l}^{p}-solutions and stability analysis of difference equations using the Kummer’s test.

*Appl. Math. Comput.*2011, 217: 10129–10145. 10.1016/j.amc.2011.05.008

## Acknowledgements

The authors are grateful to the anonymous reviewer whose valuable comments greatly contributed to the presentation of the paper. EB was partially supported by the NSERC Research grant. This work was partially completed while BK was on one-year leave at the Department of Mathematics and Statistics, University of Calgary, Canada, in the framework of Doctoral Research Scholarship of the Council of Higher Education of Turkey. The authors are also grateful to the University of Calgary who supported this publication.

## Author information

### Authors and Affiliations

### Corresponding author

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

All authors contributed equally to the manuscript and read and approved the final draft.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

## About this article

### Cite this article

Braverman, E., Karpuz, B. On stability of delay difference equations with variable coefficients: successive products tests.
*Adv Differ Equ* **2012**, 177 (2012). https://doi.org/10.1186/1687-1847-2012-177

Received:

Accepted:

Published:

DOI: https://doi.org/10.1186/1687-1847-2012-177

### Keywords

- Difference Equation
- Asymptotic Stability
- Variable Coefficient
- Trivial Solution
- Spectral Radius