/ / Article

Research Article | Open Access

Volume 2011 |Article ID 436852 | https://doi.org/10.1155/2011/436852

Wanping Liu, Xiaofan Yang, Stevo Stević, "On a Class of Nonautonomous Max-Type Difference Equations", Abstract and Applied Analysis, vol. 2011, Article ID 436852, 15 pages, 2011. https://doi.org/10.1155/2011/436852

# On a Class of Nonautonomous Max-Type Difference Equations

Accepted14 Jun 2011
Published18 Aug 2011

#### Abstract

This paper addresses the max-type difference equation , , where , , and is a positive sequence with a finite limit. We prove that every positive solution to the equation converges to under some conditions. Explicit positive solutions to two particular cases are also presented.

#### 1. Introduction

The study of difference equations, which usually depicts the evolution of certain phenomena over the course of time, has a long history. Many experts recently pay some attention to so-called max-type difference equations which stem from certain models in control theory, see, for example,  and the references therein.

The study of the following family of max-type difference equations where such that and are real sequences, was proposed by S. Stevic at numerous conferences, for example, [10, 11]. For some results in this direction, see [1, 2, 4, 1223].

In the beginning of the investigation the following equation was studied: where are real sequences and the initial values are nonzero (see, e.g., [3, 5, 6, 9] and the related references therein).

In , Sun studied the second-order difference equation with , and proved that each positive solution to (1.3) converges to the equilibrium point , by considering several subcases. However, the method used there is a bit complicated and difficult for extending. Hence in  Stevic extended this, as well as the main result in , by presenting a more concise and elegant proof of the next theorem.

Theorem 1.1 (see [14, Theorem ?1]). Every positive solution to the difference equation where are natural numbers such that and , converges to .

Definition 1.2. Let be a function of variables, then the difference equation is called nonautonomous or time variant.

Note that the following nonautonomous difference equation where , and are real sequences (not all constant), is a natural generalization of (1.2), (1.3), and (1.4). It is a special case of (1.1) of particular interest.

The aforementioned works are mainly devoted to the study of (1.6) with constant or periodic numerators.

This paper is devoted to the study of the following nonautonomous max-type difference equation with two delays: where are fixed and is a positive sequence with a finite limit. Inspired by the methods and proofs of the above-mentioned papers, here we try to find some sufficient conditions such that every positive solution to (1.7) converges to .

This paper proceeds as follows. Several useful lemmas are given in Section 2. In Section 3 we establish three main results about the global attractivity of (1.7) under some conditions. Finally motivated by a recent theorem in , explicit solutions to two particular cases of (1.7) are presented in Section 4.

#### 2. Auxiliary Results

To establish the main results in Section 3, here we present several lemmas. First we extend Lemma??2.4 in  by proving the following result.

Lemma 2.1. Consider the nonautonomous difference equation where and are sequences. If s are nonnegative sequences and there always exists such that for each fixed , then

Proof. Suppose that is fixed, and denote by the set of all indices for which the terms in (2.1) are negative.
If , which means all terms in the right-hand side of (2.1) are nonnegative, then apparently which implies
Otherwise, , which means that there exist indices such that the corresponding terms in (2.1) are negative, then we derive
Since must be positive for , it follows from (2.5) that Inequality (2.2) follows easily from (2.4) and (2.6).

The following lemma is widely used in the literature.

Lemma 2.2 (see ). Let be a sequence of nonnegative numbers which satisfies the inequality where and are fixed. Then there exists an such that which implies as if .

Lemma 2.3. Assume that is a sequence of nonnegative numbers satisfying the difference inequality where , and are nonnegative sequences. If there exists at least one positive , then the sequence converges to zero as .

Proof. This lemma follows directly from Lemma 2.2 since where .

Remark 2.4. If in Lemma 2.3, we assume , , then the statement also holds, since in this case, if such a sequence exists, then the solution must be trivial, that is, , (for some results on the existence of nontrivial solutions, see, e.g.,  and the references therein).
Through some simple calculations, we have the following result.

Lemma 2.5. Every positive solution to the first-order difference equation with , has the form

Note that Lemma 2.5 leads to the following corollary.

Corollary 2.6. Each positive solution to the k th-order difference equation where and the initial values are positive, has the following form: where represents the integer part function and .

Remark 2.7. By Corollary 2.6 we have that for any positive solution to (2.13) the following three statements hold true if : (1); (2)if for every , then the subsequences are all strictly increasing;(3)if for every , then the subsequences are all strictly decreasing.

#### 3. Main Results

In this section, we prove the main results of this paper, which concern the global attractivity of positive solutions to (1.7) under some conditions. In the sequel, we assume that there is a finite limit of the positive sequence in (1.7).

Theorem 3.1. Consider (1.7), where is a positive monotone sequence with finite limit . If , then every positive solution to (1.7) converges to .

Proof. By the change , (1.7) is transformed into with . Note that the sequence is also monotone and .
According to the assumption the sequence is nondecreasing or nonincreasing. If is nonincreasing, then for some fixed , there exists a natural number such that for every we have , which implies
On the other hand, if is nondecreasing then obviously for each , hence (3.2) also holds for this case.
Let be fixed. Employing the transformation , (3.1) becomes which implies
Note that for all . From this and by Lemma 2.1 we get When both and are zero, it is clear that is always zero for . Otherwise, it follows from Lemma 2.3 that , which implies Finally, from the above two transformations we get The proof is complete.

Theorem 3.2. Consider (1.7). Let be a positive solution to (2.13) such that (or ), , and denote If , then every positive solution to (1.7) converges to .

Proof. Employing the transformation , (1.7) becomes where and .
Then by the change , (3.9) is transformed into In the sequel, we proceed by considering two cases.
Case 1. Let .
By Remark 2.7, we have . From (3.10) we get for . By the change , (3.11) becomes where
Claim 1. There exists an integer such that for every . Proof. Since , we easily have that Hence On the other hand, for , there exists an such that for each we have , which along with the fact , implies that The claim follows directly from (3.15) and (3.16), as desired.
Next, from Lemma 2.1 and (3.12) it follows that From (3.17) and by Lemma 2.3, we derive . Hence and consequently
Case 2. Let .
By Remark 2.7, we have , and (3.10) is transformed into for all . Then employing the following change
(3.20) is transformed into where . In this case, obviously holds. The rest of the proof is similar to that of Case 1 so is omitted.

To illustrate Theorem 3.2, we present the following example.

Example 3.3. Consider the difference equation where , and .
By Theorem 3.2 and through some calculations, we obtain Hence if , then every positive solution to (3.23) converges to .

Theorem 3.4. Consider (1.7). If is an increasing sequence converging to and , then every positive solution to (1.7) converges to .

Proof. By the change , (1.7) becomes where . The rest of the proof is analogous to that of Theorem 3.1 and thus is omitted.

#### 4. Explicit Solutions

Recently, Stevic and Iricanin in  proved the following theorem.

Theorem 4.1 (see [21, Theorem??2.8]). Consider where . Then every well-defined solution of the equation has the following form: where , and where is equal to one of the initial values .

The result is interesting since (4.2) holds for all real ’s and for all nonzero initial values if one of these exponents is negative. However, (4.2) does not give explicit solutions to (4.1) since ’s and ’s in (4.2) are uncertain. Thus the problem of finding more explicit expressions of solutions to (4.1) is of interest.

In this section we find explicit solutions to the next particular cases of (4.1) with and positive initial values . First we prove a useful lemma.

Lemma 4.2. Let be a positive solution to (4.3) or (4.4). If there exists an such that then for each the following equalities hold:

Proof. We will only consider (4.3), because similar proof can be given to (4.4). The case obviously holds due to (4.5). Next assume that (4.6) holds for for some . Then by (4.3) we derive Thus (4.6) holds for , finishing the inductive proof of the lemma.

Proposition 4.3. Let be a solution to (4.3) with and positive initial values , then for each the following statements hold true. (1)If , then .(2)If , then .(3)If then and (4)If then and

Proof. (1) By the assumption and (4.3) it follows that Then by and (4.3), we have the following equalities: Hence (4.5) is satisfied for . Then by Lemma 4.2 we have that as desired.(2)By similar calculations as in (1), the following equalities hold: Thus (4.5) holds for , and the result follows again by Lemma 4.2.(3)By the assumption and (4.3) it follows that Then from and (4.3), we get Now we will consider two cases and . When , the following equalities hold: On the other hand, the case leads to Hence (4.5) holds for no matter the value of is bigger or less than one. From this the result follows by Lemma 4.2.(4)Through analogous calculations to (3), if then If then Hence (4.5) holds for and any . Hence, the results also follow from Lemma 4.2, finishing the proof of the proposition.

The next proposition can be similarly proved as the proof of Proposition 4.3, hence the proof is omitted here.

Proposition 4.4. Let be a solution to (4.4) with and positive initial values , then for each the following statements hold true. (1)If , then .(2)If , then .(3)If then , and (4)If then , and

Remark 4.5. From the above propositions, we know that any positive solution to (4.3) or (4.4) can be divided into three subsequences which have explicit expressions. If we regard the sequence as a general periodic solution to (4.3), then the solution eventually converges to the general period-three solution .

#### Acknowledgments

This paper is partially supported by the Fundamental Research Funds for the Central Universities (Project no. CDJXS10181130), the New Century Excellent Talent Project of China (no. NCET-05-0759), the National Natural Science Foundation of China (no. 10771227), and the Serbian Ministry of Science (Projects III41025 and III44006).

1. E. M. Elsayed and S. Stević, “On the max-type equation ${x}_{n+1}=\mathrm{max}\left\{A/{x}_{n},{x}_{n-2}\right\}$,” Nonlinear Analysis: Theory, Methods & Applications, vol. 71, no. 3-4, pp. 910–922, 2009.
2. E. M. Elsayed and B. D. Iričanin, “On a max-type and a min-type difference equation,” Applied Mathematics and Computation, vol. 215, no. 2, pp. 608–614, 2009.
3. J. Feuer, “On the eventual periodicity of ${x}_{n+1}=\mathrm{max}\left\{1/{x}_{n},{A}_{n}/{x}_{n-1}\right\}$ with a period-four parameter,” Journal of Difference Equations and Applications, vol. 12, no. 5, pp. 467–486, 2006.
4. B. D. Iričanin and E. M. Elsayed, “On the max-type difference equation ${x}_{n+1}=\mathrm{max}\left\{A/{x}_{n},{x}_{n-3}\right\}$,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 675413, 13 pages, 2010.
5. C. M. Kent, M. Kustesky, A. Q. Nguyen, and B. V. Nguyen, “Eventually periodic solutions of ${x}_{n+1}=\mathrm{max}\left\{{A}_{n}/{x}_{n},{B}_{n}/{x}_{n-1}\right\}$ when the parameters are two cycles,” Dynamics of Continuous, Discrete & Impulsive Systems. Series A, vol. 10, no. 1–3, pp. 33–49, 2003. View at: Google Scholar | Zentralblatt MATH
6. C. M. Kent and M. A. Radin, “On the boundedness nature of positive solutions of the difference equation ${x}_{n+1}=\mathrm{max}\left\{{A}_{n}/{x}_{n},{B}_{n}/{x}_{n-1}\right\}$ with periodic parameters,” Dynamics of Continuous, Discrete & Impulsive Systems. Series B, supplement, pp. 11–15, 2003. View at: Google Scholar
7. W. Liu and X. Yang, “Quantitative bounds for positive solutions of a Stević difference equation,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 235808, 14 pages, 2010.
8. W. Liu, X. Yang, and J. Cao, “On global attractivity of a class of nonautonomous difference equations,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 364083, 13 pages, 2010.
9. I. Szalkai, “On the periodicity of the sequence ${x}_{n+1}=\mathrm{max}\left\{{A}_{0}/{x}_{n},{A}_{1}/{x}_{n-1},\dots ,{A}_{k}/{x}_{n-k}\right\}$,” Journal of Difference Equations and Applications, vol. 5, no. 1, pp. 25–29, 1999.
10. S. Stević, “Boundedness character of a max-type difference equation,” in the Conference in Honour of Allan Peterson, Book of Abstracts, p. 28, Novacella, Italy, July-August 2007. View at: Google Scholar
11. S. Stević, “On behavior of a class of difference equations with maximum,” in the International Conference on Boundary Value Problems: Mathematical Models in Engineering, Biology and Medicine, p. 35, Santiago de Compostela, Spain, September 2008. View at: Google Scholar
12. S. Stević, “On the recursive sequence ${x}_{n+1}=\mathrm{max}\left\{c,{x}_{n}^{p}/{x}_{n-1}^{p}\right\}$,” Applied Mathematics Letters, vol. 21, no. 8, pp. 791–796, 2008.
13. S. Stević, “Global stability of a difference equation with maximum,” Applied Mathematics and Computation, vol. 210, no. 2, pp. 525–529, 2009.
14. S. Stević, “Global stability of a max-type difference equation,” Applied Mathematics and Computation, vol. 216, no. 1, pp. 354–356, 2010.
15. S. Stević, “On a generalized max-type difference equation from automatic control theory,” Nonlinear Analysis: Theory, Methods & Applications, vol. 72, no. 3-4, pp. 1841–1849, 2010.
16. S. Stević, “Boundedness character of a class of difference equations,” Nonlinear Analysis: Theory, Methods & Applications, vol. 70, no. 2, pp. 839–848, 2009.
17. S. Stević, “Boundedness character of a fourth order nonlinear difference equation,” Chaos, Solitons and Fractals, vol. 40, no. 5, pp. 2364–2369, 2009.
18. S. Stević, “Periodicity of max difference equations,” Utilitas Mathematica, vol. 83, pp. 69–71, 2010. View at: Google Scholar
19. S. Stević, “On a nonlinear generalized max-type difference equation,” Journal of Mathematical Analysis and Applications, vol. 376, no. 1, pp. 317–328, 2011.
20. S. Stević, “Periodicity of a class of nonautonomous max-type difference equations,” Applied Mathematics and Computation, vol. 217, no. 23, pp. 9562–9566, 2011. View at: Publisher Site | Google Scholar
21. S. Stević and B. D. Iričanin, “On a max-type difference inequality and its applications,” Discrete Dynamics in Nature and Society, vol. 2010, Article ID 975740, 8 pages, 2010.
22. F. Sun, “On the asymptotic behavior of a difference equation with maximum,” Discrete Dynamics in Nature and Society, vol. 2008, Article ID 243291, 6 pages, 2008.
23. X. Yang, X. Liao, and C. Li, “On a difference equation wtih maximum,” Applied Mathematics and Computation, vol. 181, no. 1, pp. 1–5, 2006. View at: Publisher Site | Google Scholar
24. S. Stević, “Behavior of the positive solutions of the generalized Beddington-Holt equation,” Panamerican Mathematical Journal, vol. 10, no. 4, pp. 77–85, 2000. View at: Google Scholar | Zentralblatt MATH
25. S. Stević, “On positive solutions of a (k + 1)th order difference equation,” Applied Mathematics Letters, vol. 19, no. 5, pp. 427–431, 2006.
26. S. Stević, “Existence of nontrivial solutions of a rational difference equation,” Applied Mathematics Letters, vol. 20, no. 1, pp. 28–31, 2007.
27. S. Stević, “Nontrivial solutions of a higher-order rational difference equation,” Mathematical Notes, vol. 84, no. 5-6, pp. 718–724, 2008. View at: Publisher Site | Google Scholar