Research Article The Behavior of Positive Solutions of a Nonlinear Second-Order Difference Equation

This paper studies the boundedness, global asymptotic stability, and periodicity of positive solutions of the equation xn=f(xn−2)/g(xn−1), n∈ℕ0, where f,g∈C[(0,∞),(0,∞)]. It is shown that if f and g are nondecreasing, then for every solution of the equation the subsequences {x2n} and {x2n−1} are eventually monotone. For the case when f(x)=α


Introduction
Recently there has been great interest in the study of nonlinear and rational difference equations cf.1-35 and the references therein .
In this paper, we study the boundedness, global asymptotic stability, and periodicity for positive solutions of the equation where f, g ∈ C 0, ∞ , 0, ∞ .
Theorem 2.1.Assume that f and g are nondecreasing functions which map the interval 0, ∞ into itself, and assume that {x n } is a solution of 1.1 .Then, the sequences {x 2n } and {x 2n 1 } are eventually monotone.
Proof.Suppose that {x n } is a solution to 1.1 , and set for n ≥ 0. Note that it suffices to show that {r 2i } i≥0 and {r 2i 1 } i≥0 are eventually constant.From 1.1 , we have that If r n−2 1 and r n−1 0, then by 1.1 and the monotonicity of f and g we have that x n /x n−2 ≥ 1, and hence r n 1.Similarly, if r n−2 0 and r n−1 1, then r n 0. Hence, if r n 0 / r n 0 1 for some n 0 ≥ 0, then the sequences {r n 0 2i } i≥0 and {r n 0 2i 1 } i≥0 are both constant, as required.This confirms the statement in the theorem, in this case.Otherwise, {r i } i≥0 itself is a constant sequence and the result again follows.
Remark 2.2.Note that Theorem 2.1 guarantees only the eventually monotonicity of the sequences {x 2n } and {x 2n 1 }.Hence, for a solution {x n } of 1.1 , one of these two subsequences can be infinite.See, for example, 27, Theorem 1 , where it was shown that for the case f x g x x p , p ≥ 1, 1.1 has unbounded solutions.The problem was previously treated in the papers 1, 11 but the proofs appearing there have a gap for more details see 27 .
The first special case of the nonrational 1.1 was considered in the paper 22 , where the second author considered the equation where the function g satisfies the following conditions: ii g x is increasing on 0, ∞ , iii x/g x is increasing on 0, ∞ .
The following two conjectures, which were posed by the second author, have circulated among the experts in the field, since early 2001.
Then for given l, L, α > 0 such that l < L, there exist l 0 and L 0 such that By Lemma 2.5, a result was proven concerning an extension of 2.3 .We present the proof of the theorem for the case of 2.3 , for the benefit of the reader, since the proof is instructive.For related results regarding boundedness, see, for example, 1, 6, 10, 22, 27, 31, 33, 34 .Theorem 2.6.Assume that g is a function which satisfies conditions (ii) and (iii) and that g 0 ≥ 0. Consider 2.3 where α, x −2 , x −1 ∈ 0, ∞ .Then every solution of 2.3 is bounded and persists.
Proof.Choose l and L such that L > max {x −2 , x −1 } and min {x −2 , x −1 } > l > 0. By Lemma 2.5, we may also assume that lg L ≤ α ≤ g l L. Now we may use mathematical induction to prove the result.Assume the statement is true for x −2 , x −1 , x 0 , . . ., x n , that is, 2.4 Then We claim that α L / 1 g l ≤ L. But this is obvious since Similarly, we have that from which it follows that x n ≥ l for n −2, −1, 0, . . ., completing the proof of the theorem.
By Theorems 2.1 and 2.6 we confirm Conjecture 2.4.Indeed, by Theorem 2.6 we have that every solution {x n } of 2.3 is bounded.On the other hand, by Theorem 2.1, the sequences {x 2n } and {x 2n−1 } are eventually monotone, thus convergent.Hence, if 2.3 has periodic solutions they have period one or two, as conjectured.

Global periodicity of 1.1
Definition 3.1.Let g be a function defined on a subset of R n .Say that the difference equation where k ∈ N, is periodic, if every solution of 3.1 is periodic.
In this section, we investigate periodic equations of type 1.1 .In order to facilitate notation we will write 1.1 in the equivalent form If every solution of 3.2 is periodic with period p 2, then it must hold that that is x/f x h y , which implies that f x cx and h y c for some positive constant c.Thus, 3.2 has the form x n c 2 x n−2 .Since every solution of 3.2 must be two periodic, it follows that c 1. Hence, the equation x n x n−2 is a unique equation of type 3.2 for which all solutions are periodic with period two.
Further we consider those equations of type 3.2 for which all solutions are periodic with period three.For a mapping f : X→X the sequence of iterates {f m } m∈N∪{0} of f, is defined by f 0 I I is the identity function on X , f 1 f and generally f m 1 f • f m for any m ∈ N.
Before we prove the result concerning the case, we need the following auxiliary result which is folklore.Lemma 3.2.Assume that f : 0, ∞ → 0, ∞ is a continuous function such that Proof.If f x f y , then from 3.4 it follows that x f 6 x f 6 y y, 3.5 which implies that the function f must be 1 − 1.Since f is a continuous function we have that f must be strictly monotone.First assume that f is strictly increasing.If there is a point x 0 ∈ I such that x 0 < f x 0 , then by the monotonicity of f we have which is a contradiction.
If x 0 > f x 0 , then we have arriving again at a contradiction.From this it follows that f x x for every x ∈ 0, ∞ .Assume now that f is strictly decreasing.Then the function g x f 2 x is strictly increasing and Similar to the first case, we obtain that f 2 x ≡ x, finishing the proof of the lemma.
x, then f is decreasing, maps interval 0, ∞ , "1− 1," and onto itself, and its graph is symmetric with respect to the line y x, since f x f −1 x .
Theorem 3.4.All solutions of 3.2 are periodic with period three if and only if f x c 1 /x and h x c 2 /x, for some positive constants c 1 and c 2 .
Proof.Assume that f x c 1 /x and h x c 2 /x, for some positive constants c 1 and c 2 .Then 3.2 becomes 3.9 It is easy to see that every solution of the equation is periodic with period three see, e.g., 12 .
Assume now that every solution of 3.2 is periodic with period three.Then, we have that u h y f x , x h u f y , y h x f u , 3.10 for every x, y ∈ 0, ∞ .Eliminating u in 3.10 we obtain that x h h y f x f y , y h x f h y f x .

3.11
Now, in each of the two equations 3.11 , we choose that a variable is arbitrary and the other is equal to 1, and use the changes Then, we obtain for every z ∈ 0, ∞ , where C f 1 h 1 .
From 3.13 we have f h z h f z z, 3.14 which implies that f z h −1 z .

3.15
If we set z→ h z in the second identity in 3.13 and z→ f z in the third identity, and then apply 3.14 , we obtain Remark 3.5.It is expected that Theorem 3.4 can be generalized for the case when all solutions of 3.2 are periodic with period more than three.
In the case when all solutions of 3.2 are periodic with period four, the functions f and g must satisfy the following system of functional equations: 3.21 From the system as in the proof of Theorem 3.4, it can be obtained that the functions h and f satisfy the following identities: where C f 1 h 1 .
An obvious solution of the system is h x c 1 and f x c 2 /x, where c 1 , c 2 ∈ 0, ∞ .We leave the problem of finding all solutions of the system as a further direction for investigation for interested readers.
Note.An early draft by the second author of the paper, containing only results in Section 3, has circulated among the experts since the end of 2005 and was the starting point for further important investigations in the research field, see, for example, 2, 30 .The paper in the present form is a slight modification of a version from March 2006.A minor publication mishap caused some wrong citations see 30 , as well as a delay in publishing of it.

Conjecture 2.3. Assume
that β 1. Show that every solution of 2.3 is bounded.

Conjecture 2.4. Assume
that β 1. Show that every prime periodic solution of 2.3 has period equal to one or two.Conjecture 2.3 was confirmed in 28 where the following lemma was proved.Suppose h is a function which satisfies the following conditions: