Falling and rising factorials

The first few falling factorials are as follows:

$${\displaystyle {\begin{array}{rll}(x)_{0}&&=1\\(x)_{1}&&=x\\(x)_{2}&=x(x-1)&=x^{2}-x\\(x)_{3}&=x(x-1)(x-2)&=x^{3}-3x^{2}+2x\\(x)_{4}&=x(x-1)(x-2)(x-3)&=x^{4}-6x^{3}+11x^{2}-6x\end{array}}}$$

The first few rising factorials are as follows:

$${\displaystyle {\begin{array}{rll}x^{(0)}&&=1\\x^{(1)}&&=x\\x^{(2)}&=x(x+1)&=x^{2}+x\\x^{(3)}&=x(x+1)(x+2)&=x^{3}+3x^{2}+2x\\x^{(4)}&=x(x+1)(x+2)(x+3)&=x^{4}+6x^{3}+11x^{2}+6x\end{array}}}$$

The coefficients that appear in the expansions are Stirling numbers of the first kind (see below).

When the variable x is a positive integer, the number (x)_n is equal to the number of n-permutations from a set of x items, that is, the number of ways of choosing an ordered list of length n consisting of distinct elements drawn from a collection of size x. For example, (8)₃ = 8 × 7 × 6 = 336 is the number of different podiums—assignments of gold, silver, and bronze medals—possible in an eight-person race. In this context, other notations like _xP_n, ^xP_n, P_n^x, or P(x, n) are also sometimes used. On the other hand, x⁽ⁿ⁾ is "the number of ways to arrange n flags on x flagpoles",[8] where all flags must be used and each flagpole can have any number of flags. Equivalently, this is the number of ways to partition a set of size n (the flags) into x distinguishable parts (the poles), with a linear order on the elements assigned to each part (the order of the flags on a given pole).

The rising and falling factorials are simply related to one another:

$${\displaystyle {\begin{array}{rll}{(x)}_{n}&={(x-n+1)}^{(n)}&=(-1)^{n}(-x)^{(n)},\\x^{(n)}&={(x+n-1)}_{n}&=(-1)^{n}(-x)_{n}.\end{array}}}$$

Falling and rising factorials of integers are directly related to the ordinary factorial:

$${\displaystyle {\begin{aligned}n!&=1^{(n)}=(n)_{n},\\[6pt](m)_{n}&={\frac {m!}{(m-n)!}},\\[6pt]m^{(n)}&={\frac {(m+n-1)!}{(m-1)!}}.\end{aligned}}}$$

Rising factorials of half integers are directly related to the double factorial:

$${\displaystyle {\begin{aligned}\left[{\frac {1}{2}}\right]^{(n)}={\frac {(2n-1)!!}{2^{n}}},\quad \left[{\frac {2m+1}{2}}\right]^{(n)}={\frac {(2(n+m)-1)!!}{2^{n}(2m-1)!!}}.\end{aligned}}}$$

The falling and rising factorials can be used to express a binomial coefficient:

$${\displaystyle {\begin{aligned}{\frac {(x)_{n}}{n!}}&={\binom {x}{n}},\\[6pt]{\frac {x^{(n)}}{n!}}&={\binom {x+n-1}{n}}.\end{aligned}}}$$

Thus many identities on binomial coefficients carry over to the falling and rising factorials.

The rising and falling factorials are well defined in any unital ring, and therefore x can be taken to be, for example, a complex number, including negative integers, or a polynomial with complex coefficients, or any complex-valued function.

The falling factorial can be extended to real values of x using the gamma function provided x and x + n are real numbers that are not negative integers:

$${\displaystyle (x)_{n}={\frac {\Gamma (x+1)}{\Gamma (x-n+1)}}\ ,}$$

and so can the rising factorial:

$${\displaystyle x^{(n)}={\frac {\Gamma (x+n)}{\Gamma (x)}}\ .}$$

Falling factorials appear in multiple differentiation of simple power functions:

$${\displaystyle \left({\frac {\mathrm {d} }{\mathrm {d} x}}\right)^{n}x^{a}=(a)_{n}\cdot x^{a-n}.}$$

The rising factorial is also integral to the definition of the hypergeometric function: The hypergeometric function is defined for |z| < 1 by the power series

$${\displaystyle {}_{2}F_{1}(a,b;c;z)=\sum _{n=0}^{\infty }{\frac {a^{(n)}b^{(n)}}{c^{(n)}}}{\frac {z^{n}}{n!}}}$$

provided that c ≠ 0, −1, −2, ... . Note, however, that the hypergeometric function literature typically uses the notation (a)_n for rising factorials.

Falling and rising factorials are closely related to Stirling numbers. Indeed, expanding the product reveals Stirling numbers of the first kind

$${\displaystyle {\begin{aligned}(x)_{n}&=\sum _{k=0}^{n}s(n,k)x^{k}\\&=\sum _{k=0}^{n}{\begin{bmatrix}n\\k\end{bmatrix}}(-1)^{n-k}x^{k}\\x^{(n)}&=\sum _{k=0}^{n}{\begin{bmatrix}n\\k\end{bmatrix}}x^{k}\\\end{aligned}}}$$

And the inverse relations uses Stirling numbers of the second kind

$${\displaystyle {\begin{aligned}x^{n}&=\sum _{k=0}^{n}{\begin{Bmatrix}n\\k\end{Bmatrix}}(x)_{k}\\&=\sum _{k=0}^{n}{\begin{Bmatrix}n\\k\end{Bmatrix}}(-1)^{n-k}x^{(k)}.\end{aligned}}}$$

The falling and rising factorials are related to one another through the Lah numbers ${\textstyle L(n,k)={\binom {n-1}{k-1}}{\frac {n!}{k!}}}$:[9]

$${\displaystyle {\begin{aligned}(x)_{n}&=\sum _{k=0}^{n}L(n,k)x^{(k)}\\x^{(n)}&=\sum _{k=0}^{n}L(n,k)(-1)^{n-k}(x)_{k}\end{aligned}}}$$

Since the falling factorials are a basis for the polynomial ring, one can express the product of two of them as a linear combination of falling factorials:[10]

$${\displaystyle (x)_{m}(x)_{n}=\sum _{k=0}^{m}{\binom {m}{k}}{\binom {n}{k}}k!\cdot (x)_{m+n-k}\ .}$$

The coefficients ${\displaystyle {\tbinom {m}{k}}{\tbinom {n}{k}}k!}$ are called connection coefficients, and have a combinatorial interpretation as the number of ways to identify (or "glue together") k elements each from a set of size m and a set of size n.

There is also a connection formula for the ratio of two rising factorials given by

$${\displaystyle {\frac {x^{(n)}}{x^{(i)}}}=(x+i)^{(n-i)},\quad {\text{for }}n\geq i.}$$

Additionally, we can expand generalized exponent laws and negative rising and falling powers through the following identities:[11]^(p 52)

$${\displaystyle {\begin{aligned}(x)_{m+n}&=(x)_{m}(x-m)_{n}=(x)_{n}(x-n)_{m}\\[6pt]x^{(m+n)}&=x^{(m)}(x+m)^{(n)}=x^{(n)}(x+n)^{(m)}\\[6pt]x^{(-n)}&={\frac {\Gamma (x-n)}{\Gamma (x)}}={\frac {(x-n-1)!}{(x-1)!}}={\frac {1}{(x-n)^{(n)}}}={\frac {1}{(x-1)_{n}}}={\frac {1}{(x-1)(x-2)\cdots (x-n)}}=(-n)!{\binom {x-n-1}{-n}}\\[6pt](x)_{-n}&={\frac {\Gamma (x+1)}{\Gamma (x+n-1)}}={\frac {x!}{(x+n)!}}={\frac {1}{(x+n)_{n}}}={\frac {1}{(x+1)^{(n)}}}={\frac {1}{(x+1)(x+2)\cdots (x+n)}}=(-n)!{\binom {x}{-n}}.\end{aligned}}}$$

Finally, duplication and multiplication formulas for the falling and rising factorials provide the next relations:

$${\displaystyle {\begin{aligned}(x)_{k+mn}&=x^{(k)}m^{mn}\prod _{j=0}^{m-1}\left({\frac {x-k-j}{m}}\right)_{n}\,,&{\text{for }}m&\in \mathbb {N} \\[6pt]x^{(k+mn)}&=x^{(k)}m^{mn}\prod _{j=0}^{m-1}\left({\frac {x+k+j}{m}}\right)^{(n)},&{\text{for }}m&\in \mathbb {N} \\[6pt](ax+b)^{(n)}&=x^{n}\prod _{j=0}^{n-1}\left(a+{\frac {b+j}{x}}\right),&{\text{for }}x&\in \mathbb {Z} ^{+}\\[6pt](2x)^{(2n)}&=2^{2n}x^{(n)}\left(x+{\frac {1}{2}}\right)^{(n)}.\end{aligned}}}$$

The falling factorial occurs in a formula which represents polynomials using the forward difference operator ${\displaystyle \Delta f(x){\stackrel {\mathrm {def} }{=}}f(x{+}1)-f(x),}$ and which is formally similar to Taylor's theorem:

$${\displaystyle f(x)=\sum _{n=0}^{\infty }{\frac {\Delta ^{n}f(0)}{n!}}(x)_{n}.}$$

In this formula and in many other places, the falling factorial (x)_n in the calculus of finite differences plays the role of xⁿ in differential calculus. Note for instance the similarity of Δ (x)_n = n (x)_n−1 to d/d x xⁿ = n xⁿ⁻¹ .

A similar result holds for the rising factorial and the backward difference operator.

The study of analogies of this type is known as umbral calculus. A general theory covering such relations, including the falling and rising factorial functions, is given by the theory of polynomial sequences of binomial type and Sheffer sequences. Falling and rising factorials are Sheffer sequences of binomial type, as shown by the relations:

$${\displaystyle {\begin{aligned}(a+b)_{n}&=\sum _{j=0}^{n}{\binom {n}{j}}(a)_{n-j}(b)_{j}\\[6pt](a+b)^{(n)}&=\sum _{j=0}^{n}{\binom {n}{j}}(a)^{(n-j)}(b)^{(j)}\end{aligned}}}$$

where the coefficients are the same as those in the binomial theorem.

Similarly, the generating function of Pochhammer polynomials then amounts to the umbral exponential,

$${\displaystyle \sum _{n=0}^{\infty }(x)_{n}{\frac {t^{n}}{n!}}=\left(1+t\right)^{x},}$$

since

$${\displaystyle \operatorname {\Delta } _{x}\left(1+t\right)^{x}=t\cdot \left(1+t\right)^{x}.}$$

An alternative notation for the rising factorial

$${\displaystyle x^{\overline {m}}\equiv (x)_{+m}\equiv (x)_{m}=\overbrace {x(x+1)\ldots (x+m-1)} ^{m{\text{ factors}}}\quad {\text{for integer }}m\geq 0}$$

and for the falling factorial

$${\displaystyle x^{\underline {m}}\equiv (x)_{-m}=\overbrace {x(x-1)\ldots (x-m+1)} ^{m{\text{ factors}}}\quad {\text{for integer }}m\geq 0}$$

goes back to A. Capelli (1893) and L. Toscano (1939), respectively.[2] Graham, Knuth, and Patashnik[11]^{(pp 47, 48)} propose to pronounce these expressions as "x to the m rising" and "x to the m falling", respectively.

Other notations for the falling factorial include P(x,n), ^xP_n, P_x,n, P_n^x, or _xP_n. (See permutation and combination.)

An alternative notation for the rising factorial x⁽ⁿ⁾ is the less common (x)⁺
_n . When (x)⁺
_n is used to denote the rising factorial, the notation (x)⁻
_n is typically used for the ordinary falling factorial, to avoid confusion.[3]

The Pochhammer symbol has a generalized version called the generalized Pochhammer symbol, used in multivariate analysis. There is also a q-analogue, the q-Pochhammer symbol.

A generalization of the falling factorial in which a function is evaluated on a descending arithmetic sequence of integers and the values are multiplied is:

$${\displaystyle {\bigl [}f(x){\bigr ]}^{k/-h}=f(x)\cdot f(x-h)\cdot f(x-2h)\cdots f{\bigl (}x-(k-1)h{\bigr )},}$$

where −h is the decrement and k is the number of factors. The corresponding generalization of the rising factorial is

$${\displaystyle {\bigl [}f(x){\bigr ]}^{k/h}=f(x)\cdot f(x+h)\cdot f(x+2h)\cdots f{\bigl (}x+(k-1)h{\bigr )}.}$$

This notation unifies the rising and falling factorials, which are [x]^k/+1 and [x]^k/−1 respectively.

For any fixed arithmetic function ${\displaystyle f:\mathbb {N} \rightarrow \mathbb {C} }$ and symbolic parameters x, t, related generalized factorial products of the form

$${\displaystyle (x)_{n,f,t}:=\prod _{k=0}^{n-1}\left(x+{\frac {f(k)}{t^{k}}}\right)}$$

may be studied from the point of view of the classes of generalized Stirling numbers of the first kind defined by the following coefficients of the powers of x in the expansions of (x)_n,f,t and then by the next corresponding triangular recurrence relation:

$${\displaystyle {\begin{aligned}\left[{\begin{matrix}n\\k\end{matrix}}\right]_{f,t}&=\left[x^{k-1}\right](x)_{n,f,t}\\&=f(n-1)t^{1-n}\left[{\begin{matrix}n-1\\k\end{matrix}}\right]_{f,t}+\left[{\begin{matrix}n-1\\k-1\end{matrix}}\right]_{f,t}+\delta _{n,0}\delta _{k,0}.\end{aligned}}}$$

These coefficients satisfy a number of analogous properties to those for the Stirling numbers of the first kind as well as recurrence relations and functional equations related to the f-harmonic numbers,[12]

$${\displaystyle F_{n}^{(r)}(t):=\sum _{k\leq n}{\frac {t^{k}}{f(k)^{r}}}\,.}$$

A symmetric generalization can be defined as

$${\displaystyle x^{\underline {\overline {m}}}\equiv {\frac {x^{\overline {m}}x^{\underline {m}}}{x}}=x^{{\overline {m}}+{\underline {m}}-1}.}$$

• Pochhammer k-symbol
• Vandermonde identity

• Weisstein, Eric W. "Pochhammer Symbol". MathWorld.
• "A Compilation of mathematical demonstrations". scribd.com. Archived from the original on 2016-02-14. — Elementary proofs