Jump to content

Cassini and Catalan identities: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
Citation bot (talk | contribs)
Altered pages. Formatted dashes. | Use this bot. Report bugs. | Suggested by Abductive | Category:Fibonacci numbers | #UCB_Category 7/48
 
(48 intermediate revisions by 21 users not shown)
Line 1: Line 1:
__notoc__
'''Cassini's identity''' and '''Catalan's identity''' are [[mathematical identities]] for the [[Fibonacci numbers]]. The former is a special case of the latter, and states that for the ''n''th Fibonacci number,
{{short description|Mathematical identities for the Fibonacci numbers}}
'''Cassini's identity''' (sometimes called '''Simson's identity''') and '''Catalan's identity''' are [[identity (mathematics)|mathematical identities]] for the [[Fibonacci number]]s. '''Cassini's identity''', a special case of '''Catalan's identity''', states that for the ''n''th Fibonacci number,
:<math> F_{n-1}F_{n+1} - F_n^2 = (-1)^n.</math>


Note here <math> F_0 </math> is taken to be 0, and <math> F_1 </math> is taken to be 1.
:<math>F_{n-1}F_{n+1} - F_n^2 = (-1)^n.</math>


Catalan's identity generalizes this:
Catalan's identity generalizes this:

:<math>F_n^2 - F_{n-r}F_{n+r} = (-1)^{n-r}F_r^2.</math>
:<math>F_n^2 - F_{n-r}F_{n+r} = (-1)^{n-r}F_r^2.</math>


Vajda's identity generalizes this:
Vajda's identity generalizes this:

:<math>F_{n+i}F_{n+j} - F_{n}F_{n+i+j} = (-1)^nF_{i}F_{j}.</math>
:<math>F_{n+i}F_{n+j} - F_{n}F_{n+i+j} = (-1)^nF_{i}F_{j}.</math>
== History ==


==History==
Cassini's formula was discovered in 1680 by [[Giovanni Domenico Cassini|Jean-Dominique Cassini]], then director of the Paris Observatory, and independently proven by [[Robert Simson]] (1753). [[Eugène Charles Catalan]] found the identity named after him in 1879.
Cassini's formula was discovered in 1680 by [[Giovanni Domenico Cassini]], then director of the Paris Observatory, and independently proven by [[Robert Simson]] (1753).<ref name="Koshy"/> However [[Johannes Kepler]] presumably knew the identity already in 1608.<ref>Miodrag Petkovic: ''Famous Puzzles of Great Mathematicians''. AMS, 2009, {{ISBN|9780821848142}}, S. 30-31 </ref>


Catalan's identity is named after [[Eugène Charles Catalan|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 {{harv|Catalan|1886}}. This explains why some give 1879 and others 1886 as the date for Catalan's identity {{harv|Tuenter|2022|p=314}}.
== Proof by matrix theory ==

A quick proof of Cassini's identity may be given {{harv|Knuth|1997|p=81}} by recognising the [[Sides of an equation|left side of the equation]] as a [[determinant]] of a 2&times;2 matrix of Fibonacci numbers. The result is almost immediate when the matrix is seen to be the {{math|''n''}}th power of a matrix with determinant &minus;1:
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.<ref name="West">Douglas B. West: ''Combinatorial Mathematics''. Cambridge University Press, 2020, p. [https://books.google.com/books?id=doLoDwAAQBAJ&pg=PA61 61]</ref><ref>Steven Vadja: ''Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications''. Dover, 2008, {{ISBN|978-0486462769}}, p. 28 (original publication 1989 at Ellis Horwood)</ref> However, the identity had been published earlier in 1960 by Dustan Everman as problem 1396 in [[The American Mathematical Monthly]],<ref name="Koshy">Thomas Koshy: ''Fibonacci and Lucas Numbers with Applications''. Wiley, 2001, {{ISBN|9781118031315}}, pp. 74-75, 83, 88</ref> and in 1901 by Alberto Tagiuri in [[:it:Periodico di Matematica|Periodico di Matematica]].<ref name="Tagiuri">Alberto Tagiuri: Equation (3) in [https://archive.org/details/periodicodimate08mathgoog/page/n12 Di alcune successioni ricorrenti a termini interi e positivi], Periodico di Matematica 16 (1901), pp. 1–12.</ref>

==Proof of Cassini identity==

===Proof by matrix theory===
A quick proof of Cassini's identity may be given {{harv|Knuth|1997|p=81}} by recognising the [[sides of an equation|left side of the equation]] as a [[determinant]] of a 2&times;2 [[Matrix (mathematics)|matrix]] of Fibonacci numbers. The result is almost immediate when the matrix is seen to be the {{math|''n''}}th power of a matrix with determinant &minus;1:
:<math>F_{n-1}F_{n+1} - F_n^2
:<math>F_{n-1}F_{n+1} - F_n^2
=\det\left[\begin{matrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{matrix}\right]
=\det\left[\begin{matrix}F_{n+1}&F_n\\F_n&F_{n-1}\end{matrix}\right]
=\det\left[\begin{matrix}2&1\\1&0\end{matrix}\right]^n
=\det\left[\begin{matrix}1&1\\1&0\end{matrix}\right]^n
=\left(\det\left[\begin{matrix}2&1\\1&0\end{matrix}\right]\right)^n
=\left(\det\left[\begin{matrix}1&1\\1&0\end{matrix}\right]\right)^n
=(-1)^n.</math>
=(-1)^n.</math>


===Proof by induction===
== References ==
{{no footnotes|date=June 2011}}


Consider the induction statement:
*{{Citation
| title = The Art of Computer Programming, Volume 1: Fundamental Algorithms
| first = Donald Ervin
| last = Knuth
| author-link = Donald Knuth
| publisher = Addison-Wesley
| place = Reading, Mass
| year = 1997
| edition = 3rd
| series = [[The Art of Computer Programming]]
| volume = 1
| isbn = 0-201-89683-4}}.


:<math>F_{n-1}F_{n+1} - F_n^2 = (-1)^n</math>
*{{cite journal
| last1 = Simson
| first1 = R.
| authorlink1 = Robert Simson
| last2 =
| first2 =
| title = An Explication of an Obscure Passage in Albert Girard’s Commentary upon Simon Stevin’s Works
| journal = [[Philosophical Transactions of the Royal Society of London]]
| volume = 48
| issue = 0
| year = 1753
| pages = 368–376
| doi = 10.1098/rstl.1753.0056}}.


The base case <math>n=1</math> is true.

Assume the statement is true for <math>n</math>. Then:

:<math>F_{n-1}F_{n+1} - F_n^2 + F_nF_{n+1} - F_nF_{n+1} = (-1)^n</math>

:<math>F_{n-1}F_{n+1} + F_nF_{n+1} - F_n^2 - F_nF_{n+1} = (-1)^n</math>

:<math>F_{n+1}(F_{n-1} + F_n) - F_n(F_n + F_{n+1}) = (-1)^n</math>

:<math>F_{n+1}^2 - F_nF_{n+2} = (-1)^n</math>

:<math>F_nF_{n+2} - F_{n+1}^2 = (-1)^{n+1}</math>

so the statement is true for all integers <math>n>0</math>.

==Proof of Catalan identity==

We use [[Fibonacci number#Closed-form expression|Binet's formula]], that <math>F_n=\frac{\phi^n-\psi^n}{\sqrt5}</math>, where <math>\phi=\frac{1+\sqrt5}{2}</math> and <math>\psi=\frac{1-\sqrt5}{2}</math>.

Hence, <math>\phi+\psi=1</math> and <math>\phi\psi=-1</math>.

So,

:<math>5(F_n^2 - F_{n-r}F_{n+r})</math>

:<math>= (\phi^n-\psi^n)^2 - (\phi^{n-r}-\psi^{n-r})(\phi^{n+r}-\psi^{n+r})</math>

:<math>= (\phi^{2n} - 2\phi^{n}\psi^{n} +\psi^{2n}) - (\phi^{2n} - \phi^{n}\psi^{n}(\phi^{-r}\psi^{r}+\phi^{r}\psi^{-r}) + \psi^{2n})</math>

:<math>= - 2\phi^{n}\psi^{n} + \phi^{n}\psi^{n}(\phi^{-r}\psi^{r}+\phi^{r}\psi^{-r})</math>

Using <math>\phi\psi=-1</math>,

:<math>= -(-1)^n2 + (-1)^n(\phi^{-r}\psi^{r}+\phi^{r}\psi^{-r})</math>

and again as <math>\phi=\frac{-1}{\psi}</math>,

:<math>= -(-1)^n2 + (-1)^{n-r}(\psi^{2r}+\phi^{2r})</math>

The [[Lucas_number#Relationship_to_Fibonacci_numbers|Lucas number]] <math>L_n</math> is defined as <math>L_n=\phi^n+\psi^n</math>, so

:<math>= -(-1)^n2 + (-1)^{n-r}L_{2r}</math>

Because <math>L_{2n} = 5 F_n^2 + 2(-1)^n</math>

:<math>= -(-1)^n2 + (-1)^{n-r}(5 F_r^2 + 2(-1)^r)</math>

:<math>= -(-1)^n2 + (-1)^{n-r}2(-1)^r + (-1)^{n-r}5 F_r^2</math>

:<math>= -(-1)^n2 + (-1)^n2 + (-1)^{n-r}5 F_r^2</math>

:<math>= (-1)^{n-r}5 F_r^2</math>

Cancelling the <math>5</math>'s gives the result.

== Notes ==
<references/>

==References==
*{{cite journal
| last = Catalan
| first = Eugène-Charles
| title = CLXXXIX. — Sur la série de Lamé
| journal = Mémoires de la Société Royale des Sciences de Liège, Deuxième Série
| volume = 13
| date = December 1886
| pages = 319–321
}}
*{{Citation
| last = Knuth
| first = Donald Ervin
| title = The Art of Computer Programming, Volume 1: Fundamental Algorithms
| author-link = Donald Knuth
| publisher = Addison-Wesley
| place = Reading, Mass
| year = 1997
| edition = 3rd
| series = [[The Art of Computer Programming]]
| volume = 1
| isbn = 0-201-89683-4
}}
*{{cite journal
| last1 = Simson
| first1 = R.
| authorlink1 = Robert Simson
| title = An Explication of an Obscure Passage in Albert Girard's Commentary upon Simon Stevin's Works
| journal = [[Philosophical Transactions of the Royal Society of London]]
| volume = 48
| year = 1753
| pages = 368–376
| doi = 10.1098/rstl.1753.0056| doi-access = free
}}
*{{cite journal
| last1 = Tuenter
| first1 = Hans J. H.
| title = Fibonacci Summation Identities arising from Catalan's Identity
| journal = [[Fibonacci_Quarterly|The Fibonacci Quarterly]]
| volume = 60
| issue = 4
| date = November 2022
| pages = 312–319
| mr = 4539699
| zbl = 1512.11025
}}
*{{cite journal
*{{cite journal
| last1 = Werman
| last1 = Werman
| first1 = M.
| first1 = M.
| authorlink2 = Doron Zeilberger
| authorlink2 = Doron Zeilberger
| last2 = Zeilberger
| last2 = Zeilberger
| first2 = D.
| first2 = D.
| title = A bijective proof of Cassini's Fibonacci identity
| title = A bijective proof of Cassini's Fibonacci identity
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
| volume = 58
| volume = 58
| issue = 1
| issue = 1
| year = 1986
| year = 1986
| pages = 109
| pages = 109
| mr = 0820846
| mr = 0820846
| doi = 10.1016/0012-365X(86)90194-9}}
| doi = 10.1016/0012-365X(86)90194-9| doi-access = free
}}


== External links ==
==External links==
*[https://planetmath.org/ProofOfCassinisIdentity Proof of Cassini's identity]
*[https://planetmath.org/ProofOfCassinisIdentity Proof of Cassini's identity]
*[https://planetmath.org/ProofOfCatalansIdentity Proof of Catalan's Identity]
*[https://planetmath.org/ProofOfCatalansIdentity Proof of Catalan's Identity]
Line 76: Line 165:
[[Category:Fibonacci numbers]]
[[Category:Fibonacci numbers]]
[[Category:Articles containing proofs]]
[[Category:Articles containing proofs]]
[[Category:Giovanni Domenico Cassini]]

Latest revision as of 18:05, 23 August 2024

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

Note here is taken to be 0, and is taken to be 1.

Catalan's identity generalizes this:

Vajda's identity generalizes this:

History

[edit]

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

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, p. 314).

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.[3][4] However, the identity had been published earlier in 1960 by Dustan Everman as problem 1396 in The American Mathematical Monthly,[1] and in 1901 by Alberto Tagiuri in Periodico di Matematica.[5]

Proof of Cassini identity

[edit]

Proof by matrix theory

[edit]

A quick proof of Cassini's identity may be given (Knuth 1997, p. 81) 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:

Proof by induction

[edit]

Consider the induction statement:

The base case is true.

Assume the statement is true for . Then:

so the statement is true for all integers .

Proof of Catalan identity

[edit]

We use Binet's formula, that , where and .

Hence, and .

So,

Using ,

and again as ,

The Lucas number is defined as , so

Because

Cancelling the 's gives the result.

Notes

[edit]
  1. ^ a b Thomas Koshy: Fibonacci and Lucas Numbers with Applications. Wiley, 2001, ISBN 9781118031315, pp. 74-75, 83, 88
  2. ^ Miodrag Petkovic: Famous Puzzles of Great Mathematicians. AMS, 2009, ISBN 9780821848142, S. 30-31
  3. ^ Douglas B. West: Combinatorial Mathematics. Cambridge University Press, 2020, p. 61
  4. ^ Steven Vadja: Fibonacci and Lucas Numbers, and the Golden Section: Theory and Applications. Dover, 2008, ISBN 978-0486462769, p. 28 (original publication 1989 at Ellis Horwood)
  5. ^ Alberto Tagiuri: Equation (3) in Di alcune successioni ricorrenti a termini interi e positivi, Periodico di Matematica 16 (1901), pp. 1–12.

References

[edit]
[edit]