PlanetMath: generating function for the Catalan numbers

(more info)

Math for the people, by the people.

donor list - find out how

Main Menu

sections Encyclopædia
Papers
Books
Expositions

meta Requests (236)
Orphanage
Unclass'd (1)
Unproven (540)
Corrections (46)
Classification

talkback Polls
Forums
Feedback
Bug Reports

downloads Snapshots
PM Book

information News
Docs
Wiki
ChangeLog
TODO List
Copyright
About

generating function for the Catalan numbers

(Derivation)

This article derives the formula $$ \sum C_nx^n=\frac{1-\sqrt{1-4x}}{2x $$ for the generating function for the Catalan numbers, given in the parent article, in two different ways.

A Dyck path is a lattice path in the Euclidean plane from $(0,0)$ to $(2n,0)$ whose steps are either $(1,1)$ or $(1,-1)$ , i.e. either upwards diagonals or downwards diagonals, and which never goes below the $x$ -axis. Here are two Dyck paths:

$\xy<0cm,.6cm>\entrymodifiers={[o]}\xymatrix @R1pc@C1pc{ &&\bullet \ar@{-}[ld] \a... ...&\bullet \ar@{-}[ld] \ar@{-}[rd]\ \bullet & & & & \bullet & & \bullet } \endxy$ $\displaystyle \qquad\ \qquad\$ $\xy<0cm,.6cm>\entrymodifiers={[o]}\xymatrix @R1pc@C1pc{ &&&&\bullet \ar@{-}[ld] ... ...ld]&&\bullet&& \bullet\ar@{-}[rd]&\ \bullet && \bullet &&&&&& \bullet } \endxy$ $\displaystyle$

If you rotate a Dyck path counterclockwise by $45^{\circ}$ and then reflect it in the line $x=y$ , the result is a lattice path from $(0,0)$ to $(n,n)$ that never goes above the diagonal. One can also think of such a path as a path from $(1,0)$ to $(n+1,n)$ that never touches or crosses the diagonal. As the article on ballot numbers explains, these paths are counted by the Catalan numbers, and thus the number of Dyck paths of length $2n$ (or Dyck paths of semilength $n$ ) is equal to $C_n$ , the $n^{\mathrm{th}}$ Catalan number.

Note that any Dyck path has a unique decomposition as follows. Every Dyck path returns to the $x$ -axis at some point (possibly at its end). Split the path at the first such point. Then the original path consists of an up step (the first step of the path), an arbitrary (perhaps empty) Dyck path, a down step returning to the $x$ -axis, and then another arbitrary (perhaps empty) Dyck path. Considering the first example above, this decomposition looks like this:

$\xy<0cm,.6cm>\xymatrix @R1pc@C1pc{ &&*[o]{\bullet} \ar@{-}[ld] \ar@{-}[rd]\ &.... ...t} \ar@{-}[ld] \ar@{-}[rd]\ *[o]{\bullet} & & & & . & & *[o]{\bullet} } \endxy$ $\displaystyle$

So a Dyck path is either empty, or consists of an up/down and two arbitrary Dyck paths. If one thinks about the lengths of the paths involved, it is clear that in terms of the generating function, we have $$ C(x)=1+xC(x)^ $$ since a nonempty Dyck path of semilength $n$ consists of two Dyck paths the sum of whose semilengths is $n-1$ together with the unique Dyck path of semilength $1$ (the up-down steps).

Solving this quadratic equation, we get $$ C(x)=\frac{1\pm\sqrt{1-4x}}{2x $$ and we must decide between the plus and minus sign. However, note that $C(x)$ is a formal power series with only nonnegative powers of $x$ , and the expansion of $\sqrt{1-4x}$ starts with the constant term $1$ . So if the sign were positive, then $C(x)$ would have a leading term of $\frac{1}{x}$ . So we must choose the negative sign, and we get $$ C(x)=\frac{1-\sqrt{1-4x}}{2x $$

Here is a second method of getting to the same result; it is more straightforward but less informative.

By the generalized binomial formula, we have that $$ \sqrt{1+x}=(1+x)^{1/2}=\sum_{k=0}^{\infty}\dbinom{1/2}{k}x^k=\dbinom{1/2}{0}+\sum_{k=1}^{\infty}\dbinom{1/2}{k}x^k=1+\sum_{k=1}^{\infty}\dbinom{1/2}{k}x^ $$ Now,

$\displaystyle \dbinom{1/2}{k}$	$\displaystyle =\frac{(1/2)(1/2-1)(1/2-2)\cdots(1/2-k+1)}{k!}=2^{-k}(-1)^{k-1}\frac{1\cdot 3\cdot 5\cdots(2k-3)}{k!}$
	$\displaystyle =2^{-k}(-1)^{k-1}\frac{(k-1)!\cdot 1\cdot 3\cdot 5\cdots(2k-3)}{k!(k-1)!}=2^{1-2k}(-1)^{k-1}\frac{(2k-2)!}{k!(k-1)!}$
	$\displaystyle =2^{1-2k}(-1)^{k-1}\frac{1}{k}\cdot\dbinom{2k-2}{k-1}$

and so, substituting, we get $$ \sqrt{1+x}=1+\sum_{k=1}^{\infty}2^{1-2k}(-1)^{k-1}\frac{1}{k}\cdot\dbinom{2k-2}{k-1}x^ $$ Replacing $x$ by $-4x$ , we get

$\displaystyle \sqrt{1-4x}-1$	$\displaystyle =\sum_{k=1}^{\infty}2^{1-2k}(-1)^{k-1}\frac{1}{k}\cdot\dbinom{2k-2}{k-1}(-1)^k2^{2k}x^k =\sum_{k=1}^{\infty}(-2)\frac{1}{k}\dbinom{2k-2}{k-1}x^k$
	$\displaystyle =\sum_{k=0}^{\infty}\frac{-2}{k+1}\dbinom{2k}{k}x^{k+1}$

where the last equality results from replacing $k$ by $k+1$ and adjusting the range of summation. On dividing through by $-2x$ , we get $$ \frac{1-\sqrt{1-4x}}{2x}=\sum_{k=0}^{\infty}\frac{1}{k+1}\dbinom{2k}{k}x^k=\sum_{k=0}^{\infty}C_kx^ $$ and we are done.

As a final observation, note that the recurrence $$ C_n=\sum_{i=0}^{n-1} C_i C_{n-1-i $$ given in the parent article can be easily derived from the functional equation for the generating function, $C(x)=1+xC(x)^2$ : $$ \sum_k C_kx^k=1+x\left(\sum_k C_kx^k\right)^ $$ and the coefficient of $x^n$ on the right hand side is the coefficient of $x^{n-1}$ in the sum, which is precisely $$ \sum_{k=0}^{n-1} C_k C_{n-1-k $$ as desired.

"generating function for the Catalan numbers" is owned by rm50.

(view preamble | get metadata)