Research

# Unconditional convergence of difference equations

Daniel Franco and Juan Peran*

Author Affiliations

Departamento de Matemática Aplicada, Universidad Nacional de Educación a Distancia (UNED), C/ Juan del Rosal 12, Madrid, 28040, Spain

For all author emails, please log on.

Boundary Value Problems 2013, 2013:63  doi:10.1186/1687-2770-2013-63

 Received: 19 December 2012 Accepted: 20 March 2013 Published: 28 March 2013

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

### Abstract

We put forward the notion of unconditional convergence to an equilibrium of a difference equation. Roughly speaking, it means that can be constructed a wide family of higher order difference equations, which inherit the asymptotic behavior of the original difference equation. We present a sufficient condition for guaranteeing that a second-order difference equation possesses an unconditional stable attractor. Finally, we show how our results can be applied to two families of difference equations recently considered in the literature.

MSC: 39A11.

##### Keywords:
difference equations; global asymptotic stability

### 1 Introduction

It is somewhat frequent that the global asymptotic stability of a family of difference equations can be extended to some higher-order ones (see, for example, [1-4]). Consider the following simple example. If φ is the map φ ( x , y ) = 1 + ( a x / y ) , the sequence y n defined by y n = φ ( x , y n 1 ) , that is,

y n = 1 + a x y n 1 ,

with y 1 , a , x > 0 , converges to F φ ( x ) = ( 1 + 1 + 4 a x ) / 2 for any y 1 . Observe that F φ is the function satisfying φ ( x , F φ ( x ) ) = F φ ( x ) . Obviously, the second-order difference equation

y n = 1 + a x y n 2 ,

also converges to F φ ( x ) for any y 1 , y 2 , a , x > 0 . Let us continue to add complexity, by considering the second-order difference equations

(1)

(2)

For all y 1 , y 2 , a > 0 , the sequence defined by Equation (1) converges to the unique fixed point μ φ = a + 1 of the function F φ . However, the behavior of Equation (2) depends on the parameter a:

• For a 1 , the odd and even index terms converge respectively to some limits, μ 1 [ 1 , + ] and μ 1 / ( μ 1 1 ) [ 1 , + ] , where μ 1 may depend on y 1 , y 2 (for a = 1 ).

• For 0 < a < 1 , it converges to μ φ = a + 1 , whatever the choice of y 1 , y 2 > 0 one makes.

No sophisticated tools are needed to reach those conclusions: It suffices to note that the set

A = { n : ( y n + 3 y n + 1 ) ( y n + 2 y n ) 0 }

must be either finite or equal to ℕ. As the sequences y 2 n + 1 and y 2 n are then both eventually monotone, they converge in [ 1 , + ] to some limits, say μ 1 and μ 2 , satisfying

μ 1 = 1 + a μ 1 μ 2 and μ 2 = 1 + a μ 2 μ 1 .

Therefore, one of the following statements holds: μ 2 = μ 1 / ( μ 1 1 ) [ 1 , + ] , with a = 1 , or { μ 1 } { μ 2 } { { 1 , + } , { 1 + a } } .

If { μ 1 } { μ 2 } = { 1 , + } , then that of the sequences, y 2 n + 1 or y 2 n , which converges to +∞, has to be nondecreasing. Just look at Equation (2) to conclude that a 1 whenever { μ 1 } { μ 2 } = { 1 , + } .

The case we are interested in is 0 < a < 1 and we will say that μ φ = 1 + a is an unconditional attractor for the map φ, that is, we would consider φ ( x , y ) = 1 + ( a x / y ) with 0 < a < 1 to observe that, not only (1) and (2), but all the following recursive sequences converge to μ φ = 1 + a , whatever the choice of y 1 , , y max { k , m } > 0 we make:

In this paper, we proceed as follows. The next section is dedicated to notation and a technical result of independent interest. In Section 3, we introduce the main definition and the main result in this paper, unconditional convergence and a sufficient condition for having it in a general framework. We conclude, in Section 4, showing how the later theorem can be applied to provide short proofs for some recent convergence results on two families of difference equations and to improve them.

### 2 Preliminaries

This section is mainly devoted to the notation we employ. In the first part, we establish some operations between subsets of real numbers and we clarify how we identify a function with a multifunction. We noticed that set-valued difference equations are not concerned with us in this paper. The reason for dealing with those set operations and notation is because it allows us to manage unboundedness and singular situations in a homogeneous way. In the second part, we introduce the families of maps Λ m k (a kind of averages of their variables) that we shall employ in the definition of unconditional convergence. We finish the section with a technical result on monotone sequences converging to the fixed point of a monotone continuous function.

#### 2.1 Basic notations

We consider the two points compactification R ¯ = [ , + ] of ℝ endowed with the usual order and compact topology.

#### 2.1.1 Operations and preorder in 2 R ¯ ∖ { ∅ }

We define the operations ‘+’, ‘−’, ‘⋅’ and ‘/’ in 2 R ¯ { } by

A B = { lim sup ( a n b n ) : a n , b n , a n b n R  for all  n N  and  lim a n A , lim b n B } ,

where ∗ stands for ‘+’, ‘−’, ‘⋅’ or ‘/’. We also agree to write A = A = .

Remark 1 We introduce the above notation in order to manage unboundedness and singular situations, but we point out that these are natural set-valued extensions for the arithmetic operations. Let X, Y be compact (Hausdorff) spaces, U a dense subset of X and f : U Y . The closure Gr ( f ) ¯ of the graph of f in X × Y defines an upper semicontinuous compact-valued map f ¯ : X 2 Y by f ¯ ( x ) = { y Y : ( x , y ) Gr ( f ) ¯ } , that is, by Gr ( f ¯ ) = Gr ( f ) ¯ (see [5]). Furthermore, as usual, one writes f ¯ ( A ) = x A f ¯ ( x ) for A 2 X , thereby obtaining a map f ¯ : 2 X 2 Y .

To extend arithmetic operations, consider X = R ¯ × R ¯ , Y = R ¯ and U = R × R , when f denotes addition, substraction or multiplication, and U = R × ( R { 0 } ) , when f denotes division.

Also define A B (respectively A < B ) to be true if and only if A , B and a b (respectively a < b ) for all a A , b B . Here A , B 2 R ¯ .

Notice that both relations ≤ and < are transitive but neither reflexive nor symmetric.

#### 2.1.2 Canonical injections

When no confusion is likely to arise, we identify a R ¯ with { a } 2 R ¯ , that is, in the sequel we consider the fixed injection a { a } of R ¯ into 2 R ¯ and we identify R ¯ with its image. We must point out that, under this convention, when a is expected to be subset of A, we understand ‘ a A ’ as ‘there is b A with a = { b } ’. For instance, one has 0 ( + ) = R ¯ , 1 / 0 = { , + } .

#### 2.1.3 Extension of a function as a multifunction

Consider a map h : R ¯ m 2 R ¯ and denote by D ( h ) the set formed by those x R ¯ m for which there is b R ¯ with h ( x ) = { b } .

If A 2 ( R ¯ m ) , then h ( A ) 2 R ¯ is defined to be a A h ( a ) . Also, if B ( 2 R ¯ ) m , then h ( B ) 2 R ¯ is defined to be h ( B ) = h ( B 1 × × B m ) .

For each function φ : U R ¯ m R ¯ , let φ ˆ : R ¯ m 2 R ¯ be defined by

φ ˆ ( x ) = { lim sup φ ( x n ) : x n U  for all  n N  and  lim x n = x } .

It is obvious that φ ˆ ( x ) if and only if x is in the closure U ¯ of U in R ¯ m . Also notice that

U D ( φ ˆ ) U ¯

when φ is continuous. In this case, and if no confusion is likely to arise, we agree to denote also by φ the map φ ˆ . For example, we write

φ ( 0 ) = [ 1 , 1 ] ; φ ( ) = φ ( + ) = 0 ; D ( φ ) = R ¯ { 0 }

when U = R { 0 } and φ ( x ) = sin ( 1 / x ) .

#### 2.2 The maps in Λ m k and Λ k

As we have announced, the unconditional convergence of a difference equation guarantees that there exists a family of difference equations that inherit its asymptotic behavior. Here, we define the set of functions that we employ to construct that family of difference equations.

For k , m N , let Λ m k be the set formed by the maps λ : R ¯ m R ¯ k such that

min 1 j m x j λ i ( x ) max 1 j m x j for all  x R ¯ m , 1 i k . (3)

Notice that λ γ Λ m k whenever λ Λ r k , γ Λ m r . Let Λ k be defined as follows:

Λ k = m N Λ m k .

We note that the functions in Λ k satisfy that their behavior is enveloped by the maximum and minimum functions of its variables, which is a common hypothesis in studying higher order nonlinear difference equations.

Some trivial examples of functions in Λ 1 are:

λ ( x 1 , , x m ) = j = 1 m α j x j , with α j 0 for j = 1 , , m , j = 1 m α j = 1 .

An important particular case is α j 0 = 1 , α j = 0 for j j 0 .

λ ( x 1 , , x m ) = { j = 1 m x j α j if  min 1 j m x j > 0 , min 1 j m x j if  min 1 j m x j 0 , with α j 0 for j = 1 , , m , j = 1 m α j = 1 .

We refer to this function simply as λ ( x 1 , , x m ) = j = 1 m x j α j , when it is assumed that λ Λ 1 .

λ ( x 1 , , x m ) = max j J x j , where J is a nonempty subset of { 1 , , m } .

λ ( x 1 , , x m ) = min j J x j , where J is a nonempty subset of { 1 , , m } .

#### 2.3 A technical result

Assume a < b + , in the rest of this section. Recall that a continuous non-increasing function F : [ a , b ] [ a , b ] has a unique fixed point μ [ a , b ] , that is, { μ } = Fix ( F ) .

Lemma 1Let F : [ a , b ] [ a , b ] be a continuous non-increasing function, { μ } = Fix ( F ) and ϵ > 0 . Define F ( x ) = F ( a ) for x < a , F ( x ) = F ( b ) for x > b and

a 0 = a ; b 0 = F ( a 0 ) ; a k = F ( b k 1 + ϵ k ) ; b k = F ( a k ϵ k )

for k 1 .

Then ( a k ) and ( b k ) are, respectively, a nondecreasing and a nonincreasing sequence in [ a , b ] . Furthermore, a k μ b k for allkand { lim a k , μ , lim b k } Fix ( F F ) .

Proof Since the map F is nonincreasing and taking into account the hypothesis a 0 a 1 , we see that ( a k ) is a nondecreasing sequence. Assume a k 1 a k and a k > a k + 1 to reach a contradiction

a k > a k + 1 F ( b k 1 + ϵ k ) > F ( b k + ϵ k + 1 ) b k 1 + ϵ k < b k + ϵ k + 1 b k 1 < b k F ( a k 1 ϵ k 1 ) < F ( a k ϵ k ) a k 1 ϵ k 1 > a k ϵ k a k 1 > a k .

Therefore, ( a k ) is a nondecreasing sequence, so by definition, ( b k ) is nonincreasing.

On the other hand, as b 0 = F ( a 0 ) F ( μ ) = μ a 0 , we see by induction that a k μ b k for all k,

a k = F ( b k 1 + ϵ k ) F ( μ ) = μ = F ( μ ) F ( a k ϵ k ) = b k for  k 1 .

Because of the continuity of F, we conclude that

lim a k = F ( lim b k ) = F ( F ( lim a k ) )

and

lim b k = F ( lim a k ) = F ( F ( lim b k ) ) .

□

Remark 2 Suppose F not to be identically equal to +∞ and let x [ a , μ ) . The map

ϵ F ( F ( x ) + ϵ ) ϵ

is decreasing in the set

{ ϵ 0 : F ( F ( x ) + ϵ ) < + } .

Unless F ( x ) = b < + , the map F verifies F ( F ( x ) ) > x if and only if there exists ϵ 0 > 0 such that F ( F ( x ) + ϵ ) ϵ > x for all ϵ [ 0 , ϵ 0 ) .

Therefore, if F ( F ( a ) ) > a , there exists ϵ > 0 such that F ( F ( a ) + ϵ ) ϵ a and taking a = a 0

a F ( F ( a ) + ϵ ) ϵ = a 1 ϵ a k ϵ k μ b k 1 + ϵ k b 0 + ϵ = F ( a ) + ϵ b .

As a consequence, ( a k ) , ( b k ) are well defined, without the need of extending F.

### 3 Unconditional convergence to a point

For a map h : R ¯ k 2 R ¯ , the difference equation

y n = h ( y n 1 , , y n k ) (4)

is always well defined whatever the initial points y 1 , , y k R ¯ are, even though the y n are subsets of R ¯ , rather than points.

A point μ R ¯ is said to be an equilibrium for the map h if h ( μ , , μ ) = { μ } . The equilibrium μ is said to be stable if, for each neighborhood V of μ in R ¯ , there is a neighborhood W of ( μ , , μ ) in D ( h ) such that y n V for all n, whenever ( y 1 , , y k ) W .

The equilibrium μ is said to be an attractor in a neighborhood V of μ in R ¯ , if y n R ¯ for all n and y n μ in R ¯ , whenever y n V for n k .

Definition 1 The point μ is said to be an unconditional equilibrium of h (respectively, unconditional stable equilibrium, unconditional attractor inV) if it is an equilibrium (respectively, stable equilibrium, attractor in V) of h λ for all λ Λ k .

Definition 2 We define the equilibria, stable equilibria, attractors, unconditional equilibria, unconditional stable equilibria and unconditional attractors of a continuous function φ : U R ¯ k R ¯ to be those of φ ˆ .

#### 3.1 Sufficient condition for unconditional convergence

After giving Definitions 1 and 2 we are going to prove a result guaranteeing that a general second order difference equation as in (4) has an unconditional stable attractor.

Let < c a < b d + and consider in the sequel a continuous function φ : ( a , b ) × ( c , d ) ( c , d ) , satisfying the following conditions:

(H1) φ ( x 1 , y ) < φ ( x 2 , y ) , whenever a < x 2 < x 1 < b and c < y < d .

(H2) There exists F φ : [ a , b ] [ a , b ] such that

F φ ( x ) y φ ( x , y ) y 1

whenever y ( c , d ) { F φ ( x ) } .

The functions φ ( , y ) : [ a , b ] [ c , d ] and φ ( x , ) : ( c , d ) ( c , d ) are defined in the obvious way. Notice that φ ( a , ) is the limit of a monotone increasing sequence of continuous functions, thus it is lower-semicontinuous, likewise φ ( b , ) is an upper-semicontinuous function. Remember that we denote both φ and φ ˆ by φ.

The next lemma, which we prove at the end of this section, shows that if (H1) and (H2) holds we can get some information about the behavior and properties of φ and F φ .

Lemma 2Let φ : ( a , b ) × ( c , d ) ( c , d ) , where < c a < b d + , be a continuous function satisfying (H1) and (H2). Then the function F φ in (H2) is unique and it is a continuous nonincreasing map, thus it has a unique fixed point μ φ . Furthermore,

(i) a < φ ( x , y ) < b for all x , y ( a , b ) and a φ ( x , y ) b for all x , y [ a , b ] .

(ii) If x [ a , b ] , y ( c , d ) and φ ( x , y ) = y , then y = F φ ( x ) .

(iii) φ ( x , F φ ( x ) ) = F φ ( x ) for all x [ a , b ] .

(iv) F φ is decreasing in F φ 1 ( ( a , b ) ) .

We are in conditions of presenting and proving our main result.

Theorem 1Let φ : ( a , b ) × ( c , d ) ( c , d ) , where < c a < b d + , be a continuous function satisfying (H1) and (H2). If μ φ ( a , b ) and Fix ( F φ F φ ) = Fix ( F φ ) , then μ φ is an unconditional stable attractor ofφin ( a , b ) .

Proof of Theorem 1 Consider λ Λ m 2 and denote

y n = φ λ ( y n 1 , , y n m )

for some y 1 , , y m ( a , b ) . Notice that y n ( a , b ) for all n, as a consequence of (i) in Lemma 2.

We are going to prove first that μ φ is a stable equilibrium of φ λ . By (iii) in Lemma 2, as

λ ( μ φ , , μ φ ) = ( μ φ , μ φ ) ,

we see that μ φ is an equilibrium.

Let ϵ ( 0 , min { μ φ a , b μ φ } ) . Because of the continuity of F φ , there is a ( μ φ ϵ , μ φ ) such that

b F φ ( a ) ( μ φ , μ φ + ϵ ) .

As Fix ( F φ F φ ) = Fix ( F φ ) and F φ ( F φ ( a ) ) a , we have

F φ ( F φ ( x ) ) > x for all  x [ a , μ φ ) .

If x [ a , b ] , then

F φ ( x ) F φ ( a ) = b

and

F φ ( x ) F φ ( b ) = F φ ( F φ ( a ) ) > a .

Therefore, F φ ( [ a , b ] ) [ a , b ] .

By replacing a, b by a , b in Lemma 2(i), we see that

y n ( a , b ) ( μ φ ϵ , μ φ + ϵ ) for all  n ,

whenever y n ( a , b ) for n m , thus μ φ is an unconditional stable equilibrium of φ.

Now, if we see that

lim F φ ( y n ) = μ φ ,

we are done with the whole proof. Indeed, for each accumulation point y ¯ of ( y n ) , one would have

F φ ( μ φ ) = μ φ = F φ ( y ¯ ) ,

because of the continuity of F φ . As μ φ ( a , b ) , this implies y ¯ = μ φ .

Therefore, as a consequence of Lemma 1, it suffices to find an increasing sequence n k of natural numbers such that

a k F φ ( y n ) b k for all  k 0 , n n k .

Here, a k and b k are defined as in Lemma 1, with a 0 = a and ϵ = 1 ,

b 0 = F φ ( a ) ; a k = F φ ( b k 1 + 1 k ) ; b k = F φ ( a k 1 k ) for  k 1 .

Let n 0 = m , so that

a 0 F φ ( y n ) F φ ( a ) = b 0 for  n n 0 .

Having in mind that λ Λ m 2 satisfies (3), we find n k from n k 1 as follows. Denote

z k = F φ 1 ( b k 1 )

and momentarily assume n > n k 1 + m and b k 1 < y n in such a way that

b k 1 < y n = φ ( λ 1 ( y n 1 , , y n m ) , λ 2 ( y n 1 , , y n m ) ) φ ( min { y n 1 , , y n m } , λ 2 ( y n 1 , , y n m ) ) φ ( z k , λ 2 ( y n 1 , , y n m ) ) ,

which implies

φ ( z k , λ 2 ( y n 1 , , y n m ) ) λ 2 ( y n 1 , , y n m )

and then

y n max { b k 1 , λ 2 ( y n 1 , , y n m ) } max { b k 1 , y n 1 , , y n m } w n

for all n > n k 1 + m .

As a consequence, the nonincreasing sequence w n is bounded below by b k 1 . It cannot be the case that lim w n > b k 1 , because in such a case there is a subsequence y n j > b k 1 converging to lim w n and such that λ 2 ( y n j 1 , , y n j m ) converges to a point w lim w n .

Since

y n j φ ( z k , λ 2 ( y n j 1 , , y n j m ) ) w n j ,

one has

φ ( z k , w ) = lim w n > b k 1 = F ( z k )

and then

φ ( z k , w ) w > F ( z k ) w .

By applying (H2), we see that

lim w n = φ ( z k , w ) < w ,

Therefore, lim w n = b k 1 and there exists m k n k 1 such that

y n < b k 1 + 1 k for all  n m k ,

that is,

F φ ( y n ) a k for all  n m k .

Analogously, we see that there exists n k m k such that

F φ ( y n ) b k for all  n n k .

□

Proof of Lemma 2

• Uniqueness of F φ : Let y 1 < y 2 and x in [ a , b ] such that

y i y φ ( x , y ) y 1 > 0 for  i = 1 , 2 , y ( y 1 , y 2 ) .

Then

0 < φ ( x , y ) y < 0 ,

• (i): It suffices to prove the first assertion, because [ a , b ] is a closed set and, by definition,

φ ( x , y ) = { lim sup φ ( x n , y n ) : x n x , y n y , x n ( a , b ) , y n ( c , d ) }

for all ( x , y ) [ a , b ] × [ c , d ] . Assume now that ( x , y ) ( a , b ) × ( a , b ) . We consider the following three possible situations. If φ ( x , y ) = y , it is obvious that φ ( x , y ) ( a , b ) .On the other hand, if φ ( x , y ) > y and x ( a , x ) , then

a y < φ ( x , y ) < φ ( x , y ) F φ ( x ) b .
Finally, if φ ( x , y ) < y and x ( x , b ) , then

b y > φ ( x , y ) > φ ( x , y ) F φ ( x ) a .

• (ii): Suppose y F φ ( x ) . Since φ ( x , y ) = y R ¯ , then φ ( x , y ) y = 0 or φ ( x , y ) y = R ¯ . In any event, it cannot be the case that

F φ ( x ) y φ ( x , y ) y 1 ,

which contradicts hypothesis (H2), thus y = F φ ( x ) .

• (iii): Since F φ ( [ a , b ] ) [ a , b ] [ c , d ] , it is worth considering the following three cases for each x [ a , b ] : first, x ( a , b ) , F φ ( x ) ( c , d ) and then (after probing continuity, monotonicity and statement (iv)), we proceed with the case x { a , b } , F φ ( x ) ( c , d ) and finally with x [ a , b ] , F φ ( x ) { c , d } .Case x ( a , b ) and F φ ( x ) ( c , d ) : Since φ ( x , y ) > y when y < F φ ( x ) and φ ( x , y ) < y when y > F φ ( x ) , we see that

φ ( x , F φ ( x ) ) = F φ ( x ) ,

because of the continuity of φ ( x , ) .

• Monotonicity and (iv): Suppose

F φ ( x 1 ) F φ ( x 2 ) for  a x 1 < x 2 b .
If y [ F φ ( x 1 ) , F φ ( x 2 ) ] , then y = a , y = b or y φ ( x 2 , y ) < φ ( x 1 , y ) y , thus

[ F φ ( x 1 ) , F φ ( x 2 ) ] { a , b } .

• Continuity: If x [ a , b ] and

w I = ( lim inf z x F φ ( z ) , lim sup y x F φ ( y ) ) ,

then there exist two sequences y n , z n x with

F φ ( z n ) < w < F φ ( y n ) .

Thus,

φ ( z n , w ) < w < φ ( y n , w )

and, by (ii), one has φ ( x , w ) = w . Since w ( c , d ) , this would imply F φ ( x ) = w for all w I , which is impossible.

• (iii) Case x { a , b } and F φ ( x ) ( c , d ) : Since

F φ ( t ) φ ( t , F φ ( a ) ) F φ ( a ) for all  t ( a , b ) ,

and because of the continuity of F φ , we have

F φ ( a ) = sup t F φ ( t ) sup t φ ( t , F φ ( a ) ) F φ ( a ) ,

but

sup t φ ( t , F φ ( a ) ) = φ ( a , F φ ( a ) ) .
Analogously, it can be seen that φ ( b , F φ ( b ) ) = F φ ( b ) .

• (iii) Case F φ ( x ) { c , d } : First assume F φ ( x ) = c and recall that, by definition,

φ ( x , c ) = { lim sup φ ( x n , y n ) : x n x , y n c , x n ( a , b ) , y n ( c , d ) } .

Suppose φ ( x n , y n ) c > c for all n. Then

1 F φ ( x n ) y n φ ( x n , y n ) y n F φ ( x n ) y n c y n ,

which implies F φ ( x n ) c > c , eventually for all n.Since F φ ( x n ) c , we reach a contradiction. Therefore,

φ ( x , F φ ( x ) ) = { c } = { F φ ( x ) } .
Analogously, we see that φ ( x , F φ ( x ) ) = { d } when F φ ( x ) = d . □

### 4 Examples and applications

#### 4.1 The difference equation y n = A + ( y n − k y n − q ) p with 0 < p < 1

The paper [6] is devoted to prove that every positive solution to the difference equation

y n = A + ( y n k y n q ) p

converges to the equilibrium A + 1 , whenever

A ( 0 , + ) and p ( 0 , min { 1 , ( A + 1 ) / 2 } ) .

Here, k , q { 1 , 2 , 3 , } are fixed numbers.

Although paper [6] complements [7], where the case p = 1 had been considered, it should be noticed that the case p = 1 , A 1 is not dealt with in [6]. Furthermore, we cannot assure the global attractivity in this case.

The results in [6] can be easily obtained by applying Theorem 1 above. Furthermore, we slightly improve the results in [6] by establishing the unconditional stability of the equilibrium A + 1 , whenever A ( 0 , + ) , p ( 0 , min { 1 , ( A + 1 ) / 2 } ) . We may assume without loss of generality that the initial values y 1 , , y m are greater than A. Here, and in the sequel m = max { k , q } .

Let

and

λ ( x 1 , , x m ) = ( x q , x k ) .

Define F φ ( + ) = A , consider for the moment a fixed x [ A , ) and define F φ ( x ) to be the unique positive zero of the function f x given by

f x ( y ) = φ ( x , y ) y .

Notice that f x is concave, f x ( 0 ) = A > 0 , and f x ( + ) = .

Clearly, F φ ( x ) is also the unique zero of the increasing function

j x ( y ) = φ ( x , y ) F φ ( x ) .

Since

j x ( A ) = A p ( F φ ( x ) ) p x p 0 and j x ( + ) = + > 0 ,

we see that condition (H2) holds and μ φ = A + 1 .

As for condition

Fix ( F φ F φ ) = Fix ( F φ ) , (5)

if A x < y < + with

A + ( y x ) p = y ,

then y > A + 1 and

φ ( y , x ) x = A + ( x y ) p x = A + 1 y A y ( y A ) 1 / p .

Since the function

h ( z ) = A + 1 z A z ( z A ) 1 / p

has a unique critical point in ( A , + ) and h ( A + 1 ) = 0 , h ( + ) = A , the necessary and sufficient condition for (5) to hold is that h ( A + 1 ) 0 , that is, p ( A + 1 ) / 2 .

By this reasoning, we also get for free, unconditional stable convergence for several difference equations as, for instance:

y n = A + ( y n q y n r y n s y n t ) p with  0 < p < min { 1 / 2 , ( A + 1 ) / 4 }

or

y n = A + ( y n q + y n r y n s + y n t ) p with  0 < p < min { 1 , ( A + 1 ) / 2 }

just considering respectively

where m = max { q , r , s , t } .

#### 4.2 The difference equation y n = α + β y n − 1 A + B y n − 1 + C y n − 2

Here, α , β , A , B , C , y 0 , y 1 0 . In 2003, three conjectures on the above equation were posed in [8]. In all three cases ( B = 0 , α , β , A , C > 0 ; A = 0 , α , β , B , C > 0 ; and α , β , A , B , C > 0 , respectively) it was postulated the global asymptotic stability of the equilibrium. These conjectures have resulted in several papers since then (see [9-12]). Let us see when there is unconditional convergence.

Consider a = c = 0 , b = c = + , and

φ ( x , y ) = α + β y A + D x

with α , β , A 0 , D > 0 . We solve in y the equation y = α + β y A + D x to obtain

y = α A β + D x ,

so we consider A > β , α > 0 to define

F φ ( x ) = α A β + D x .

A simple calculation shows that (H2) holds, μ φ ( a , b ) and Fix ( F φ F φ ) = Fix ( F φ ) :

Therefore, μ φ is an unconditional stable attractor of φ in ( a , b ) = ( 0 , + ) whenever A > β 0 , D > 0 and α > 0 .

If we choose

λ ( x 1 , x 2 ) = ( B x 1 + C x 2 B + C , x 1 )

and D = B + C , we obtain unconditional stable convergence for the equation

y n = α + β y n 1 A + B y n 1 + C y n 2 ,

whenever A > β 0 , B + C > 0 , C 0 and α > 0 .

Other choices of λ result on the unconditional stable convergence of difference equations such as

y n = α + β y n 1 + γ y n 2 A + B y n 1 + C y n 2

with A > β + γ , B + C > 0 , γ 0 , α > 0 , β 0 , C 0 . Or

y n = α + β max { y n 1 , y n 2 } A + D min { y n 1 , y n 2 }

with A > β 0 , D > 0 , α > 0 .

### Competing interests

The authors declare that they have no significant competing financial, professional, or personal interests that might have influenced the performance or presentation of the work described in this paper.

### Authors’ contributions

Both authors contributed to each part of this work equally and read and approved the final version of the manuscript.

### Acknowledgements

Dedicated to Professor Jean Mawhin on the occasion of his 70th birthday.

We are grateful to the anonymous referees for their helpful comments and suggestions. This research was supported in part by the Spanish Ministry of Science and Innovation and FEDER, grant MTM2010-14837.

### References

1. Agarwal, RP: Difference Equations and Inequalities. Theory, Methods, and Applications, Dekker, New York (2000)

2. El-Morshedy, HA, Gopalsamy, K: Oscillation and asymptotic behaviour of a class of higher-order non-linear difference equations. Ann. Mat. Pura Appl.. 182, 143–159 (2003). Publisher Full Text

3. El-Morshedy, HA, Liz, E: Globally attracting fixed points in higher order discrete population models. J. Math. Biol.. 53, 365–384 (2006). PubMed Abstract | Publisher Full Text

4. Kocić, VL, Ladas, G: Global Behavior of Nonlinear Difference Equations of Higher Order with Applications, Kluwer Academic, Dordrecht (1993)

5. Beer, G: Topologies on Closed and Closed Convex Sets, Kluwer Academic, Dordrecht (1993)

6. Berenhaut, KS, Foley, JD, Stević, S: The global attractivity of the rational difference equation y n = A + ( y n k y n m ) p . Proc. Am. Math. Soc.. 136, 103–110 (2008). Publisher Full Text

7. Berenhaut, KS, Foley, JD, Stević, S: The global attractivity of the rational difference equation y n = 1 + y n k y n m . Proc. Am. Math. Soc.. 135, 1133–1140 (2007). Publisher Full Text

8. Kulenović, MRS, Ladas, G, Martins, LF, Rodrigues, IW: The dynamics of x n + 1 = α + β x n A + B x n + C x n 1 : facts and conjectures. Comput. Math. Appl.. 45, 1087–1099 (2003). Publisher Full Text

9. Merino, O: Global attractivity of the equilibrium of a difference equation: an elementary proof assisted by computer algebra system. J. Differ. Equ. Appl.. 17, 33–41 (2011). Publisher Full Text

10. Su, Y-H, Li, W-T, Stević, S: Dynamics of a higher order nonlinear rational difference equation. J. Differ. Equ. Appl.. 11, 133–150 (2005). Publisher Full Text

11. Su, Y-H, Li, W-T: Global asymptotic stability of a second-order nonlinear difference equation. Appl. Math. Comput.. 168, 981–989 (2005). Publisher Full Text

12. Su, Y-H, Li, W-T: Global attractivity of a higher order nonlinear difference equation. J. Differ. Equ. Appl.. 11, 947–958 (2005). Publisher Full Text