In mathematics, in combinatorics, the Li Shanlan identity (also called Li Shanlan's summation formula) is a certain combinatorial identity attributed to the nineteenth century Chinese mathematician Li Shanlan. Since Li Shanlan is also known as Li Renshu (his courtesy name), this identity is also referred to as the Li Renshu identity. This identity appears in the third chapter of Duoji bilei (垛积比类 / 垛積比類, meaning summing finite series), a mathematical text authored by Li Shanlan and published in 1867 as part of his collected works. A Czech mathematician Josef Kaucky published an elementary proof of the identity along with a history of the identity in 1964. Kaucky attributed the identity to a certain Li Jen-Shu. From the account of the history of the identity, it has been ascertained that Li Jen-Shu is in fact Li Shanlan. Western scholars had been studying Chinese mathematics for its historical value; but the attribution of this identity to a nineteenth-century Chinese mathematician sparked a rethink on the mathematical value of the writings of Chinese mathematicians.
The identity The Li Shanlan identity states that
∑ k = 0 p ( p k ) 2 ( n + 2 p − k 2 p ) = ( n + p p ) 2 {\displaystyle \sum _{k=0}^{p}{p \choose k}^{2}{{n+2p-k} \choose {2p}}={{n+p} \choose p}^{2}} . Li Shanlan did not present the identity in this way. He presented it in the traditional Chinese algorithmic and rhetorical way.
Proofs of the identity Li Shanlan had not given a proof of the identity in Duoji bilei. The first proof using differential equations and Legendre polynomials, concepts foreign to Li, was published by Pál Turán in 1936, and the proof appeared in Chinese in Yung Chang's paper published in 1939. Since then at least fifteen different proofs have been found. The following is one of the simplest proofs. The proof begins by expressing ( n q ) {\displaystyle n \choose q} as Vandermonde's convolution:
( n q ) = ∑ k = 0 q ( n − p k ) ( p q − k ) {\displaystyle {n \choose q}=\sum _{k=0}^{q}{{n-p} \choose k}{p \choose {q-k}}}
Pre-multiplying both sides by ( n p ) {\displaystyle n \choose p} ,
( n p ) ( n q ) = ∑ k = 0 q ( n p ) ( n − p k ) ( p q − k ) {\displaystyle {n \choose p}{n \choose q}=\sum _{k=0}^{q}{n \choose p}{{n-p} \choose k}{p \choose {q-k}}} . Using the following relation
… excerpt ends here. Continue reading the full article.
