No label defined (Q4483705)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1918808
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1918808 |
Statements
8 October 2003
0 references
Fibonacci number
0 references
Lucas number
0 references
matrix
0 references
eigenvalue
0 references
Chebyshev polynomial
0 references
0.86165184
0 references
0.7796885
0 references
0.7748706
0 references
0.77468944
0 references
Let \(F_n\) be the Fibonacci numbers defined recurrently by \(F_{n+2}= F_{n+1}+ F_n\) with \(F_0= 0\) and \(F_1= 0\), then the formula \(F_n= \prod^{n-1}_{k=1}(1- 2i\cos{k\pi\over n})\), \(n\geq 2\) can be proved by considering the roots of Fibonacci polynomials [\textit{V. E. Hoggatt jun.} and \textit{C. T. Long}, Fibonacci Q. 12, 113--120 (1974; Zbl 0284.10003)]. This paper gives a new proof using matrices and the Chebyshev polynomials as follows. First let \(M(n)\) be the \(n\times n\) tridiagonal matrix with only non-zero entries \(m_{k,k}= 1\), \(1\leq k\leq n\), and \(m_{k-1,k}= m_{k,k-1}= i\), \(2\leq k\leq n\), then \(F_n= \text{det\,}M(n- 1)\). On the other hand, \(\text{det\,}M(n)\) equals the product of all its eigenvalues. If we set \(M(n)= I+ iG(n)\), then \(\text{det\,}M(n)= \prod^n_{k=1} (1+ i\lambda_k)\), where \(\lambda_k\)'s are all eigenvalues of \(G(n)\). By the transformation \(\lambda=-2x\), it is can be shown that \(\text{det}(G(n)-\lambda I)\) is just the Chebyshev polynomial of the second kind of degree \(n\), so that \(\lambda_k= -2\cos{k\pi\over n+1}\), \(k= 1,2,\dots, n\), and then the formula above follows. Using a similar method and the Chebyshev polynomials of the first kind, the author also gets a complex factorization of the Lucas numbers \(L_n\), which are defined by the same recurrence relation as the Fibonacci numbers and have initial terms \(L_0= 2\), \(L_1= 1\).
0 references