A New Identity Involving the Chebyshev Polynomials

In this paper, firstly, we introduced a second order non-linear recursive sequence, then we use this sequence and the combinatorial methods to perform a deep study on the computational problem concerning one kind sums, which includes the Chebyshev polynomials. This makes it possible to simplify a class of complex computations involving the second type Chebyshev polynomials into a very simple problem. Finally, we give a new and interesting identity for it.

are the Chebyshev polynomials in the second type U n (x). Their general expressions are: ∑ k=0 (−1) k (n − k − 1)! k!(n − 2k)! · (2x) n−2k , (|x| < 1) and: The generating functions of these polynomials are: and: It rapidly becomes apparent that T n (x) and U n (x) are orthogonal polynomials. For example, Being an essential part in both the theory and the application of mathematics, these polynomials have attracted not only the number theory experts, but also amateurs of mathematics to study their properties, which produced many interesting questions and many papers. In particular, Zhang Wenpeng [1] proved an identity including the Chebyshev polynomials and their derivative. That is: where the sum runs over all (h + 1)-dimension nonnegative integer coordinates (a 1 , a 2 , · · · , a h+1 ) such that a 1 + a 2 + · · · + a h+1 = n, and U n+h (x) denotes the h-order derivative of U n+h (x) with respect to x. Then using this formula, Zhang Wenpeng [1] obtained a series of identities that consists of the Fibonacci numbers and Lucas numbers. In another direction, Ma Rong and Zhang Wenpeng [2] proved some power sums identities which were based on the nice properties of the Chebyshev polynomials. Wang Siyi [3] used the mathematical induction to prove an identity, which represent the convolution sums (2) as U n (x). That is: where R(n, k, x) and S(n, k, x) are two computable polynomials of n, k, and x with integral coefficients. Some related theory and application results can also be found in [4][5][6][7][8][9][10][11][12], so they will not be repeated here.
In this paper, as a note from [1][2][3], we will introduce a new second order non-linear recursive sequence C(h, j), then we will use this sequence to give a new and interesting expression for (2). First, we will give the main result as follows: Theorem 1. Let h be a positive integer. If n ≥ 0 is any integer, we obtain the identity: Compared with references [1] and [3], our Theorem 1 is very advantageous, it gives the specific form of expressing (2) as U n (x). Especially take n = 0, from this theorem we now deduce the following: Corollary 1. If any positive integer h such that h ≥ 1, we get the identity: In particular, if taking h = 2 and 3, a slight modification of the foregoing Theorem 1 enables us to give: Corollary 2. Given any integer n ≥ 0, we obtain:

Corollary 3.
If n ≥ 0 is any integer, we deduce: To further illustrate the application of our results, we give a numerical example. Taking x = i 2 in Corollary 2, where i is an imaginary unit, i.e., i 2 = −1. Note that the identity (see [1]) where F n denotes the famous Fibonacci numbers defined by F 0 = 0, F 1 = 1, F 2 = 1, and F n+1 = F n + F n−1 for all positive integers n ≥ 1.
From this result and Corollary 2 we may immediately deduce the following: This shows that our results are closely related to Fibonacci numbers. Therefore, they have important application value. In other words, by our Theorem 1 we can deduce a series of important identities involving Fibonacci numbers, these fully reflect the importance of our result.
Some notes: To further understand the properties of the sequence C(h, j), here we give first several values of C(h, j) as follows: C(1, 1) = 1.

Two Simple Lemmas
In this part, two necessary lemmas in the proof process of our theorem will be given. The first one and its detailed proof are as follows: Lemma 1. Let f (t) = 1 1−2xt+t 2 ; if n is any positive integer and x and t are any real numbers such that |t| < |x|, we have the identity: where C(n, i) is the same as in Theorem 1 and f (h) (t) denotes the h-order derivative of f (t) with respect to t.
Proof. Lemma 1 follows from the mathematical induction. Using the properties of the derivative, we find: and: That is, and: (3) and (4) means that Lemma 1 is true when n = 1, 2 . We shall assume that Lemma 1 also holds for 2 ≤ n = h. We can obtain, Then, from (3), (5) and the definitions of C(k, i) and the derivative, we have: From (6), we may immediately deduce that: That is, Lemma 1 also holds if n = h + 1. Now, the conclusion of Lemma 1 follows from the mathematical induction.
If we let g(t) = 1−xt 1−2xt+t 2 . Then we are not easy to deduce a formula similar to Lemma 1. That is why we have not give a corresponding result of the first type Chebyshev polynomials in the theorem.

Lemma 2.
For any positive integers h and k, the power series expansion is given by the formula: for all real numbers t and x with |t| < |x|.
Proof. Actually, this result is easily deduced by the properties of the power series. Firstly, the formula: can be derived from the definition of the second type Chebyshev polynomials U n (x). Then, let h be any positive integer; applying the properties of the power series, we acquire: Second, if k is a positive integer. Then, for all real t and x, which satisfied |t| < |x|, the power series expansion is given by: 1 Combining (7), (8) and concerned with the multiplicative properties of the power series, we obtain: That is, Lemma 2 has been proven.

Proof of the Theorem
In Section 2, we proved two lemmas that play a significant role in the proof process of the theorem. We turn now to a detailed exhibit of Theorem 1. In fact, if h is a positive integer, combined with the properties of the power series, we use (1), Lemma 1 and the definition of f (t) to get: In another way, applying Lemma 2, we can also obtain: Combining (9), (10) and Lemma 1, as well as comparing the coefficients of the power series, we can instantly deduce the identity: In summary, we have completed the proof of Theorem 1.

Conclusions
The main result of this paper is Theorem 1. It gives a new representation of the summation (2). The feature of this theorem is simple and clear, and its right side is represented as a linear combination of U i (x), which is very easy to calculate. Furthermore, our research methods can also be applied to many other special polynomials; for instance, Bell polynomials, Fibonacci polynomials, Lucas polynomials, etc.
Corollary 1 profoundly reveals the close relationship between the second type Chebyshev polynomials themselves. That is to say, it characterizes the relationship between the standard orthogonal basis {1, x, x 2 , x 3 , · · · , x h } and the orthogonal basis {U 0 (x), U 1 (x), U 3 (x), · · · , U h (x)}.
For the first type Chebyshev polynomials T n (x), we naturally ask whether there exists a similar formula as in our Theorem 1. This still is an open problem. It will be studied in the future.