Cassini and Catalan identities

Short description: Mathematical identities for the Fibonacci numbers

Cassini's identity (sometimes called Simson's identity), Catalan's identity and Vajda's identity are mathematical identities for the Fibonacci numbers. Cassini's identity, a special case of the other two, states that for the nth Fibonacci number,

$F_{n-1}{F}_{n+1}-F_n^2=(-1{)}^n.$

Note here $F_0$ is taken to be 0, and $F_1$ is taken to be 1.

Catalan's identity generalizes this to allow $r\ne 1$:

$F_n^2-F_{n-r}{F}_{n+r}=(-1{)}^{n-r}{F}_r^2.$

Vajda's identity further generalizes this to allow $m\ne n$:

$F_m{F}_n-F_{m-r}{F}_{n+r}={\left(-1\right)}^{m-r}{F}_r{F}_{r+n-m},$

also written as:

$F_{n+i}{F}_{n+j}-F_n{F}_{n+i+j}=(-1{)}^n{F}_i{F}_j.$

History

Cassini's formula was discovered in 1680 by Giovanni Domenico Cassini, then director of the Paris Observatory, and independently proven by Robert Simson (1753). However Johannes Kepler presumably knew the identity already in 1608.

Catalan's identity is named after Eugène Catalan (1814–1894). It can be found in one of his private research notes, entitled "Sur la série de Lamé" and dated October 1879. However, the identity did not appear in print until December 1886 as part of his collected works (Catalan 1886). This explains why some give 1879 and others 1886 as the date for Catalan's identity (Tuenter 2022).

The Hungarian-British mathematician Steven Vajda (1901–95) published a book on Fibonacci numbers (Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications, 1989) which contains the identity carrying his name. However, the identity had been published earlier in 1960 by Dustan Everman as problem 1396 in The American Mathematical Monthly, and in 1901 by Alberto Tagiuri in Periodico di Matematica.

Proof of Cassini identity

Proof by matrix theory

A quick proof of Cassini's identity may be given (Knuth 1997) by recognising the left side of the equation as a determinant of a 2×2 matrix of Fibonacci numbers. The result is almost immediate when the matrix is seen to be the nth power of a matrix with determinant −1:

$F_{n-1}{F}_{n+1}-F_n^2=\det \left[\begin{array}{cc}{F}_{n+1}& F_n\\ F_n& F_{n-1}\end{array}\right]=\det {\left[\begin{array}{cc}1& 1\\ 1& 0\end{array}\right]}^n={(\det \left[\begin{array}{cc}1& 1\\ 1& 0\end{array}\right])}^n=(-1{)}^n.$

Proof by induction

Consider the induction statement:

$F_{n-1}{F}_{n+1}-F_n^2=(-1{)}^n$

The base case $n=1$ is true.

Assume the statement is true for $n$. Then:

$F_{n-1}{F}_{n+1}-F_n^2+F_n{F}_{n+1}-F_n{F}_{n+1}=(-1{)}^n$

$F_{n-1}{F}_{n+1}+F_n{F}_{n+1}-F_n^2-F_n{F}_{n+1}=(-1{)}^n$

$F_{n+1}(F_{n-1}+F_n)-F_n(F_n+F_{n+1})=(-1{)}^n$

$F_{n+1}^2-F_n{F}_{n+2}=(-1{)}^n$

$F_n{F}_{n+2}-F_{n+1}^2=(-1{)}^{n+1}$

so the statement is true for all integers $n>0$.

Proof of Catalan identity

We use Binet's formula, that $F_n=\frac{{\varphi }^n-{\psi }^n}{\sqrt{5}}$, where $\varphi =\frac{1+\sqrt{5}}{2}$ and $\psi =\frac{1-\sqrt{5}}{2}$.

Hence, $\varphi +\psi =1$ and $\varphi \psi =-1$.

So,

$5(F_n^2-F_{n-r}{F}_{n+r})$

$=({\varphi }^n-{\psi }^n{)}^2-({\varphi }^{n-r}-{\psi }^{n-r})({\varphi }^{n+r}-{\psi }^{n+r})$

$=({\varphi }^{2n}-2{\varphi }^n{\psi }^n+{\psi }^{2n})-({\varphi }^{2n}-{\varphi }^n{\psi }^n({\varphi }^{-r}{\psi }^r+{\varphi }^r{\psi }^{-r})+{\psi }^{2n})$

$=-2{\varphi }^n{\psi }^n+{\varphi }^n{\psi }^n({\varphi }^{-r}{\psi }^r+{\varphi }^r{\psi }^{-r})$

Using $\varphi \psi =-1$,

$=-(-1{)}^{n}2+(-1{)}^n({\varphi }^{-r}{\psi }^r+{\varphi }^r{\psi }^{-r})$

and again as $\varphi =\frac{-1}{\psi }$,

$=-(-1{)}^{n}2+(-1{)}^{n-r}({\psi }^{2r}+{\varphi }^{2r})$

The Lucas number $L_n$ is defined as $L_n={\varphi }^n+{\psi }^n$, so

$=-(-1{)}^{n}2+(-1{)}^{n-r}{L}_{2r}$

Because $L_{2n}=5F_n^2+2(-1{)}^n$

$=-(-1{)}^{n}2+(-1{)}^{n-r}(5F_r^2+2(-1{)}^r)$

$=-(-1{)}^{n}2+(-1{)}^{n-r}2(-1{)}^r+(-1{)}^{n-r}5F_r^2$

$=-(-1{)}^{n}2+(-1{)}^{n}2+(-1{)}^{n-r}5F_r^2$

$=(-1{)}^{n-r}5F_r^2$

Cancelling the $5$'s gives the result.

References

• Catalan, Eugène-Charles (December 1886). "CLXXXIX. — Sur la série de Lamé". Mémoires de la Société Royale des Sciences de Liège. Deuxième Série 13: 319–321. 
• Knuth, Donald Ervin (1997), The Art of Computer Programming, Volume 1: Fundamental Algorithms, The Art of Computer Programming, 1 (3rd ed.), Reading, Mass: Addison-Wesley, ISBN 0-201-89683-4 
• Simson, R. (1753). "An Explication of an Obscure Passage in Albert Girard's Commentary upon Simon Stevin's Works". Philosophical Transactions of the Royal Society of London 48: 368–376. doi:10.1098/rstl.1753.0056. 
• Tuenter, Hans J. H. (November 2022). "Fibonacci Summation Identities arising from Catalan's Identity". The Fibonacci Quarterly 60 (4): 312–319. doi:10.1080/00150517.2022.12427460. 
• Werman, M.; Zeilberger, D. (1986). "A bijective proof of Cassini's Fibonacci identity". Discrete Mathematics 58 (1): 109. doi:10.1016/0012-365X(86)90194-9. 

External links

• Proof of Cassini's identity
• Proof of Catalan's Identity
• Catalan's Identity
• Cassini formula for Fibonacci numbers
• Fibonacci and Phi Formulae