Next Article in Journal
Decomposition and Intersection of Two Fuzzy Numbers for Fuzzy Preference Relations
Next Article in Special Issue
General k-Dimensional Solvable Systems of Difference Equations
Previous Article in Journal
Magnetic Transport in Spin Antiferromagnets for Spintronics Applications
Previous Article in Special Issue
Solvable Three-Dimensional Product-Type System of Difference Equations with Multipliers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations

1
Mathematical Institute of the Serbian Academy of Sciences, Knez Mihailova 36/III, 11000 Beograd, Serbia
2
Operator Theory and Applications Research Group, Department of Mathematics, King Abdulaziz University, P.O. Box 80203, Jeddah 21589, Saudi Arabia
Symmetry 2017, 9(10), 227; https://doi.org/10.3390/sym9100227
Submission received: 29 September 2017 / Revised: 8 October 2017 / Accepted: 8 October 2017 / Published: 14 October 2017

Abstract

:
By using some solvability methods and the contraction mapping principle are investigated bounded, as well as periodic solutions to some classes of nonhomogeneous linear second-order difference equations on domains N 0 , Z \ N 2 and Z . The case when the coefficients of the equation are constant and the zeros of the characteristic polynomial associated to the corresponding homogeneous equation do not belong to the unit circle is described in detail.

1. Introduction

Let Z denote the set of all integers, N k : = { n Z : n k } , k Z , and N = N 1 . Investigations of difference equations and systems of difference equations have been conducted for a long time (see, for example, [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37] and the references therein). The solvability of the equations and systems is one of the oldest topics in the area. It is always nice to have formulas for solutions to the equations and systems for themselves, but also since they can frequently help in studying of the long-term behavior of the solutions, as is the case in [7,33,35]. Many classical results, including the ones on solvability of the equations and systems, can be found in the following classical books: [8,14,15,16,19,20].
Many of solvable difference equations and systems essentially use the solvability of the linear first-order difference equation, that is, of the following difference equation
x n + 1 = q n x n + f n , n N 0 ,
where ( q n ) n N 0 and ( f n ) n N 0 are given sequences. We will mention here just a few recent examples; the interested reader can find many other examples in the list of the references of the mentioned papers. In [33] was studied the following difference equation
x n = a n x n k b n + c n x n 1 x n k , n N 0 ,
which is transformed to an equation of the form in (1) by using the change of variables y n = 1 / ( x n x n 1 x n k + 1 ) , while [32] studies the following difference equation
x n + 1 = x n x n k x n k + 1 ( a + b x n x n k ) , n N 0 ,
which is transformed to an equation of the form in (1) by using the change of variables y n = 1 / ( x n + 1 x n k + 1 ) (for an extension of the equation see [31]). Essentially the same ideas and methods were used in [23,35], while [1] studies a special case of Equation (2) in another way. In fact, all the papers use our ideas and methods from a 2004 note. Paper [27] presents several related methods and can be considered as a representative one, where a comprehensive list of relevant references on solvability is given. It is also worthy to mention that some nonlinear systems of difference equations were solved by reducing them, by using some suitable changes of variables, to solvable linear ones (see, for example, [7,34], as well as the related references therein). The solvability of some product-type equations ([27]) and systems ([28,36,37]) has been also shown by using some solvable linear ones, although in a more complex way. In fact, some of the results in papers [28,36,37] use special cases of the following equation
z n = b n z n 1 a n , n N 0 ,
which is a product-type analog of Equation (1). All above mentioned examples show the importance of Equation (1). Here, we will frequently use various things connected to Equation (1). Some recent applications of this and related solvable equations can be found in [5,6]. Let us also mention that beside showing the solvability of difference equations and systems by finding closed-form formulas for their solutions, in the cases when it is not possible to find them, one can try to find some of their invariants which can be also useful in studying of the long-term behavior of their solutions ([21,22]).
Motivated by the recent studies of the solvability, quite recently in [30], we have studied, among other problems, the existence of bounded solutions to the difference equation
x n + 2 q n x n = f n , n N 0 ,
in two different ways. Applying classical method of variation of constants it is easily shown that in the case q n = q C \ { 0 } , Equation (3) has the general solution in the following form:
x n = ( q ) n c 0 + k = 0 n 1 f k 2 ( q ) k + 2 + ( q ) n d 0 + k = 0 n 1 ( 1 ) k f k 2 ( q ) k + 2 , n N 0 ,
where c 0 and d 0 are arbitrary complex numbers, and q is one of two possible roots of q. By using Formula (4), as well as another method, we have shown in [30], among other results, that the equation in the case q n = q , n N 0 , has a unique bounded solution in the case when | q | > 1 , and used the obtained formula for the bounded solution as a motivation for introducing an operator which along with the contraction mapping principle ([4]) helps in showing the existence of a unique bounded solution to Equation (3) under some conditions posed on the sequence ( q n ) n N 0 . It is a natural problem to try to use the same ideas and methods in investigating of bounded solutions to some other classes of linear and nonlinear difference equations.
One of the aims of the paper is to present some related results to those in [30] for the case of the difference equation
x n + 2 + p n x n + 1 + q n x n = f n , n N 0 .
This equation is one of the most important and widely studied difference ones, since it models many real-life quantities and processes, for example, the amplitude of oscillation of the weights on a discretely weighted vibrating string [3] (pp. 15–17). For some classical results and methods for studying Equation (5), see, for example, [16,26], as well as the references therein. Note also that by using the differences Δ x n = x n + 1 x n and Δ 2 x n = x n + 2 2 x n + 1 + x n the equation can be written in the following form
Δ 2 x n + ( p n + 2 ) Δ x n + ( p n + q n + 1 ) x n = f n , n N 0 ,
from which it immediately follows that the equation is a discrete variant of a linear second-order differential equation.
We first investigate the case when
p n = p , q n = q 0 , n N 0 ,
and ( f n ) n N 0 is a bounded sequence, and after that the case when ( p n ) n N 0 and ( q n ) n N 0 are nonconstant sequences. The case when (6) holds can be regarded as a folklore one, but it is difficult to find many of the information provided here in the literature, especially at one place. The case when the zeros of the characteristic polynomial associated to the corresponding homogeneous equation do not belong to the unit circle is described in detail. It should be pointed out that when one of the zeros belongs to the circle then, as usual, very different situations appears. Recall that if in Equation (1) q n = 1 , n N 0 , then, the bounded sequence ( f n ) n N 0 highly influences on the behavior of the solutions to the equation. Namely, a solution to the equation can converge, diverge to infinity, the limit set can be even a whole interval (see, for example, [19,24], as well as [2] for the case of metric spaces), or it can be even a more complicated set.
As in [30], we first use some solvability methods and then the contraction mapping principle in showing the existence of a unique bounded solution to Equation (5) under some conditions posed on the coefficients of the equation. For some other applications of fixed-point theorems in studying difference equations and systems, see, for example, [10,11,12,17,18,25] and the related references therein. Note that beside the contraction mapping principle, very frequent situation is application of a variant of the Schauder fixed-point theorem ([10,11,12,17,18]), and since recently the Darbo fixed-point theorem ([38]) which uses the notion of measure of non-compactness ([25]). It should be noted that many of these papers essentially use a similar idea, that is, a combination of a solvability method, which is frequently hidden by some summations, and a fixed point theorem. The existence of periodic solutions in the case when ( p n ) n N 0 and ( q n ) n N 0 are constant sequences, while ( f n ) n N 0 is a periodic sequence is also studied, as well as the relationship between the periodic and non-periodic ones, which is a natural continuation of the investigations in [29].
In our recent paper [29] we have also studied bounded solutions to Equation (1), but on the set of all integers Z , which has motivated us to conduct a similar investigation for the case of Equation (5). Hence, beside studying bounded solutions on domain N 0 , it will be also done on domains Z \ N 2 and Z . One of the reasons, why instead of the domain Z \ N is chosen Z \ N 2 is found in the fact that the initial, that is, end values for the sets N 0 and Z \ N 2 are the same, so that the domains patch each other well. Let us mention that a part of our investigations in [29,30] are motivated by a problem from [9].
Let S Z be an unbounded set. Then the space of bounded sequences f = ( f n ) n S on S with the supremum norm
f , S = sup n S | f n | ,
is Banach’s, and is usually denoted by l ( S ) . Throughout the paper we will simply use the notations f and l , no matter which set S is used, since at each point it will be clear what the set is. We will also use the standard convention j = m l a j = 0 , when m , l Z are such that l < m .
It is said that a sequence ( x n ) n N k converges geometrically (exponentially) to a sequence ( x ˜ n ) n N k if there are M > 0 and q [ 0 , 1 ) , such that
| x n x ˜ n | M q n , for n N k ,
while a sequence ( x n ) n Z \ N k converges geometrically (exponentially) to a sequence ( x ˜ n ) n Z \ N k if there are M > 0 and q [ 0 , 1 ) , such that
| x n x ˜ n | M q n , for n k + 1 .

2. Bounded Solutions to Equation (5) on N 0

First, we prove an auxiliary result in a standard way, for the case when ( p n ) n N 0 and ( q n ) n N 0 are constant sequences. The result can be obtained from a formula for the general solution to Equation (5) when the fundamental set of solutions to the corresponding homogeneous equation is known. We will give a proof of it for the completeness, and to avoid frequent troubles with indices which lead to some minor inaccuracies related to the formula as it is the case in [20]. Some consequences of the lemma, which should be folklore, are given.
Lemma 1.
Consider the equation
x n + 2 + p x n + 1 + q x n = f n , n N 0 ,
where p C , q C \ { 0 } , and ( f n ) n N 0 is a sequence of complex numbers. Then the following statements are true.
(a) 
If p 2 4 q , then the general solution to Equation (8) is given by the following formula
x n = λ 1 n c 0 k = 0 n 1 f k λ 1 k + 1 ( λ 2 λ 1 ) + λ 2 n d 0 + k = 0 n 1 f k λ 2 k + 1 ( λ 2 λ 1 ) ,
for n N 0 , where c 0 and d 0 are arbitrary complex numbers, and
λ 1 , 2 = p ± p 2 4 q 2 .
(b) 
If p 2 = 4 q , then the general solution to Equation (8) is given by the following formula
x n = λ n c 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 + n λ n d 0 + k = 0 n 1 f k λ k + 2 ,
for n N 0 , where c 0 and d 0 are arbitrary complex numbers, and λ = p / 2 .
Proof. 
(a) We solve the equation by the method of variation of constants ([8,20]). As it is well-known, the corresponding homogeneous equation, in this case, has the general solution in the following form:
x n = c λ 1 n + d λ 2 n , n N 0 ,
where λ 1 , 2 are the zeros of the characteristic polynomial
P 2 ( λ ) = λ 2 + p λ + q ,
associated to the homogeneous equation, from which (10) follows.
Hence, the general solution to (8) is searched for in the following form:
x n = c n λ 1 n + d n λ 2 n , n N 0 ,
where ( c n ) n N 0 and ( d n ) n N 0 are two (undetermined) sequences.
The following condition is posed
x n + 1 = c n + 1 λ 1 n + 1 + d n + 1 λ 2 n + 1 = c n λ 1 n + 1 + d n λ 2 n + 1 ,
for n N 0 , that is,
( c n + 1 c n ) λ 1 n + 1 + ( d n + 1 d n ) λ 2 n + 1 = 0 ,
for n N 0 .
Employing (13), (14), as well as (14) where n is replaced by n + 1 in (8), and using that p = ( λ 1 + λ 2 ) and q = λ 1 λ 2 , we get
c n + 1 λ 1 n + 2 + d n + 1 λ 2 n + 2 ( λ 1 + λ 2 ) ( c n λ 1 n + 1 + d n λ 2 n + 1 ) + λ 1 λ 2 ( c n λ 1 n + d n λ 2 n ) = f n ,
that is,
( c n + 1 c n ) λ 1 n + 2 + ( d n + 1 d n ) λ 2 n + 2 = f n ,
for n N 0 .
For each fixed n N 0 , (15) and (16) jointly can be regarded as a two-dimensional linear system in variables c n + 1 c n and d n + 1 d n .
By solving the system it is easily obtained
c n + 1 c n = f n λ 1 n + 1 ( λ 2 λ 1 ) and d n + 1 d n = f n λ 2 n + 1 ( λ 2 λ 1 ) , n N 0 ,
from which it follows that
c n = c 0 k = 0 n 1 f k λ 1 k + 1 ( λ 2 λ 1 ) and d n = d 0 + k = 0 n 1 f k λ 2 k + 1 ( λ 2 λ 1 ) ,
for n N 0 .
Using (17) into (13) we get (9). That (9) represents the general solution to (8), follows from the fact that the sequence
x ^ n : = k = 0 n 1 λ 2 n k 1 λ 1 n k 1 λ 2 λ 1 f k
is a particular solution to Equation (8), which is easily verified, while
x n h = c 0 λ 1 n + d 0 λ 2 n ,
is the general solution to the corresponding homogeneous equation ([8,20]).
(b) The corresponding homogeneous equation, in this case, has the general solution in the following form:
x n = c λ n + d n λ n , n N 0 ,
where λ is the (double) zero of polynomial (12), that is, λ = p / 2 .
So, the general solution to (8) is looked for in the following form:
x n = c n λ n + d n n λ n , n N 0 ,
where ( c n ) n N 0 and ( d n ) n N 0 are two (undetermined) sequences.
The following condition is posed
x n + 1 = c n + 1 λ n + 1 + d n + 1 ( n + 1 ) λ n + 1 = c n λ n + 1 + d n ( n + 1 ) λ n + 1 ,
for n N 0 , that is,
( c n + 1 c n ) λ n + 1 + ( d n + 1 d n ) ( n + 1 ) λ n + 1 = 0 , n N 0 .
Employing (18), (19), as well as (19) where n is replaced by n + 1 in (8), and using that p = 2 λ and q = λ 2 , we get
c n + 1 λ n + 2 + d n + 1 ( n + 2 ) λ n + 2 2 λ ( c n λ n + 1 + d n ( n + 1 ) λ n + 1 ) + λ 2 ( c n λ n + d n n λ n ) = f n ,
that is,
( c n + 1 c n ) λ n + 2 + ( d n + 1 d n ) ( n + 2 ) λ n + 2 = f n , n N 0 .
For each fixed n N 0 , equalities (20) and (21) can be regarded as a two-dimensional linear system in variables c n + 1 c n and d n + 1 d n .
By solving the system it is easily obtained
c n + 1 c n = ( n + 1 ) f n λ n + 2 and d n + 1 d n = f n λ n + 2 , n N 0 ,
from which it follows that
c n = c 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 and d n = d 0 + k = 0 n 1 f k λ k + 2 , n N 0 .
Using (22) into (18) we get (11). That (11) represents the general solution to (8), follows from the facts that the sequence
x ^ n : = k = 0 n 1 n k 1 λ k + 2 n f k , n N 0 ,
is a particular solution to difference Equation (8), which is easily verified, while the sequence
x n h = c 0 λ n + d 0 n λ n , n N 0 ,
is the general solution to the corresponding homogeneous difference equation, as desired. ☐
Remark 1.
If q = 0 , then Equation (8) is essentially reduced to Equation (1), when p 0 , or to a very simple equation if p = 0 , which is the reason why the condition q 0 is posed in Lemma 1.
Corollary 1.
Consider Equation (8) where p C , q C \ { 0 } , x 0 and x 1 are complex numbers, and ( f n ) n N 0 is a sequence of complex numbers. Then the following statements are true.
(a) 
If p 2 4 q , then the solution to Equation (8) with the initial values x 0 and x 1 is given by the following formula
x n = 1 λ 2 λ 1 λ 1 n λ 2 x 0 x 1 k = 0 n 1 f k λ 1 k + 1 + λ 2 n x 1 λ 1 x 0 + k = 0 n 1 f k λ 2 k + 1 ,
for n N 0 , where λ 1 , 2 are given by (10).
(b) 
If p 2 = 4 q , then the solution to Equation (8) with the initial values x 0 and x 1 is given by the following formula
x n = λ n x 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 + n λ n 1 x 1 λ x 0 + k = 0 n 1 f k λ k + 1 ,
for n N 0 , where λ = p / 2 .
Proof. 
(a) Using Formula (9) with n = 0 , 1 , and by some calculations, we see that it must be
c 0 + d 0 = x 0 , λ 1 c 0 + λ 2 d 0 = x 1 .
By solving the two-dimensional linear system, we obtain
c 0 = λ 2 x 0 x 1 λ 2 λ 1 , d 0 = x 1 λ 1 x 0 λ 2 λ 1 .
Using (25) in (9) is obtained (23).
(b) From (11) with n = 0 , 1 , and some calculations, we see that it must be
c 0 = x 0 , c 0 + d 0 = x 1 λ ,
from which it follows that
c 0 = x 0 , d 0 = x 1 λ x 0 λ .
Using (26) in (11) is obtained (24). ☐
Remark 2.
Corollary 1, which essentially includes Lemma 1, can be also obtained by another standard method, the method of decomposition. We would like to point out that the method produces a slightly different formula. Namely, Equation (8) can be written in the following form:
x n + 2 λ 1 x n + 1 = λ 2 ( x n + 1 λ 1 x n ) + f n , n N 0 .
By using the change of variables
y n = x n + 1 λ 1 x n , n N 0 ,
Equation (27) becomes
y n + 1 = λ 2 y n + f n , n N 0 ,
which is a special case of Equation (1), so it is solvable in closed-form, and its solution is
y n = λ 2 n y 0 + j = 0 n 1 f j λ 2 n 1 j , n N 0 ,
from which it follows that
x n = λ 1 x n 1 + λ 2 n 1 ( x 1 λ 1 x 0 ) + j = 0 n 2 f j λ 2 n 2 j , n N .
By solving Equation (29) and after some calculation, in the case λ 1 λ 2 , we obtain
x n = ( x 1 λ 2 x 0 ) λ 1 n ( x 1 λ 1 x 0 ) λ 2 n λ 1 λ 2 + j = 0 n 2 f j λ 1 n j 1 λ 2 n j 1 λ 1 λ 2 , n N ,
which, on the first site, seems a bit different from the formula in (23). However, since
j = 0 n 1 f j λ 1 n j 1 λ 2 n j 1 λ 1 λ 2 = j = 0 n 2 f j λ 1 n j 1 λ 2 n j 1 λ 1 λ 2 + f n 1 1 1 λ 1 λ 2 ,
we see that Formulas (23) and (30) are the same.
The same situation appears in the case λ 1 = λ 2 . We leave the verification of the fact as an exercise. In fact, a similar situation appears at several points, and at some different contexts, in the paper. We will not mention them, and suggest the reader to have the remark on his mind.
The following folklore result is another consequence of Lemma 1.
Corollary 2.
Consider Equation (8), where the zeros λ 1 , 2 of polynomial (12) satisfy the condition
M : = max { | λ 1 | , | λ 2 | } < 1 ,
and ( f n ) n N 0 is a bounded sequence of complex numbers. Then every solution to the equation is bounded.
Proof. 
According to Lemma 1 we know that in the case p 2 4 q , the general solution to difference Equation (8) is given by Formula (9), while if p 2 = 4 q , the general solution is given by (11).
Assume first that p 2 4 q . Then, by using (9), we have
| x n | | λ 1 | n | c 0 | + k = 0 n 1 | f k | | λ 1 | k + 1 | λ 2 λ 1 | + | λ 2 | n | d 0 | + k = 0 n 1 | f k | | λ 2 | k + 1 | λ 2 λ 1 | M n ( | c 0 | + | d 0 | ) + f | λ 2 λ 1 | k = 0 n 1 ( | λ 1 | n k 1 + | λ 2 | n k 1 ) | c 0 | + | d 0 | + 2 f | λ 2 λ 1 | ( 1 M ) ,
for every n N 0 , from which the result follows, in this case.
Now assume that p 2 = 4 q . Since in this case λ 1 = λ 2 = λ = p / 2 and | λ | = M , by using (11), we have
| x n | | λ | n | c 0 | + k = 0 n 1 ( n k 1 ) | f k | | λ | k + 2 + n | λ | n | d 0 | n | λ | n ( | c 0 | + | d 0 | ) + f s = 0 n 1 s | λ | s 1 ( | c 0 | + | d 0 | ) sup n N n M n + f ( 1 M ) 2 ,
for every n N 0 , from which along with the boundedness of the sequence ( n M n ) n N , the result follows, in this case. ☐
If the sequence ( f n ) n N 0 is T-periodic, that is,
f n = f n + T , n N 0 ,
for some T N (for T = 1 is said that f n is eventually constant [13]), a natural question is if Equation (8) in this case has periodic solutions, and if so what is the relation between the periodic ones and the other solutions ([29]). The following result gives an answer to the question.
Theorem 1.
Consider Equation (8), where the zeros λ 1 , 2 of polynomial (12) satisfy condition (31) and ( f n ) n N 0 is a T-periodic sequence. Then the following statements hold.
(a) 
There is a unique T-periodic solution to Equation (8).
(b) 
All the solutions to Equation (8) converge geometrically to the periodic one.
Proof. 
(a) If ( x n ) n N 0 is a T-periodic solution to Equation (8), then specially we have
x 0 = x T and x 1 = x T + 1 .
On the other hand, if (33) holds, then from (8) and (32), we have
x T + 2 = p x T + 1 q x T + f T = p x 1 q x 0 + f 0 = x 2 .
A simple inductive argument along with a use of (8) shows that
x m T + l = x l ,
for every m N and l { 0 , 1 , , T 1 } , that is, such a solution to Equation (8) is T-periodic.
Case p 2 4 q . From this and (23), we see that it is enough to show that the linear system
x 0 = 1 λ 2 λ 1 λ 1 T λ 2 x 0 x 1 k = 0 T 1 f k λ 1 k + 1 + λ 2 T x 1 λ 1 x 0 + k = 0 T 1 f k λ 2 k + 1 x 1 = 1 λ 2 λ 1 λ 1 T + 1 λ 2 x 0 x 1 k = 0 T f k λ 1 k + 1 + λ 2 T + 1 x 1 λ 1 x 0 + k = 0 T f k λ 2 k + 1 ,
has a unique solution in variables x 0 and x 1 .
System (34) can be written in the following form:
( λ 1 λ 2 ( λ 1 T 1 λ 2 T 1 ) + λ 1 λ 2 ) x 0 + ( λ 2 T λ 1 T ) x 1 = λ 1 T S 1 λ 2 T S 2 λ 1 λ 2 ( λ 1 T λ 2 T ) x 0 + ( λ 2 T + 1 λ 1 T + 1 + λ 1 λ 2 ) x 1 = λ 1 T + 1 S 1 λ 2 T + 1 S 2 ,
where
S 1 : = j = 0 T 1 f j λ 1 j + 1 and S 2 : = j = 0 T 1 f j λ 2 j + 1 .
After some standard but interesting calculation it is shown that the determinant of system (35) is:
Δ = λ 1 λ 2 ( λ 1 T 1 λ 2 T 1 ) + λ 1 λ 2 λ 2 T λ 1 T λ 1 λ 2 ( λ 1 T λ 2 T ) λ 2 T + 1 λ 1 T + 1 + λ 1 λ 2 = ( λ 1 λ 2 ) 2 ( λ 1 T 1 ) ( λ 2 T 1 ) 0 ,
due to (31) and λ 1 λ 2 .
Also, we have
Δ 1 = λ 1 T S 1 λ 2 T S 2 λ 2 T λ 1 T λ 1 T + 1 S 1 λ 2 T + 1 S 2 λ 2 T + 1 λ 1 T + 1 + λ 1 λ 2 = ( λ 2 λ 1 ) ( λ 1 T ( λ 2 T 1 ) S 1 λ 2 T ( λ 1 T 1 ) S 2 ) ,
and
Δ 2 = λ 1 λ 2 ( λ 1 T 1 λ 2 T 1 ) + λ 1 λ 2 λ 1 T S 1 λ 2 T S 2 λ 1 λ 2 ( λ 1 T λ 2 T ) λ 1 T + 1 S 1 λ 2 T + 1 S 2 = ( λ 2 λ 1 ) ( λ 1 T + 1 ( λ 2 T 1 ) S 1 λ 2 T + 1 ( λ 1 T 1 ) S 2 ) .
From (36) to (38), it follows that
x 0 = λ 1 T ( λ 2 T 1 ) S 1 λ 2 T ( λ 1 T 1 ) S 2 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 )
and
x 1 = λ 1 T + 1 ( λ 2 T 1 ) S 1 λ 2 T + 1 ( λ 1 T 1 ) S 2 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) ,
are the initial values for which is obtained the T-periodic solution to Equation (8) in this case.
Case p 2 = 4 q . Using (24), we see that (33) becomes the linear system
x 0 = λ T x 0 k = 0 T 1 ( k + 1 ) f k λ k + 2 + T λ T 1 x 1 λ x 0 + k = 0 T 1 f k λ k + 1 x 1 = λ T + 1 x 0 k = 0 T ( k + 1 ) f k λ k + 2 + ( T + 1 ) λ T x 1 λ x 0 + k = 0 T f k λ k + 1 .
System (41) can be rewritten in the following form:
( 1 + ( T 1 ) λ T ) x 0 T λ T 1 x 1 = T λ T 1 S ^ 1 λ T S ^ 2 T λ T + 1 x 0 + ( 1 ( T + 1 ) λ T ) x 1 = ( T + 1 ) λ T S ^ 1 λ T + 1 S ^ 2 ,
where
S ^ 1 : = j = 0 T 1 f j λ j + 1 and S ^ 2 : = j = 0 T 1 ( j + 1 ) f j λ j + 2 .
After some calculation it is shown that the determinant of system (42) is:
Δ = 1 + ( T 1 ) λ T T λ T 1 T λ T + 1 1 ( T + 1 ) λ T = ( λ T 1 ) 2 0 ,
due to (31).
Also, we have
Δ 1 = T λ T 1 S ^ 1 λ T S ^ 2 T λ T 1 ( T + 1 ) λ T S ^ 1 λ T + 1 S ^ 2 1 ( T + 1 ) λ T = T λ T 1 S ^ 1 + λ T ( λ T 1 ) S ^ 2 ,
and
Δ 2 = 1 + ( T 1 ) λ T T λ T 1 S ^ 1 λ T S ^ 2 T λ T + 1 ( T + 1 ) λ T S ^ 1 λ T + 1 S ^ 2 = λ T ( 1 + T λ T ) S ^ 1 + λ T + 1 ( λ T 1 ) S ^ 2 .
From (43)–(45), it follows that
x 0 = T λ T 1 S ^ 1 + λ T ( λ T 1 ) S ^ 2 ( λ T 1 ) 2
and
x 1 = λ T ( 1 + T λ T ) S ^ 1 + λ T + 1 ( λ T 1 ) S ^ 2 ( λ T 1 ) 2 ,
are the initial values for which is obtained the T-periodic solution to Equation (8) in this case.
(b) If ( x ˜ n ) n N 0 is the T-periodic solution to Equation (8) and ( x n ) n N 0 is any solution to the equation, then if p 2 4 q , from (23) we have
| x ˜ n x n | = 1 | λ 2 λ 1 | | λ 1 n λ 2 x ˜ 0 x ˜ 1 k = 0 n 1 f k λ 1 k + 1 + λ 2 n x ˜ 1 λ 1 x ˜ 0 + k = 0 n 1 f k λ 2 k + 1 λ 1 n λ 2 x 0 x 1 k = 0 n 1 f k λ 1 k + 1 + λ 2 n x 1 λ 1 x 0 + k = 0 n 1 f k λ 2 k + 1 | ( | λ 2 | | x ˜ 0 x 0 | + | x ˜ 1 x 1 | ) | λ 1 | n + ( | λ 1 | | x ˜ 0 x 0 | + | x ˜ 1 x 1 | ) | λ 2 | n | λ 2 λ 1 | ,
from which along with (31) the statement follows in this case.
If p 2 = 4 q , then from (24) we have
| x ˜ n x n | = | λ n x ˜ 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 + n λ n 1 x ˜ 1 λ x ˜ 0 + k = 0 n 1 f k λ k + 1 λ n x 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 n λ n 1 x 1 λ x 0 + k = 0 n 1 f k λ k + 1 | | x ˜ 0 x 0 | | λ | n + ( | x ˜ 1 x 1 | + | λ | | x ˜ 0 x 0 | ) n | λ | n 1 M 1 + | λ | 2 n ,
for some M = M ( x 0 , x 1 , x ˜ 0 , x ˜ 1 , λ ) , from which the statement follows in this case. ☐
The following result solves the problem of existence of a unique bounded solution to Equation (5) for the case p n = p , q n = q , n N 0 , when
m : = min { | λ 1 | , | λ 2 | } > 1 .
Theorem 2.
Consider Equation (8), where the zeros λ 1 , 2 of the polynomial (12) satisfy condition (46), and ( f n ) n N 0 is a bounded sequence of complex numbers. Then, there is a unique bounded solution to the equation.
Proof. 
According to Lemma 1 (a) we know that in the case p 2 4 q , the general solution to (8) is given by (9), while if p 2 = 4 q , the general solution is given by (11).
Assume first that p 2 4 q . If in the case there is a bounded solution to Equation (8), then it must be
c 0 = k = 0 f k λ 1 k + 1 ( λ 2 λ 1 ) = : S ˜ 1 and d 0 = k = 0 f k λ 2 k + 1 ( λ 2 λ 1 ) = : S ˜ 2 .
Note that sums S ˜ 1 and S ˜ 2 are finite since due to condition (46) and the boundedness of ( f n ) n N 0 , we have
| k = 0 f k λ j k + 1 ( λ 2 λ 1 ) | f | λ 2 λ 1 | ( | λ j | 1 ) < + , j = 1 , 2 .
Indeed, if c 0 S ˜ 1 and d 0 S ˜ 2 , then from (9), we easily get
| x n | ( max { | λ 1 | , | λ 2 | } ) n .
If c 0 S ˜ 1 and d 0 = S ˜ 2 , then
x n = λ 1 n c 0 k = 0 n 1 f k λ 1 k + 1 ( λ 2 λ 1 ) λ 2 n k = n f k λ 2 k + 1 ( λ 2 λ 1 ) .
From this and since
| λ 2 n k = n f k λ 2 k + 1 ( λ 2 λ 1 ) | f | λ 2 λ 1 | ( | λ 2 | 1 )
we get
x n λ 1 n .
If c 0 = S ˜ 1 and d 0 S ˜ 2 , then
x n = λ 1 n k = n f k λ 1 k + 1 ( λ 2 λ 1 ) + λ 2 n d 0 + k = 0 n 1 f k λ 2 k + 1 ( λ 2 λ 1 ) .
From this and since
| λ 1 n k = n f k λ 1 k + 1 ( λ 2 λ 1 ) | f | λ 2 λ 1 | ( | λ 1 | 1 )
we get
x n λ 2 n .
Hence, in these three cases from (48)–(50) it would follow that the solutions would be unbounded, a contradiction.
By using (47) in (9), we get
x n = k = n λ 1 n k 1 λ 2 n k 1 λ 2 λ 1 f k , n N 0 .
A direct calculation shows that sequence ( x n ) n N 0 defined by (51) is a solution to Equation (8). On the other hand, by using the assumptions of the theorem we easily get
| x n | 2 f | λ 2 λ 1 | k = n m n k 1 = 2 f | λ 2 λ 1 | ( m 1 ) < , n N 0 ,
from which the boundedness of ( x n ) n N 0 , follows. From this and since by (47), ( c 0 , d 0 ) is uniquely determined it follows that (51) is a unique bounded solution to Equation (8), in this case.
Now, assume that p 2 = 4 q . If in the case there is a bounded solution to (8), then it must be
c 0 = k = 0 ( k + 1 ) f k λ k + 2 = : S 3 and d 0 = k = 0 f k λ k + 2 = : S 4 .
Note that sums S 3 and S 4 are also finite since due to condition (46) and the boundedness of ( f n ) n N 0 we have
| k = 0 f k λ k + 2 | f | λ | ( | λ | 1 ) < +
and
| k = 0 ( k + 1 ) f k λ k + 2 | f ( | λ | 1 ) 2 < + .
Indeed, if c 0 S 3 and d 0 S 4 , then from (11), we easily get
| x n | n | λ | n .
If c 0 S 3 and d 0 = S 4 , then
x n = λ n c 0 k = 0 n 1 ( k + 1 ) f k λ k + 2 n λ n k = n f k λ k + 2 .
From this, since
| n λ n k = n f k λ k + 2 | n f | λ | ( | λ | 1 )
and n = o ( λ n ) , we get
x n λ n .
If c 0 = S 3 and d 0 S 4 , then
x n = λ n k = n ( k + 1 ) f k λ k + 2 + n λ n d 0 + k = 0 n 1 f k λ k + 2 .
From this, since
| λ n k = n ( k + 1 ) f k λ k + 2 | f | λ | 2 s = 0 s + n + 1 | λ | s = f | λ | 2 | λ | n | λ | 1 + | λ | 2 ( | λ | 1 ) 2 ,
and n = o ( n λ n ) , we get
x n n λ n .
Hence, in these three cases from (53)–(55) it would follow that the solutions are unbounded, a contradiction.
By using (52) in (11), we get
x n = k = n ( k + 1 n ) λ k + 2 n f k , n N 0 .
A direct calculation shows that sequence ( x n ) n N 0 defined by (56) is a solution to Equation (8). On the other hand, by using the assumptions of the theorem we easily get
| x n | f k = n ( k + 1 n ) | λ | n k 2 = f ( | λ | 1 ) 2 < , n N 0 ,
from which the boundedness of ( x n ) n N 0 follows. From this and since by (52), ( c 0 , d 0 ) is uniquely determined it follows that (56) is a unique bounded solution to Equation (8), in this case. ☐
Theorem 3.
Consider Equation (8), where p C , q C \ { 0 } , the zeros λ 1 , 2 of the polynomial (12) satisfy condition (46) and ( f n ) n N 0 is a T-periodic sequence. Then, the unique bounded solution to Equation (8) is T-periodic.
Proof. 
If ( x ˜ n ) n N 0 is the bounded solution to Equation (8), then by Theorem 2 we see that it is given by (51) when p 2 4 q and (56) if p 2 = 4 q .
Hence, if p 2 4 q , then we have
x ˜ n + T = k = n + T λ 1 n + T k 1 λ 2 n + T k 1 λ 2 λ 1 f k = j = n λ 1 n j 1 λ 2 n j 1 λ 2 λ 1 f j + T = j = n λ 1 n j 1 λ 2 n j 1 λ 2 λ 1 f j = x ˜ n ,
for n N 0 , while if p 2 = 4 q , we have
x ˜ n + T = k = n + T ( k + 1 n T ) λ k + 2 n T f k = j = n ( j + 1 n ) λ j + 2 n f j + T = j = n ( j + 1 n ) λ j + 2 n f j = x ˜ n ,
for n N 0 . From (57) and (58) the result follows. ☐
Theorem 4.
Consider Equation (8), where p C , q C \ { 0 } , the zeros λ 1 , 2 of the polynomial (12) satisfy the following condition
min { | λ 1 | , | λ 2 | } < 1 < max { | λ 1 | , | λ 2 | } ,
and ( f n ) n N 0 is a bounded sequence of complex numbers. Then, the following statements are true.
(a) 
If | λ 1 | < 1 < | λ 2 | , then a solution to Equation (8) is bounded if and only if
λ 1 x 0 x 1 = j = 0 f j λ 2 j + 1 .
(b) 
If | λ 2 | < 1 < | λ 1 | , then a solution to Equation (8) is bounded if and only if
λ 2 x 0 x 1 = j = 0 f j λ 1 j + 1 .
Proof. 
(a) Since | λ 1 | < 1 , we have that
| λ 1 n λ 2 x 0 x 1 k = 0 n 1 f k λ 1 k + 1 | ( | λ 2 | | x 0 | + | x 1 | ) | λ 1 | n + f k = 0 n 1 | λ 1 | n k 1 | λ 2 | | x 0 | + | x 1 | + f 1 | λ 1 | < .
From (23), (62), and since | λ 2 | > 1 , it follows that the boundedness of a solution x n to Equation (8) implies (60). Indeed, since | λ 2 | > 1 , we have
| k = 0 f k λ 2 k + 1 | k = 0 | f k | | λ 2 | k + 1 f | λ 2 | 1 < + ,
that is, the last series is absolutely convergent. So, if (60) were not hold, then for the solution would be
x n λ 2 n ,
which would contradict with its boundedness.
Now assume that (60) holds. Then from (23) and (60) it follows that the solution in the case must be
x n = 1 λ 2 λ 1 λ 1 n λ 2 x 0 x 1 k = 0 n 1 f k λ 1 k + 1 λ 2 n k = n f k λ 2 k + 1 .
Since | λ 2 | > 1 , we have
| λ 2 n k = n f k λ 2 k + 1 | f k = n | λ 2 | n k 1 = f | λ 2 | 1 < .
Using (62) and (64) in (63), we have
| x n | 1 | λ 2 λ 1 | | λ 2 | | x 0 | + | x 1 | + f 1 | λ 1 | + f | λ 2 | 1 ,
from which it follows that the solution to Equation (8) is bounded.
(b) The proof of the statement is similar/dual to the one in (a). Hence, it is omitted.  ☐
Theorem 5.
Consider Equation (8), where p C , q C \ { 0 } , the zeros λ 1 , 2 of the polynomial (12) satisfy condition (59) and ( f n ) n N 0 is a T-periodic sequence. Then, the following statements are true.
(a) 
There is a unique T-periodic solution to Equation (8).
(b) 
All bounded solutions to Equation (8) converge geometrically to the periodic one.
Proof. 
(a) We may assume that the condition holds | λ 1 | < 1 < | λ 2 | , since the other case is essentially the same and is obtained by changing some letters only. By Theorem 4, we see that a solution to Equation (8) is bounded if and only if (60) holds, and that bounded solutions to Equation (8) have the form in (63). If a solution to the equation is T-periodic, then it must be x 0 = x T , that is,
x 0 = 1 λ 2 λ 1 λ 1 T λ 2 x 0 x 1 k = 0 T 1 f k λ 1 k + 1 λ 2 T k = T f k λ 2 k + 1 ,
from which, along with (63) and by some calculation is obtained
x 0 = λ 2 T j = T f j λ 2 j + 1 λ 1 T j = 0 f j λ 2 j + 1 + λ 1 T j = 0 T 1 f j λ 1 j + 1 ( λ 2 λ 1 ) ( λ 1 T 1 ) .
By using equalities (60) and (66) in (63) and after some calculation it is shown that for such chosen x 0 is obtained a T-periodic solution to Equation (8). Since initial value x 0 is uniquely defined by (66), and consequently by (60) initial value x 1 is also uniquely defined, the T-periodic solution is unique too, as claimed.
(b) If ( x ˜ n ) n N 0 is the T-periodic solution to Equation (8) and ( x n ) n N 0 is any bounded solution to the equation, then from (60) and (63) we have
| x ˜ n x n | = 1 | λ 2 λ 1 | | λ 1 n ( λ 2 λ 1 ) x ˜ 0 + k = 0 f k λ 2 k + 1 k = 0 n 1 f k λ 1 k + 1 λ 2 n k = n f k λ 2 k + 1 λ 1 n ( λ 2 λ 1 ) x 0 + k = 0 f k λ 2 k + 1 k = 0 n 1 f k λ 1 k + 1 λ 2 n k = n f k λ 2 k + 1 | | x ˜ 0 x 0 | | λ 1 | n ,
from which the statement follows. ☐
Remark 3.
Since the sequence ( f n ) n N 0 in Theorem 5 is T-periodic, then the expression for x 0 in (66) can be written in a somewhat nicer way. Namely, since the series j = 0 f j λ 2 j + 1 is absolutely convergent, we have
j = m T f j λ 2 j + 1 = k = m j = k T ( k + 1 ) T 1 f j λ 2 j + 1 = k = m i = 0 T 1 f k T + i λ 2 k T + i + 1 = k = m 1 λ 2 k T i = 0 T 1 f i λ 2 i + 1 = λ 2 ( 1 m ) T λ 2 T 1 i = 0 T 1 f i λ 2 i + 1 ,
for every m N 0 .
Using (67) in (66) for m = 0 and m = 1 and after some calculation it follows that
x 0 = λ 1 T ( λ 2 T 1 ) j = 0 T 1 f j λ 1 j + 1 λ 2 T ( λ 1 T 1 ) j = 0 T 1 f j λ 2 j + 1 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) .
From this, (60) and some calculation we get
x 1 = λ 1 T + 1 ( λ 2 T 1 ) j = 0 T 1 f j λ 1 j + 1 λ 2 T + 1 ( λ 1 T 1 ) j = 0 T 1 f j λ 2 j + 1 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) .
Note that the initial values match with the ones in (39) and (40).
Now we are in a position to formulate and prove the main results in this section. The results give some sufficient conditions for the unique existence of bounded solutions to Equation (5), that is, when the sequences ( p n ) n N 0 and ( q n ) n N 0 , in general, are not constant, and they are in the spirit of the main result in our recent paper [30].
Theorem 6.
Assume that ( p n ) n N 0 and ( q n ) n N 0 are sequences of complex numbers such that
q ^ 2 : = sup n N 0 | p n + r 1 + r 2 | + | q n r 1 r 2 | | r 1 r 2 | ( r m 1 ) < 1 2 ,
for some distinct numbers r 1 and r 2 , such that r m : = min { | r 1 | , | r 2 | } > 1 , and ( f n ) n N 0 is a bounded sequence of complex numbers. Then, Equation (5) has a unique bounded solution.
Proof. 
Write Equation (5) in the following form
x n + 2 ( r 1 + r 2 ) x n + 1 + r 1 r 2 x n = ( p n + r 1 + r 2 ) x n + 1 + ( r 1 r 2 q n ) x n + f n ,
for n N 0 .
Let A be the following operator defined on the class of all sequences
A ( u ) = k = n r 1 n k 1 r 2 n k 1 r 2 r 1 ( ( r 1 r 2 q k ) u k ( p k + r 1 + r 2 ) u k + 1 + f k ) n N 0 .
If u l , then from (70), by using condition (68) and some elementary estimates, it follows that
A ( u ) = sup n N 0 | k = n r 1 n k 1 r 2 n k 1 r 2 r 1 ( ( r 1 r 2 q k ) u k ( p k + r 1 + r 2 ) u k + 1 + f k ) | 2 sup n N 0 k = n u ( | r 1 r 2 q k | + | p k + r 1 + r 2 | ) + f | r 2 r 1 | r m k n + 1 u | r 1 r 2 | ( r m 1 ) + 2 f | r 2 r 1 | ( r m 1 ) < ,
which means that operator A maps the Banach space l into itself.
On the other hand, for every u , v l we have
A ( u ) A ( v ) = sup n N 0 | k = n r 1 n k 1 r 2 n k 1 r 2 r 1 ( ( r 1 r 2 q k ) ( u k v k ) ( p k + r 1 + r 2 ) ( u k + 1 v k + 1 ) ) | u v 2 sup n N 0 k = n | r 1 r 2 q k | + | p k + r 1 + r 2 | | r 2 r 1 | r m k n + 1 2 ^ q 2 u v ,
from which along with condition (68) it follows that the operator A : l l is a contraction.
By the Banach fixed point theorem ([4]) it follows that the operator has a unique fixed point, say x = ( x n ) n N 0 l , that is, A ( x ) = x , which can be written as follows
x n = k = n r 1 n k 1 r 2 n k 1 r 2 r 1 ( ( r 1 r 2 q k ) x k ( p k + r 1 + r 2 ) x k + 1 + f k ) ,
for n N 0 .
A direct calculation shows that this bounded sequence satisfies difference Equation (69), that is, Equation (5) for every n N 0 , from which the theorem follows. ☐
Theorem 7.
Assume that ( p n ) n N 0 and ( q n ) n N 0 are sequences of complex numbers such that
q ^ : = sup n N 0 | p n + 2 r | + | q n r 2 | ( r 1 ) 2 < 1 ,
for some number r > 1 , and ( f n ) n N 0 is a bounded sequence of complex numbers. Then the difference Equation (5) has a unique bounded solution.
Proof. 
Write Equation (5) in the following form
x n + 2 2 r x n + 1 + r 2 x n = ( p n + 2 r ) x n + 1 + ( r 2 q n ) x n + f n ,
for n N 0 .
Let A be the following operator defined on the class of all sequences
A ( u ) = k = n ( k + 1 n ) r k + 2 n ( ( r 2 q k ) u k ( p k + 2 r ) u k + 1 + f k ) n N 0 .
If u l , then from (75) it follows that
A ( u ) = sup n N 0 | k = n ( k + 1 n ) r k + 2 n ( ( r 2 q k ) u k ( p k + 2 r ) u k + 1 + f k ) | sup n N 0 k = n ( k + 1 n ) ( | r 2 q k | | u k | + | p k + 2 r | | u k + 1 | + | f k | ) r k + 2 n ( r 1 ) 2 u + f ( r 1 ) 2 < ,
which means that operator A maps the Banach space l into itself.
On the other hand, for every u , v l we have
A ( u ) A ( v ) = sup n N 0 | k = n ( k + 1 n ) r k + 2 n ( ( r 2 q k ) ( u k v k ) ( p k + 2 r ) ( u k + 1 v k + 1 ) | u v sup n N 0 k = n ( k + 1 n ) r k + 2 n ( | r 2 q k | + | p k + 2 r | ) q ^ u v .
From (76) and condition (73) it follows that the operator A : l l is a contraction.
By the Banach fixed point theorem we get that the operator has a unique fixed point, say x = ( x n ) n N 0 l , that is, A ( x ) = x or equivalently
x n = k = n ( k + 1 n ) r k + 2 n ( ( r 2 q k ) x k ( p k + 2 r ) x k + 1 + f k ) ,
for n N 0 .
A direct calculation shows that this bounded sequence satisfies difference Equation (74), that is, Equation (5) for every n N 0 , from which the theorem follows. ☐

3. Bounded Solutions to Equation (5) on the Domain Z \ N 2

Now we consider Equation (8) on domain Z \ N 2 . Recall that the “initial” values on the domain are again x 0 and x 1 (the values, are, in a way, the end values). To deal with a real second-order difference equation it is natural to assume that q 0 (the case q = 0 , p 0 , has been recently studied in [29]). In this case, the equation can be written in the following form
x n + p q x n + 1 + 1 q x n + 2 = f n q , n 1 ,
or equivalently as follows:
x n 1 λ 1 + 1 λ 2 x ( n 1 ) + x ( n 2 ) λ 1 λ 2 = f n λ 1 λ 2 , n N ,
where λ 1 and λ 2 are zeros of the polynomial in (12).
Equation (79) can be considered by using the change of variables y n = x n which will transform the equation into an equation of the form in (8), but with shifted indices. To avoid some technical problems due to non-symmetricity of domains N 0 and Z \ N 2 , instead of this, we will use the method of decomposition mentioned in Remark 2 (see, for example, [15,20]).
If we write (79) in the form
x n x ( n 1 ) λ 1 = 1 λ 2 x ( n 1 ) x ( n 2 ) λ 1 + f n λ 1 λ 2 , n N ,
and multiply the following equation
x j x ( j 1 ) λ 1 = 1 λ 2 x ( j 1 ) x ( j 2 ) λ 1 + f j λ 1 λ 2
by λ 2 ( n j ) , j = 1 , n ¯ , and suming up such obtained equalities, we get
x n = x ( n 1 ) λ 1 + 1 λ 2 n x 0 x 1 λ 1 + 1 λ 1 λ 2 j = 1 n f j λ 2 n j ,
for n N .
Multiplying the following equality
x i = x ( i 1 ) λ 1 + 1 λ 2 i x 0 x 1 λ 1 + 1 λ 1 λ 2 j = 1 i f j λ 2 i j ,
by λ 1 ( n i ) , i = 1 , n ¯ , and summing up such obtained equalities, in the case λ 1 λ 2 , that is, p 2 4 q , we get
x n = x 0 λ 1 n + 1 λ 2 x 0 x 1 λ 1 j = 0 n 1 1 λ 1 j λ 2 n 1 j + 1 λ 1 λ 2 i = 1 n 1 λ 1 n i j = 1 i f j λ 2 i j = x 0 λ 1 ( n + 1 ) λ 2 ( n + 1 ) λ 1 1 λ 2 1 x 1 λ 1 λ 2 λ 1 n λ 2 n λ 1 1 λ 2 1 + 1 λ 1 λ 2 j = 1 n f j λ 1 n λ 2 j i = j n λ 1 λ 2 i = x 0 λ 1 ( n + 1 ) λ 2 ( n + 1 ) λ 1 1 λ 2 1 x 1 λ 1 λ 2 λ 1 n λ 2 n λ 1 1 λ 2 1 + 1 λ 1 λ 2 j = 1 n f j λ 1 j n 1 λ 2 j n 1 λ 1 1 λ 2 1 = λ 1 ( n + 1 ) ( x 0 x 1 λ 2 1 + ( λ 1 λ 2 ) 1 j = 1 n f j λ 1 j ) λ 1 1 λ 2 1 λ 2 ( n + 1 ) ( x 0 x 1 λ 1 1 + ( λ 1 λ 2 ) 1 j = 1 n f j λ 2 j ) λ 1 1 λ 2 1 = λ 1 n ( λ 2 x 0 x 1 + j = 1 n f j λ 1 j 1 ) λ 2 n ( λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 ) λ 2 λ 1 ,
for n N . In fact, the formula also holds for n = 0 and n = 1 , which is easily verified by direct calculation and by using the convention for summations mentioned in introduction.
Now assume that p 2 = 4 q , then (84) holds with λ 1 = λ 2 = : λ , from which along with some calculation we get
x n = x 0 λ n + x 0 x 1 λ n λ n + 1 λ n + 2 i = 1 n λ i j = 1 i f j λ i j = λ ( n + 1 ) λ x 0 + ( λ x 0 x 1 ) n + j = 1 n f j ( n j + 1 ) λ j 1 ,
for n N .
The last formula can be also written in the following form
x n = λ ( n + 1 ) λ x 0 j = 1 n f j ( j 1 ) λ j 1 + n λ ( n + 1 ) λ x 0 x 1 + j = 1 n f j λ j 1 , n N .
Note that as in the previous case Formula (85) also holds for n = 0 and n = 1 , which is easily verified by direct calculation and by using the convention for summations mentioned in introduction.
As a consequence of the above consideration we have that the following result holds.
Lemma 2.
Consider Equation (78) where p C , q C \ { 0 } , x 0 and x 1 are given complex numbers, and ( f n ) n N is a sequence of complex numbers. Then the following statements are true:
(a) 
If p 2 4 q , then the solution to Equation (78) with initial/end values x 0 and x 1 is given by
x n = λ 1 n ( λ 2 x 0 x 1 + j = 1 n f j λ 1 j 1 ) λ 2 n ( λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 ) λ 2 λ 1 ,
where λ 1 , 2 are given by (10).
(b) 
If p 2 = 4 q , then the solution to Equation (78) with initial/end values x 0 and x 1 is given by
x n = λ ( n + 1 ) λ x 0 + ( λ x 0 x 1 ) n + j = 1 n f j ( n j + 1 ) λ j 1 ,
where λ = p / 2 .
Remark 4.
Note that Formula (86) can be written in the form
x n = x ^ n + x n h ,
with
x n h = ( λ 2 x 0 x 1 ) λ 1 n ( λ 1 x 0 x 1 ) λ 2 n λ 2 λ 1 ,
x ^ n = j = 1 n f j ( λ 1 n + j 1 λ 2 n + j 1 ) λ 2 λ 1 , n N ,
where x n h is the solution to the homogeneous difference equation corresponding to (79) with initial/end values x 0 and x 1 , while x ^ n is a particular solution to (79), in the case p 2 4 q .
Also, Formula (87) can be written in the form in (88) with
x n h = ( λ x 0 + ( λ x 0 x 1 ) n ) λ ( n + 1 ) ,
x ^ n = j = 1 n f j ( n j + 1 ) λ n + j 2 , n N ,
where x n h is the solution to the homogeneous difference equation corresponding to (79) with initial/end values x 0 and x 1 , while x ^ n is a particular solution to (79), in the case p 2 = 4 q .
From (23), (24), (89) and (91) it follows that the solution to Equation (8) with f n = 0 , n Z , with initial values x 0 and x 1 is given by
x n = ( λ 2 x 0 x 1 ) λ 1 n + ( x 1 λ 1 x 0 ) λ 2 n λ 2 λ 1 , n Z ,
when p 2 4 q , that is, by
x n = ( λ x 0 + ( x 1 λ x 0 ) n ) λ n 1 , n Z ,
when p 2 = 4 q .
From (86) and (87) similar to Corollary 2 is proved the following result. Hence, we omit the details.
Corollary 3.
Consider Equation (78), where the zeros λ 1 , 2 of polynomial (12) satisfy the condition in (46), and ( f n ) n N is a bounded sequence of complex numbers. Then every solution to the equation on domain Z \ N 2 is bounded.
Theorem 8.
Consider Equation (78), where the zeros λ 1 , 2 of polynomial (12) satisfy condition (46) and ( f n ) n N is a T-periodic sequence. Then the following statements hold.
(a) 
There is a unique T-periodic solution to Equation (79) on domain Z \ N 2 .
(b) 
All the solutions to Equation (79) on domain Z \ N 2 , converge geometrically to the periodic one.
Proof. 
(a) If ( x n ) n 1 is a T-periodic solution to Equation (78), then it must be
x 1 = x 1 T and x 0 = x T .
On the other hand, if (93) holds, then from (78) and since
f n = f n T , n N ,
we have
x ( T + 1 ) = p q x T 1 q x 1 T + f ( T + 1 ) q = p q x 0 1 q x 1 + f 1 q = x 1 .
Using the same argument along with (78) and the method of induction it is proved that
x m T l = x l ,
for every m N and l { 1 , 0 , 1 , , T 2 } , which shows that the solution to Equation (8) is T-periodic.
Case p 2 4 q . This along with (86) shows that it is enough to prove that the linear system
x 0 = λ 1 T ( λ 2 x 0 x 1 + j = 1 T f j λ 1 j 1 ) λ 2 T ( λ 1 x 0 x 1 + j = 1 T f j λ 2 j 1 ) λ 2 λ 1 x 1 = λ 1 1 T ( λ 2 x 0 x 1 + j = 1 T 1 f j λ 1 j 1 ) λ 2 1 T ( λ 1 x 0 x 1 + j = 1 T 1 f j λ 2 j 1 ) λ 2 λ 1 ,
has a unique solution in variables x 0 and x 1 .
Note that system (95) can be written as follows
( λ 1 λ 2 T λ 2 λ 1 T + λ 2 λ 1 ) x 0 + ( λ 1 T λ 2 T ) x 1 = λ 1 T S 5 λ 2 T S 6 ( λ 1 λ 2 1 T λ 2 λ 1 1 T ) x 0 + ( λ 1 1 T λ 2 1 T + λ 2 λ 1 ) x 1 = λ 1 1 T S 5 λ 2 1 T S 6 ,
where
S 5 : = j = 1 T f j λ 1 j 1 and S 6 : = j = 1 T f j λ 2 j 1 .
By some calculation is obtained
Δ = λ 1 λ 2 T λ 2 λ 1 T + λ 2 λ 1 λ 1 T λ 2 T λ 1 λ 2 1 T λ 2 λ 1 1 T λ 1 1 T λ 2 1 T + λ 2 λ 1 = ( λ 1 λ 2 ) 2 ( λ 1 T 1 ) ( λ 2 T 1 ) 0 ,
due to (46) and λ 1 λ 2 .
Also, we have
Δ 1 = λ 1 T S 5 λ 2 T S 6 λ 1 T λ 2 T λ 1 1 T S 5 λ 2 1 T S 6 λ 1 1 T λ 2 1 T + λ 2 λ 1 = ( λ 2 λ 1 ) ( λ 2 T ( λ 1 T 1 ) S 6 λ 1 T ( λ 2 T 1 ) S 5 ) ,
and
Δ 2 = λ 1 λ 2 T λ 2 λ 1 T + λ 2 λ 1 λ 1 T S 5 λ 2 T S 6 λ 1 λ 2 1 T λ 2 λ 1 1 T λ 1 1 T S 5 λ 2 1 T S 6 = ( λ 2 λ 1 ) ( λ 2 1 T ( λ 1 T 1 ) S 6 λ 1 1 T ( λ 2 T 1 ) S 5 )
From (97)–(99), it follows that
x 0 = λ 2 T ( λ 1 T 1 ) S 6 λ 1 T ( λ 2 T 1 ) S 5 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 )
and
x 1 = λ 2 1 T ( λ 1 T 1 ) S 6 λ 1 1 T ( λ 2 T 1 ) S 5 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) ,
are the initial values for which is obtained the T-periodic solution to Equation (78) in this case.
Case p 2 = 4 q . Using (87), we see that (93) becomes the linear system
x 0 = λ ( T + 1 ) λ x 0 + ( λ x 0 x 1 ) T + j = 1 T f j ( T j + 1 ) λ j 1 x 1 = λ T λ x 0 + ( λ x 0 x 1 ) ( T 1 ) + j = 1 T 1 f j ( T j ) λ j 1 .
System (102) can be written as follows
( λ T + 1 λ ( T + 1 ) ) x 0 + T x 1 = S 7 λ T x 0 + ( 1 T λ T ) x 1 = S 8 ,
where
S 7 : = j = 1 T f j ( T j + 1 ) λ j 1 and S 8 : = j = 1 T 1 f j ( T j ) λ j 1 .
After some calculation it is shown that the determinant of system (103) is
Δ = λ T + 1 λ ( T + 1 ) T λ T 1 T λ T = λ ( λ T 1 ) 2 0 ,
due to (46). Also, we have
Δ 1 = S 7 T S 8 1 T λ T = ( 1 T λ T ) S 7 T S 8 ,
and
Δ 2 = λ T + 1 λ ( T + 1 ) S 7 T λ S 8 = ( λ T + 1 λ ( T + 1 ) ) S 8 T λ S 7 .
From (104)–(106), it follows that
x 0 = ( λ T + T 1 ) S 7 + T S 8 λ ( λ T 1 ) 2
and
x 1 = T S 7 ( λ T T 1 ) S 8 ( λ T 1 ) 2 ,
are the initial values for which is obtained the T-periodic solution to Equation (78) in this case.
(b) If ( x ˜ n ) n 1 is the T-periodic solution to Equation (78) and ( x n ) n 1 is any solution to the equation, then if p 2 4 q , from (86) we have
| x ˜ n x n | = | λ 1 n ( λ 2 x ˜ 0 x ˜ 1 + j = 1 n f j λ 1 j 1 ) λ 2 n ( λ 1 x ˜ 0 x ˜ 1 + j = 1 n f j λ 2 j 1 ) λ 2 λ 1 λ 1 n ( λ 2 x 0 x 1 + j = 1 n f j λ 1 j 1 ) λ 2 n ( λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 ) λ 2 λ 1 | ( | λ 2 | | x ˜ 0 x 0 | + | x ˜ 1 x 1 | ) | λ 1 | n + ( | λ 1 | | x ˜ 0 x 0 | + | x ˜ 1 x 1 | ) | λ 2 | n | λ 2 λ 1 | ,
for n N 0 , from which the statement follows in this case.
If p 2 = 4 q , then from (87) we have
| x ˜ n x n | = | λ ( n + 1 ) λ x ˜ 0 + ( λ x ˜ 0 x ˜ 1 ) n + j = 1 n f j ( n j + 1 ) λ j 1 λ ( n + 1 ) λ x 0 + ( λ x 0 x 1 ) n + j = 1 n f j ( n j + 1 ) λ j 1 | | x ˜ 0 x 0 | | λ | n + ( | x ˜ 1 x 1 | + | λ | | x ˜ 0 x 0 | ) n | λ | ( n + 1 ) M 1 1 + | λ | 2 | λ | n ,
for n N 0 , for some M 1 = M 1 ( x 0 , x 1 , x ˜ 0 , x ˜ 1 , λ ) , from which the statement follows in this case.  ☐
Theorem 9.
Consider Equation (78), where the zeros λ 1 , 2 of polynomial (12) satisfy condition (31), and ( f n ) n N is a bounded sequence of complex numbers. Then, there is a unique bounded solution to the equation on domain Z \ N 2 .
Proof. 
If p 2 4 q , then from (31) and (86) we see that a solution to Equation (79) is bounded if and only if
λ 2 x 0 x 1 = j = 1 f j λ 1 j 1 and λ 1 x 0 x 1 = j = 1 f j λ 2 j 1 ,
(note that both sums are finite due to (31) and the boundedness of ( f n ) n N ), from which it follows that the solution is
x n = 1 λ 2 λ 1 j = n + 1 f j ( λ 2 j n 1 λ 1 j n 1 ) .
By direct calculation is shown that (108) is a solution to Equation (78). Since
| x n | f 2 | λ 2 λ 1 | j = n + 1 M j n 1 = 2 f | λ 2 λ 1 | ( 1 M ) ,
for n N , it follows that the solution is bounded. Since by (107), x 0 and x 1 are uniquely defined, the bounded solution is unique.
If p 2 = 4 q , then from (31) and (87), similar to the corresponding part of the proof of Theorem 2 is obtained that Equation (78) has a unique bounded solution if and only if
x 0 = j = 2 f j ( j 1 ) λ j 2 and x 1 = j = 1 f j j λ j 1 ,
(note that both sums are also finite due to (31) and the boundedness of ( f n ) n N ), from which it follows that the solution is
x n = λ ( n + 1 ) j = n + 1 f j ( j n 1 ) λ j 1 .
By direct calculation is shown that (110) is a solution to Equation (79). Since
| x n | f j = n + 2 ( j n 1 ) M j n 2 = f ( 1 M ) 2 ,
for n N , it follows that the solution is bounded. Since due to (109), x 0 and x 1 are uniquely defined, the bounded solution is unique. ☐
Theorem 10.
Consider Equation (78), where p C , q C \ { 0 } , the zeros λ 1 , 2 of the polynomial (12) are distinct and satisfy condition (31) and ( f n ) n N is a T-periodic sequence. Then, the unique bounded solution to Equation (79) is T-periodic.
Proof. 
Let ( x ˜ n ) n 1 be the unique bounded solution to Equation (79). From Theorem 9 we see that the unique bounded solution to Equation (79) is given by (108) if p 2 4 q , and it is given by (110) if p 2 = 4 q .
If p 2 4 q , then we have
x ˜ ( n + T ) = 1 λ 2 λ 1 j = n + T + 1 f j ( λ 2 j n T 1 λ 1 j n T 1 ) = 1 λ 2 λ 1 k = n + 1 f k T ( λ 2 k n 1 λ 1 k n 1 ) = 1 λ 2 λ 1 k = n + 1 f k ( λ 2 k n 1 λ 1 k n 1 ) = x ˜ n ,
for n 1 , while if p 2 = 4 q , we have
x ˜ ( n + T ) = λ ( n + T + 1 ) j = n + T + 1 f j ( j n T 1 ) λ j 1 = λ ( n + T + 1 ) k = n + 1 f k T ( k n 1 ) λ k + T 1 = λ ( n + 1 ) k = n + 1 f k ( k n 1 ) λ k 1 = x ˜ n ,
for n 1 . From (111) and (112) the result follows. ☐
Theorem 11.
Consider Equation (78), where p C , q C \ { 0 } , the zeros λ 1 , 2 of polynomial (12) satisfy condition (59), and ( f n ) n N is a bounded sequence of complex numbers. Then, the following statements are true.
(a) 
If | λ 1 | < 1 < | λ 2 | , then a solution to Equation (78) is bounded if and only if
x 1 λ 2 x 0 = j = 1 f j λ 1 j 1 .
(b) 
If | λ 2 | < 1 < | λ 1 | , then a solution to Equation (78) is bounded if and only if
x 1 λ 1 x 0 = j = 1 f j λ 2 j 1 .
Proof. 
(a) Since | λ 2 | > 1 , we have that
| λ 2 n λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 | ( | λ 1 | | x 0 | + | x 1 | ) | λ 2 | n + f j = 1 n | λ 2 | n + j 1 | λ 1 | | x 0 | + | x 1 | + f | λ 2 | 1 < .
From (86), (115), and since | λ 1 | < 1 , it follows that the boundedness of a solution x n to Equation (79) implies (113).
Now assume that (113) holds. Then from (86) and (113) it follows that the solution in the case must be
x n = λ 1 n ( j = n + 1 f j λ 1 j 1 ) λ 2 n ( λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 ) λ 2 λ 1 .
Since | λ 1 | < 1 , we have
| λ 1 n j = n + 1 f j λ 1 j 1 | f k = n + 1 | λ 1 | n + j 1 = f 1 | λ 1 | < .
Using (115) and (117) in (116), we have
| x n | 1 | λ 2 λ 1 | | λ 1 | | x 0 | + | x 1 | + f | λ 2 | 1 + f 1 | λ 1 | ,
from which it follows that the solution to Equation (79) is bounded.
(b) The proof of the statement is similar/dual to the one in (a). Hence, it is omitted.  ☐
Theorem 12.
Consider Equation (78), where p C , q C \ { 0 } , the zeros λ 1 , 2 of the polynomial (12) satisfy condition (59) and ( f n ) n N is a T-periodic sequence. Then, the following statements are true.
(a) 
There is a unique T-periodic solution to Equation (78) on domain Z \ N 2 .
(b) 
All bounded solutions to Equation (78) on domain Z \ N 2 , converge geometrically to the periodic one.
Proof. 
(a) We may assume that the condition holds | λ 1 | < 1 < | λ 2 | , since the other case is essentially the same. By Theorem 11, we see that a solution to Equation (78) is bounded if and only if (113) holds, and that bounded solutions to Equation (78) have the form in (116). If a solution to the equation is T-periodic, then it must be x 1 = x 1 T , that is,
x 1 = λ 1 1 T ( j = T f j λ 1 j 1 ) λ 2 1 T ( λ 1 x 0 x 1 + j = 1 T 1 f j λ 2 j 1 ) λ 2 λ 1 ,
from which, along with (116) and by some calculation is obtained
x 1 = λ 1 ( λ 2 T λ 1 T ) j = 1 f j λ 1 j 1 + j = 1 T 1 f j ( λ 1 j T λ 2 j T ) ( λ 2 λ 1 ) ( 1 λ 2 T ) .
By using equalities (113) and (118) in (116) and after some calculation it is shown that for such chosen x 1 is obtained a T-periodic solution to Equation (78). Since initial value x 1 is uniquely defined by (118), and consequently by (113) initial value x 0 is uniquely defined, the T-periodic solution is unique too, as claimed.
(b) If ( x ˜ n ) n 1 is the T-periodic solution to Equation (78) and ( x n ) n 1 is any bounded solution to the equation, then from (116) and some simple estimates, we have
| x ˜ n x n | = 1 | λ 2 λ 1 | | λ 1 n j = n + 1 f j λ 1 j 1 λ 2 n λ 1 x ˜ 0 x ˜ 1 + j = 1 n f j λ 2 j 1 λ 1 n j = n + 1 f j λ 1 j 1 λ 2 n λ 1 x 0 x 1 + j = 1 n f j λ 2 j 1 | | λ 1 | | x ˜ 0 x 0 | + | x ˜ 1 x 1 | | λ 2 λ 1 | | λ 2 | n ,
from which the statement easily follows. ☐
Remark 5.
Since the sequence ( f n ) n N in Theorem 12 is T-periodic, then the expression for x 1 in (118) can be written in a somewhat nicer way. Namely, since the series j = 1 f j λ 1 j 1 is absolutely convergent, we have
j = m T + 1 f j λ 1 j 1 = k = m j = k T + 1 ( k + 1 ) T f j λ 1 j 1 = k = m i = 1 T f i k T λ 1 k T + i 1 = k = m λ 1 k T i = 1 T f i λ 1 i 1 = λ 1 m T 1 λ 1 T i = 1 T f i λ 1 i 1 ,
for every m N 0 .
Using (119) in (118) for m = 0 and after some calculation it follows that
x 1 = ( λ 1 T 1 ) j = 1 T f j λ 2 j T ( λ 2 T 1 ) j = 1 T f j λ 1 j T ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) .
From this, (113) and some calculation we get
x 0 = λ 1 ( λ 1 T 1 ) j = 1 T f j λ 2 j T λ 2 ( λ 2 T 1 ) j = 1 T f j λ 1 j T λ 1 λ 2 ( λ 2 λ 1 ) ( λ 1 T 1 ) ( λ 2 T 1 ) .
Note that the initial values match with those in (100) and (101).
The following result considers Equation (8) on domain Z . The result is essentially a consequence of some of above mentioned results on domains N 0 and Z \ N 2 , so it is formulated as a corollary, although it is, in fact, an important results concerning the equation.
Corollary 4.
Consider Equation (8) where p C and q C \ { 0 } . Let λ 1 , 2 be the zeros of polynomial (12), ( f n ) n Z be a bounded sequence of complex numbers, and one of the conditions (31), (46), (59) holds. Then, the equation has a unique bounded solution on Z .
Proof. 
First, assume that (46) holds, then by Theorem 2 there is a unique bounded solution to Equation (8) on N 0 , while by Corollary 3 all the solutions to the equation on Z \ N 2 are bounded, from which the result follows in the case. If (31) holds, then by Corollary 2 we have that all the solutions to the equation on N 0 are bounded, while by Theorem 9 there is a unique bounded solution to the equation on Z \ N 2 , from which the result follows in the case. Now, assume that (59) holds. Then, if | λ 1 | < 1 < | λ 2 | by Theorems 4 (a) and 11 (a), it follows that a solution to Equation (8) on Z is bounded if and only if (60) and (113) hold, which is a two-dimensional linear system in x 0 and x 1 with the determinant different from zero, from which it follows that there is a unique pair of initial values x 0 , x 1 , such that the solution to Equation (8) is bounded. If | λ 2 | < 1 < | λ 1 | , then by Theorems 4 (b) and 11 (b), it follows that a solution to (8) on Z is bounded if and only if (61) and (114) hold, which is also a two-dimensional linear system in x 0 and x 1 with the determinant different from zero, from which it follows that there is a unique pair of initial values x 0 , x 1 , such that the solution to Equation (8) is bounded, in this case, finishing the proof of the theorem. ☐
The following two results are the main results in this section and deal with the general Equation (5) on domain Z \ N 2 . They correspond to Theorems 6 and 7, and are proved similarly. We present their proofs for the completeness and benefit of the reader.
Theorem 13.
Assume that ( p n ) n N and ( q n ) n N are sequences of complex numbers such that
q ^ 3 : = sup n N | p n / q n + r 1 1 + r 2 1 | + | ( r 1 r 2 ) 1 1 / q n | | r 1 r 2 | ( 1 r M ) < 1 2 ,
for some nonzero numbers r 1 and r 2 , such that r M : = max { | r 1 | , | r 2 | } < 1 ,
inf n N | q n | > δ > 0 ,
and ( f n ) n N is a bounded sequence of complex numbers. Then, Equation (5) has a unique bounded solution on Z \ N 2 .
Proof. 
Write Equation (5) in the following form
x n ( r 1 1 + r 2 1 ) x ( n 1 ) + ( r 1 r 2 ) 1 x ( n 2 ) = ( p n / q n + r 1 1 + r 2 1 ) x ( n 1 ) + ( ( r 1 r 2 ) 1 1 / q n ) x ( n 2 ) + f n / q n ,
for n N .
Let A be the following operator defined on the class of all sequences
A ( u ) = j = n + 1 r 2 j n 1 r 1 j n 1 r 2 r 1 1 r 1 r 2 1 q j u 2 j p j q j + r 1 1 + r 2 1 u 1 j + f j q j n 1 .
If u l , then from (121), (123), and some simple inequalities, we have
A ( u ) = sup n N 0 | j = n + 1 r 2 j n 1 r 1 j n 1 r 2 r 1 1 r 1 r 2 1 q j u 2 j p j q j + r 1 1 + r 2 1 u 1 j + f j q j | 2 sup n N 0 j = n + 1 r M j n 1 u ( | ( r 1 r 2 ) 1 q j 1 | + | p j / q j + r 1 1 + r 2 1 | ) + f δ 1 | r 2 r 1 | u | r 1 r 2 | ( 1 r M ) + 2 f δ 1 | r 2 r 1 | ( 1 r M ) < ,
which means that operator A maps the Banach space l into itself.
On the other hand, for every u , v l we have
A ( u ) A ( v ) = sup n N 0 | j = n + 1 r 2 j n 1 r 1 j n 1 r 2 r 1 1 r 1 r 2 1 q j ( u 2 j v 2 j ) p j q j + r 1 1 + r 2 1 ( u 1 j v 1 j ) | u v 2 sup n N j = n + 1 r M j n 1 | ( r 1 r 2 ) 1 1 / q j | + | p j / q j + r 1 1 + r 2 1 | | r 2 r 1 | 2 q ^ 3 u v ,
from which along with (120) it follows that A : l l is a contraction.
By the Banach fixed point theorem we get that the operator has a unique fixed point, say x = ( x n ) n 1 l , that is, A ( x ) = x or equivalently
x n = j = n + 1 r 2 j n 1 r 1 j n 1 r 2 r 1 1 r 1 r 2 1 q j x 2 j p j q j + r 1 1 + r 2 1 x 1 j + f j q j ,
for n 1 .
A direct calculation shows that this bounded sequence satisfies difference Equation (5), from which the theorem follows. ☐
Theorem 14.
Assume that ( p n ) n N and ( q n ) n N are sequences of complex numbers such that
q ^ : = sup n N | p n / q n + 2 r 1 | + | r 2 1 / q n | ( 1 r ) 2 < 1 ,
for some number r < 1 , that condition (121) holds, and ( f n ) n N is a bounded sequence of complex numbers. Then, Equation (5) has a unique bounded solution on Z \ N 2 .
Proof. 
Write Equation (5) in the following form
x n 2 r x ( n 1 ) + 1 r 2 x ( n 2 ) = p n q n + 2 r x ( n 1 ) + 1 r 2 1 q n x ( n 2 ) + f n q n ,
for n N .
Let A be the following operator defined on the class of all sequences
A ( u ) = j = n + 2 ( j n 1 ) r j n 2 1 r 2 1 q j u 2 j p j q j + 2 r u 1 j + f j q j n N 0 .
If u l , then from (127) it follows that
A ( u ) = sup n N 0 | j = n + 2 ( j n 1 ) r j n 2 1 r 2 1 q j u 2 j p j q j + 2 r u 1 j + f j q j | sup n N 0 j = n + 2 ( j n 1 ) r j n 2 | 1 r 2 1 q j | | u 2 j | + | p j q j + 2 r | | u 1 j | + | f j | δ ( 1 r ) 2 u + f δ 1 ( 1 r ) 2 < ,
which means that operator A maps the Banach space l into itself.
On the other hand, for every u , v l we have
A ( u ) A ( v ) = sup n N 0 | j = n + 2 ( j n 1 ) r j n 2 1 r 2 1 q j ( u 2 j v 2 j ) p j q j + 2 r ( u 1 j v 1 j ) | u v sup n N 0 j = n + 2 ( j n 1 ) r j n 2 | 1 r 2 1 q j | + | p j q j + 2 r | q ^ u v .
From (128) and condition (125) it follows that the operator A : l l is a contraction.
By the Banach fixed point theorem we get that the operator has a unique fixed point, say x = ( x n ) n 1 l , that is, A ( x ) = x or equivalently
x n = j = n + 2 ( j n 1 ) r j n 2 1 r 2 1 q j x 2 j p j q j + 2 r x 1 j + f j q j ,
for n 1 .
A direct calculation shows that this bounded sequence satisfies difference Equation (5), from which the theorem follows. ☐

4. Discussion

Motivated by some recent investigations of ours here we present how some solvability methods along with the contraction mapping principle can be employed in studying of a nonhomogeneous linear second-order difference equation, with a special attention on the existence of bounded solutions and their relationship with other solutions. Beside the study of the equation on the usual domain N 0 , it is also studied on the neglected ones Z \ N 2 and Z . A natural problem is to develop the methods and ideas in the paper so that they can be applied in the study of other related difference equations of second as well as of higher orders on all these domains, which will be one of our further directions in the investigation of difference equations and systems.

Author Contributions

The author has contributed solely to the writing of this paper. He read and approved the manuscript.

Conflicts of Interest

The author declares that he has no conflicts of interest.

References

  1. Andruch-Sobilo, A.; Migda, M. Further properties of the rational recursive sequence xn+1 = axn−1/(b + cxnxn−1). Opusc. Math. 2006, 26, 387–394. [Google Scholar]
  2. Ašić, M.D.; Adamović, D.D. Limit points of sequences in metric spaces. Amer. Math. Monthly 1970, 77, 613–616. [Google Scholar] [CrossRef]
  3. Atkinson, F.V. Discrete and Continuous Boundary Problems; Academic Press: New York, NY, USA, 1964. [Google Scholar]
  4. Banach, S. Sur les opérations dans les ensembles abstraits et leur application aux équations intégrales. Fund. Math. 1922, 3, 133–181. [Google Scholar] [CrossRef]
  5. Berezansky, L.; Braverman, E. On impulsive Beverton-Holt difference equations and their applications. J. Difference Equ. Appl. 2004, 10, 851–868. [Google Scholar] [CrossRef]
  6. Berezansky, L.; Migda, M.; Schmeidel, E. Some stability conditions for scalar Volterra difference equations. Opusc. Math. 2016, 36, 459–470. [Google Scholar] [CrossRef]
  7. Berg, L.; Stević, S. On some systems of difference equations. Appl. Math. Comput. 2011, 218, 1713–1718. [Google Scholar] [CrossRef]
  8. Brand, L. Differential and Difference Equations; John Wiley & Sons, Inc.: New York, NY, USA, 1966. [Google Scholar]
  9. Demidovich, B. Problems in Mathematical Analysis; Mir Publisher: Moscow, Russia, 1989. [Google Scholar]
  10. Diblik, J.; Schmeidel, E. On the existence of solutions of linear Volterra difference equations asymptotically equivalent to a given sequence. Appl. Math. Comput. 2012, 218, 9310–9320. [Google Scholar] [CrossRef]
  11. Diblik, J.; Schmeidel, E.; Ružičková, R. Asymptotically periodic solutions of Volterra system of difference equations. Comput. Math. Appl. 2010, 59, 2854–2867. [Google Scholar] [CrossRef]
  12. Drozdowicz, A.; Popenda, J. Asymptotic behavior of the solutions of the second order difference equation. Proc. Amer. Math. Soc. 1987, 99, 135–140. [Google Scholar] [CrossRef]
  13. Iričanin, B.; Stević, S. Eventually constant solutions of a rational difference equation. Appl. Math. Comput. 2009, 215, 854–856. [Google Scholar] [CrossRef]
  14. Jordan, C. Calculus of Finite Differences; Chelsea Publishing Company: New York, NY, USA, 1956. [Google Scholar]
  15. Krechmar, V.A. A Problem Book in Algebra; Mir Publishers: Moscow, Russia, 1974. [Google Scholar]
  16. Levy, H.; Lessman, F. Finite Difference Equations; Dover Publications: New York, NY, USA, 1992. [Google Scholar]
  17. Migda, J. Mezocontinuous operators and solutions of difference equations. Electron. J. Qual. Theory Differ. Equ. 2016, 2016, 1–16. [Google Scholar] [CrossRef]
  18. Migda, J.; Migda, M. Asymptotic behavior of solutions of discrete Volterra equations. Opusc. Math. 2016, 36, 265–278. [Google Scholar] [CrossRef]
  19. Mitrinović, D.S.; Adamović, D.D. Sequences and Series; Naučna Knjiga: Beograd, Serbia, 1980. (In Serbian) [Google Scholar]
  20. Mitrinović, D.S.; Kečkić, J.D. Methods for Calculating Finite Sums; Naučna Knjiga: Beograd, Serbia, 1984. (In Serbian) [Google Scholar]
  21. Papaschinopoulos, G.; Schinas, C.J. Invariants for systems of two nonlinear difference equations. Differ. Equ. Dyn. Syst. 1999, 7, 181–196. [Google Scholar] [CrossRef]
  22. Papaschinopoulos, G.; Schinas, C.J. Invariants and oscillation for systems of two nonlinear difference equations. Nonlinear Anal. Theory Methods Appl. 2001, 46, 967–978. [Google Scholar] [CrossRef]
  23. Papaschinopoulos, G.; Stefanidou, G. Asymptotic behavior of the solutions of a class of rational difference equations. Int. J. Differ. Equ. 2010, 5, 233–249. [Google Scholar]
  24. Polya, G.; Szegö, G. Aufgaben Und Lehrsätze Aus Der Analysis; Verlag von Julius Springer: Berlin, Germany, 1925. [Google Scholar]
  25. Schmeidel, E. An application of measures of noncompactness in the investigation of boundedness of solutions of second-order neutral difference equations. Adv. Difference Equ. 2013, 2013, 91. [Google Scholar] [CrossRef]
  26. Stević, S. Asymptotic behaviour of second-order difference equation. ANZIAM J. 2004, 46, 157–170. [Google Scholar] [CrossRef]
  27. Stević, S. Solvable subclasses of a class of nonlinear second-order difference equations. Adv. Nonlinear Anal. 2016, 5, 147–165. [Google Scholar] [CrossRef]
  28. Stević, S. Solvable product-type system of difference equations whose associated polynomial is of the fourth order. Electron. J. Qual. Theory Differ. Equ. 2017, 2017, 1–29. [Google Scholar] [CrossRef]
  29. Stević, S. Bounded and periodic solutions to the linear first-order difference equation on the integer domain. Adv. Difference Equ. 2017, 283. [Google Scholar] [CrossRef]
  30. Stević, S. Existence of a unique bounded solution to a linear second order difference equation and the linear first order difference equation. Adv. Difference Equ. 2017, 2017, 169. [Google Scholar] [CrossRef]
  31. Stević, S.; Diblik, J.; Iričanin, B.; Šmarda, Z. On some solvable difference equations and systems of difference equations. Abstr. Appl. Anal. 2012, 2012, 541761. [Google Scholar] [CrossRef]
  32. Stević, S.; Diblik, J.; Iričanin, B.; Šmarda, Z. On the difference equation xn+1 = xnxnk/(xnk+1(a + bxnxnk)). Abstr. Appl. Anal. 2012, 2012, 108047. [Google Scholar] [CrossRef]
  33. Stević, S.; Diblik, J.; Iričanin, B.; Šmarda, Z. On the difference equation xn = anxnk/(bn + cnxn−1xnk). Abstr. Appl. Anal. 2012, 2012, 409237. [Google Scholar]
  34. Stević, S.; Diblik, J.; Iričanin, B.; Šmarda, Z. On a solvable system of rational difference equations. J. Difference Equ. Appl. 2014, 20, 811–825. [Google Scholar] [CrossRef]
  35. Stević, S.; Diblik, J.; Iričanin, B.; Šmarda, Z. Solvability of nonlinear difference equations of fourth order. Electron. J. Differential Equations 2014, 1–14. [Google Scholar]
  36. Stević, S.; Iričanin, B.; Šmarda, Z. On a close to symmetric system of difference equations of second order. Adv. Difference Equ. 2015, 2015, 264. [Google Scholar] [CrossRef]
  37. Stević, S.; Iričanin, B.; Šmarda, Z. On a product-type system of difference equations of second order solvable in closed form. J. Inequal. Appl. 2015, 2015, 327. [Google Scholar]
  38. Darbo, G. Punti uniti in transformazioni a condominio non compacto. Rend. Semin. Mat. Univ. Padova 1955, 24, 84–92. [Google Scholar]

Share and Cite

MDPI and ACS Style

Stević, S. Bounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations. Symmetry 2017, 9, 227. https://doi.org/10.3390/sym9100227

AMA Style

Stević S. Bounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations. Symmetry. 2017; 9(10):227. https://doi.org/10.3390/sym9100227

Chicago/Turabian Style

Stević, Stevo. 2017. "Bounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations" Symmetry 9, no. 10: 227. https://doi.org/10.3390/sym9100227

APA Style

Stević, S. (2017). Bounded Solutions to Nonhomogeneous Linear Second-Order Difference Equations. Symmetry, 9(10), 227. https://doi.org/10.3390/sym9100227

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop