Solvability of a class of hyperbolic-cosine-type difference equations

*Correspondence: sstevic@ptt.rs 1Mathematical Institute of the Serbian Academy of Sciences, Knez Mihailova 36/III, 11000 Beograd, Serbia 2Department of Medical Research, China Medical University Hospital, China Medical University, Taichung 40402, Taiwan, Republic of China Full list of author information is available at the end of the article Abstract We describe a method for constructing one of the basic classes of solvable hyperbolic-cosine-type difference equations, generalizing a known difference equation by Laplace in a natural way.


Introduction
Let N, Z, R, C be the sets of natural, whole, real, and complex numbers, respectively, and N 0 = N ∪ {0}. If k, l ∈ Z, then j = k, l stands for the set of all j ∈ Z such that k ≤ j ≤ l.
Finding closed-form formulas for solutions to difference equations is one of the basic problems in the area. The equation y n+2 = ay n+1 + by n , n ∈ N 0 , when b = 0 and a 2 +4b = 0, was solved by de Moivre in [1] (see also [2]). He found a formula for solution to equation (1), which is called the de Moivre formula for solutions to linear homogeneous second-order difference equation with constant coefficients, which is one of the first nontrivial results on solvability of difference equations. Before it, some special cases of equation (1) had been solved in [3]. These results attracted some attention, and soon after that Bernoulli in [4] found another method for solving linear difference equations with constant coefficients. A presentation of some old results on solvability can be found in [5]. For some later results see [6,7], as well as [8], where many classes of difference equations and systems were solved. For some twentieth century presentations of the theory, see, for example, [9][10][11][12][13]. Some recent results on solvability of difference equations and systems have been obtained and guessed by computer packages for symbolic calculations. They can help in getting or guessing some closed-form formulas for solutions to the equations and systems, but using only such tools could also produce some issues (see some comments, e.g., in [14][15][16][17]). This has been one of the reasons which motivated us to conduct more serious investigations on solvability of difference equations and systems. Recent investigations show that still a great majority of papers on solvability use some substitutions of various complexity, which transform difference equations and systems to known solvable ones (see, for example, [14,[18][19][20][21][22][23][24][25][26] and the references therein). It should be mentioned that solvable difference equations and systems have many applications (see, e.g., [2, 4, 7-10, 12, 27-29]). For invariants for difference equations and systems, and their applications in solvability, see, for example, [30][31][32][33][34][35].
Recently, solvability of the so-called hyperbolic-cotangent-type difference equations, as well as of the corresponding systems of difference equations, has been studied (see [22][23][24][25][26]). The difference equations and systems therein resemble the hyperbolic-cotangent sum formula which has been a good hint for solvability of the equations and systems. Generally speaking, the difference equations and systems which resemble some trigonometric or hyperbolic trigonometric formulas are natural candidates to be solvable. This is an observation known to mathematicians for a long time. Now, as a motivation for the study, we present a known example along with the most important details related to solvability of the equation in the example.
Example 1 The following difference equation was already known to Laplace [8]. He noticed that equation (2) is solvable. Namely, if x 0 ∈ C, then there is a ∈ C \ {0} such that (see, e.g., [36]). By using (3) in (2), then repeating the procedure, he noticed that and concluded which is easily proved by induction. Laplace did not conduct further analysis of solutions to equation (2).
In what follows we mention several simple folklore things related to solvability of the equation in the case when x 0 is a real number. If x 0 ≥ 2, then x 0 can be written in the form given in (3) for some a > 0. For x 0 = 2, we have x 1 = 2, and by the method of induction, constant solution x n = 2 for every n ∈ N 0 is easily obtained. In this case there is unique a such that (3) holds, namely a = 1. If x 0 > 2, then there are two positive values of a such that (3) holds. They are the roots of the quadratic polynomial t 2x 0 t + 1, that is, If one of the numbers a 1,2 is denoted by a, by the Viète formulas, we see that the second one is 1/a. So, since formula (4) is invariant under the transformation a → 1/a, whichever of these two numbers is used, the formula is always obtained. By combining (4) and (5), we see that the solution to equation (2) in this case can be written as follows: This means that this case is reduced to the previous one. Namely, if for some b > 0, then From (6) and b 1 = 1/b 2 . Using this in (7), we get If a > 0, note that (4) can be written in the following form: x n = e 2 n ln a + 1 e 2 n ln a = 2 cosh 2 n ln a = 2 cosh 2 n a , n ∈ N 0 , where a = ln a. This means that if x 0 = 2 cosh a, then x n = 2 cosh(2 n a), n ∈ N 0 . Bearing in mind the form of formula (9), we see that equation (2) is closely related to the hyperbolic cosine function. This connection is not so strange at all. Namely, by using the change of variables x n = 2x n , n ∈ N 0 , in equation (2), it is transformed to the following one:x n+1 = 2x 2 n -1, n ∈ N 0 , which resembles the formula cosh 2x = 2 cosh 2 x -1.
Because of this, it is natural to say that equation (2) in the case |x 0 | ≥ 2 is an example of hyperbolic-cosine-type difference equations.
, then x 0 can be written in the form given in (3) for some a = e iθ , where θ ∈ [0, 2π). In this case we have x 0 = 2 cos θ , whereas from (4) we get Hence, in the case x 0 ∈ [-2, 2], equation (2) is an example of cosine-type difference equations.
A natural problem is to try to find related hyperbolic-cosine-type difference equations, which are also solvable. This problem seems classical one, but we could not find a complete solution to the problem in the literature so far. Beside this, it is good to have all the things, some of which seem scattered in the literature, in the same place. Hence, we consider here the problem in detail. We show that there is a natural sequence of hyperbolic-cosine-type difference equations which are solvable in closed form and describe a simple constructive way for obtaining the sequence of equations.

A basic class of solvable hyperbolic-cosine-type difference equations
In this section we explain how a natural class/sequence of hyperbolic-cosine-type difference equations related to equation (2) is obtained, which are also solvable.

Basic ideas and equations
First, note that the main thing connected to solvability of equation (2) is the fact that the following relation holds: for every a ∈ C \ {0}, which is a simple, but no doubt very useful, relation between the quantities for every a ∈ C \ {0}.
Let the sequence (x n ) n∈N 0 be a solution to the following difference equation: and x 0 ∈ C. Write the initial value x 0 in the form in (3). Then we have and by a simple inductive argument, we obtain The corresponding consideration in Example 1 shows that equation (12) when |x 0 | ≥ 2 is also an example of a hyperbolic-cosine-type difference equation, which is solvable. Moreover, we see that the following result holds. (12). Then the following statements hold:

Proposition 1 Consider equation
(a) If x 0 ∈ C is given by (3), then the solution to the equation is given by (13).

then the solution to the equation is given by
(c) If x 0 ≤ -2, then the solution to the equation is given by (d) If |x 0 | ≤ 2 and x 0 = 2 cos θ for some θ ∈ [0, 2π), then the solution to the equation is given by x n = 2 cos 3 n θ , n ∈ N 0 .
Following the above idea, we can try to express the quantity I 4 in terms of I 1 in a similar way, and then use the relation in order to obtain another solvable difference equation. Namely, we have Let the sequence (x n ) n∈N 0 be a solution to the following difference equation: and x 0 ∈ C.
Write the initial value x 0 in the form in (3). Then we have and by a simple inductive argument, we obtain for n ∈ N 0 . So, equation (15) is also an example of a hyperbolic-cosine-type difference equation, which is solvable. Moreover, we see that the following result holds. (15). Then the following statements hold:

Proposition 2 Consider equation
(a) If x 0 ∈ C is given by (3), then the solution to the equation is given by (16).

general solution to the equation is given by
(c) If x 0 ≤ -2, general solution to the equation is given by the following formula: , n ∈ N. The corresponding relation between I 5 and I 1 is the following: a + 1 a 5 = a 5 + 1 a 5 + 5 a 3 + 1 a 3 + 10 a + 1 a = a 5 + 1 where in the last equality we have used relation (11). Let the sequence (x n ) n∈N 0 be a solution to the following difference equation: and x 0 ∈ C. Write the initial value x 0 in the form in (3). Then we have and by a simple inductive argument, we obtain x n = a 5 n + 1 a 5 n , n ∈ N 0 . (19) So, equation (18) is another example of a hyperbolic-cosine-type difference equation, which is solvable. Moreover, we see that the following result holds.

Proposition 3
Consider equation (18). Then the following statements hold: (a) If x 0 ∈ C is given by (3), then the solution to the equation is given by (19).

general solution to the equation is given by
(c) If x 0 ≤ -2, general solution to the equation is given by the following formula: (d) If |x 0 | ≤ 2 and x 0 = 2 cos θ for some θ ∈ [0, 2π), then the solution to the equation is given by The corresponding relation between I 6 and I 1 is the following: where in the last equality we have used (10) and (14). Let the sequence (x n ) n∈N 0 be a solution to the following difference equation: and x 0 ∈ C. Write the initial value x 0 in the form in (3). Then we have and by a simple inductive argument, we obtain x n = a 6 n + 1 a 6 n , n ∈ N 0 .
So, equation (21) is another example of a hyperbolic-cosine-type difference equation, which is solvable on a domain. Moreover, we see that the following result holds. (21). Then the following statements hold: (a) If x 0 ∈ C is given by (3), then the solution to the equation is given by (22). (b) If x 0 ≥ 2, general solution to the equation is given by

Proposition 4 Consider equation
(c) If x 0 ≤ -2, general solution to the equation is given by the following formula: (d) If |x 0 | ≤ 2 and x 0 = 2 cos θ for some θ ∈ [0, 2π), then the solution to the equation is given by x n = 2 cos 6 n θ , n ∈ N 0 .
Hence, it is of some interest to find a polynomial class (P k ) k∈N containing them.
To do this, it should be said that a very useful fact related to the sequence of polynomials P k (t), k ∈ N, is that they satisfy a linear recursive relation of second order. Namely, let Since a k + 1 a k a + 1 a = a k+1 + 1 a k+1 + a k-1 + 1 a k-1 , we have P k+1 (t) -P 1 (t)P k (t) + P k-1 (t) = 0, that is, for k ≥ 2, which is the desired recursive relation. From this, since initial values are and c 2 = 1 By using (30) and (31) in (28), we have for k ∈ N, which is the desired closed-form formula for P k .
Remark 2 Related recursive relations to the one in (25) appeared frequently in mathematics. A close relative to it is the following recursive relation: with the initial conditions P 0 (t) = 1 and P 1 (t) = t, defining Chebyshev polynomials, which are usually denoted by T k (t).
From the above consideration similar to Example 1, the following result is obtained, which completely solves the solvability problem for the class of difference equations in (23). (23), where k ∈ N \ {1} and the polynomial P k is given by (32). Then the following statements hold:

Theorem 1 Consider equation
(a) If x 0 ∈ C is given by (3), then the solution to the equation is given by x n = a k n + 1 a k n , n ∈ N 0 .  given by x n = 2 cos k n θ , n ∈ N 0 .