Tutorials › Statistical Theory I - Probability and Distribution Theory › Factorial Moments from PGF Derivatives

Moments and Generating Functions · Tutorial 500 of 994

Factorial Moments from PGF Derivatives

Derive the PGF derivative identity for factorial moments, establish its boundary conditions, and apply it to standard count distributions.

Intermediate 10 min read

What You'll Learn

  • Define falling factorials and factorial moments for nonnegative integer-valued random variables
  • Derive the PGF derivative formula for arguments below one
  • Justify the one-sided derivative identity at one when the factorial moment is finite
  • Calculate factorial moments for Bernoulli, binomial, and Poisson distributions
  • Recognize why finiteness cannot be omitted when evaluating derivatives at the PGF boundary

Why Differentiate a Probability-Generating Function?

For a nonnegative integer-valued random variable, the probability-generating function (PGF) packages all point probabilities into one function. Its derivatives reveal weighted sums of those probabilities. The weights are not the ordinary powers of the count: differentiating \(s^k\) \(r\) times produces the falling factorial \(k(k-1)\cdots(k-r+1)\). This makes PGF derivatives a direct tool for calculating factorial moments.

There is one important boundary issue. A PGF is always defined at \(s=1\), but it need not be differentiable there with a finite derivative. We will first differentiate at \(0<s<1\), where power-series differentiation is valid, and then justify the limit to \(1\) under a precise finiteness condition.

Factorial Moments and PGF Derivatives

Definition: Let \(X\) take values in \(\{0,1,2,\ldots\}\). For an integer \(r\geq 1\), define the falling factorial \((X)_r=X(X-1)\cdots(X-r+1)\), with \((X)_r=0\) when \(X<r\). The \(r\)th factorial moment is \(E[(X)_r]\), which may be infinite. The probability-generating function is \(G(s)=E[s^X]=\sum_{k=0}^{\infty}P(X=k)s^k\) for \(0\leq s\leq1\).

The convention \(0^0=1\) is used in the PGF term for \(X=0\), so \(G(0)=P(X=0)\). For \(0<s<1\), the series for \(G\) is a power series that converges absolutely. It can therefore be differentiated term by term at interior points. The boundary \(s=1\), however, requires a separate argument.

Theorem: For \(0<s<1\) and every integer \(r\geq1\), \[ G^{(r)}(s)=\sum_{k=r}^{\infty}(k)_r P(X=k)s^{k-r}. \] Moreover, if \(E[(X)_r]<\infty\), then the \(r\)th left derivative at \(1\) exists and \[ G^{(r)}(1-)=E[(X)_r]. \] Without the finiteness condition, the interior derivatives still satisfy \(\lim_{s\uparrow1}G^{(r)}(s)=E[(X)_r]\), where the limit may be \(+\infty\).

Why the Boundary Identity Holds

The formula inside the unit interval follows by differentiating each power \(s^k\). To reach the endpoint, take \(s\) upwards to \(1\). Every summand in the derivative series is nonnegative and increases to \((k)_rP(X=k)\). The Monotone Convergence Theorem therefore gives the extended-valued limit. When the resulting sum is finite, the successive derivatives also have finite limits, which ensures that these limits are genuine one-sided derivatives at the endpoint.

1
Differentiate inside the interval.
The PGF is a power series with radius of convergence at least \(1\), so for \(0<s<1\), termwise differentiation gives the stated sum.
2
Pass to the boundary in the sum.
For each \(k\geq r\), \(s^{k-r}\) increases to \(1\) as \(s\uparrow1\). Monotone Convergence identifies the limit of the sum with \(E[(X)_r]\), including the possibility of infinity.
3
Check the endpoint derivative when the sum is finite.
Finiteness of the \(r\)th factorial moment implies finiteness of the lower factorial moments. The derivatives through order \(r\) consequently extend continuously to \(1\), and the endpoint difference quotients converge to the corresponding limits.

Here is the endpoint argument in more detail. Write \(p_k=P(X=k)\), and for \(0<s<1\) let \(H_j(s)=\sum_{k=j}^{\infty}(k)_j p_k s^{k-j}\) for \(1\leq j\leq r\), with \(H_0(s)=G(s)\). If \(E[(X)_r]<\infty\), then each \(E[(X)_j]\) for \(j<r\) is finite: for \(k\geq r\), \((k)_j\leq(k)_r\), and the remaining values of \(k\) form a finite set. Monotone Convergence gives a finite limit \(H_j(1)=\sum_{k=j}^{\infty}(k)_j p_k\) for every \(j\leq r\). Thus each \(H_j\) extends continuously to \(1\).

On any interval inside \((0,1)\), termwise differentiation gives \(H_j'=H_{j+1}\) for \(j<r\). The Fundamental Theorem of Calculus, followed by taking the upper endpoint to \(1\), now gives \[ H_j(1)-H_j(s)=\int_s^1 H_{j+1}(t)\,dt. \] The integral is well-defined because \(H_{j+1}\) has a finite continuous extension to \(1\). Dividing by \(1-s\) and letting \(s\uparrow1\), continuity implies that the average of \(H_{j+1}\) over \([s,1]\) tends to \(H_{j+1}(1)\). Hence the left derivative of \(H_j\) at \(1\) is \(H_{j+1}(1)\). Applying this successively identifies \(G^{(r)}(1-)\) with \(H_r(1)=E[(X)_r]\). \(\square\)

If the factorial moment is infinite, the Monotone Convergence argument still applies, but it says the interior derivatives tend to \(+\infty\); it does not give a finite derivative at \(1\). This distinction is why the finiteness condition belongs in the boundary identity.

Worked Applications

Worked Example: Bernoulli Factorial Moments

Let \(X\sim\operatorname{Bernoulli}(p)\), so \(P(X=1)=p\) and \(P(X=0)=1-p\), where \(0\leq p\leq1\). Its PGF is \[ G(s)=(1-p)+ps. \] Differentiating gives \(G'(s)=p\), while \(G^{(r)}(s)=0\) for every \(r\geq2\). The factorial moments are finite because \(X\) only takes the values zero and one. Evaluating at \(1\) therefore yields \[ E[(X)_1]=p,\qquad E[(X)_r]=0\quad(r\geq2). \] This also follows directly: when \(X=0\), every positive-order falling factorial is zero, and when \(X=1\), \((X)_1=1\) but \((X)_r=0\) for \(r\geq2\).

Worked Example: Binomial Factorial Moments

Let \(X\sim\operatorname{Binomial}(5,0.2)\). The PGF is \(G(s)=(0.8+0.2s)^5\). Its first three derivatives are \[ G'(s)=5(0.2)(0.8+0.2s)^4, \] \[ G''(s)=5\cdot4(0.2)^2(0.8+0.2s)^3, \] \[ G'''(s)=5\cdot4\cdot3(0.2)^3(0.8+0.2s)^2. \] At \(s=1\), the factor \(0.8+0.2s\) equals \(1\). Thus \[ E[(X)_1]=5(0.2)=1, \] \[ E[(X)_2]=5\cdot4(0.2)^2=20(0.04)=0.8, \] and \[ E[(X)_3]=5\cdot4\cdot3(0.2)^3=60(0.008)=0.48. \] All factorial moments are finite because this distribution is supported on \(\{0,1,2,3,4,5\}\); derivatives of order greater than five are zero.

Worked Example: Poisson Factorial Moments

Let \(X\sim\operatorname{Poisson}(3)\), so \(P(X=k)=e^{-3}3^k/k!\) for \(k\geq0\). Using the exponential series, its PGF is \[ G(s)=e^{-3}\sum_{k=0}^{\infty}\frac{(3s)^k}{k!} =e^{-3}e^{3s}=e^{3(s-1)}. \] For any integer \(r\geq1\), repeated differentiation gives \[ G^{(r)}(s)=3^r e^{3(s-1)}. \] At \(s=1\), this is \(3^r\). The factorial moment is finite: its defining sum is \[ \sum_{k=r}^{\infty}\frac{k!}{(k-r)!}\frac{e^{-3}3^k}{k!} =e^{-3}3^r\sum_{k=r}^{\infty}\frac{3^{k-r}}{(k-r)!} =3^r. \] In the final equality, set \(m=k-r\) and use \(\sum_{m=0}^{\infty}3^m/m!=e^3\). Thus the direct sum and the PGF derivative agree; for example, the third factorial moment is \(3^3=27\).

Common Pitfall: Differentiating at One Without Checking Finiteness

A PGF’s value at \(1\) is always \(G(1)=1\), but that fact does not imply that its derivative at \(1\) is finite. For a concrete example, let \(P(X=k)=1/[k(k+1)]\) for \(k\geq1\). These probabilities sum to one because \[ \sum_{k=1}^{N}\frac{1}{k(k+1)} =\sum_{k=1}^{N}\left(\frac{1}{k}-\frac{1}{k+1}\right) =1-\frac{1}{N+1}\longrightarrow1. \] Yet \[ E[X]=\sum_{k=1}^{\infty}k\frac{1}{k(k+1)} =\sum_{k=1}^{\infty}\frac{1}{k+1}=\infty. \] Here \(G'(s)=\sum_{k=1}^{\infty}s^{k-1}/(k+1)\) for \(0<s<1\), and \(G'(s)\) tends to infinity as \(s\uparrow1\).

The mistaken reasoning is: “The PGF is defined at \(1\), so I can differentiate its series there and obtain a finite answer.” Being able to evaluate a series at an endpoint does not justify differentiating it there. The correction is to differentiate at an interior point first, then use the theorem: the boundary limit equals the factorial moment, and it is finite only when that factorial moment is finite.

Why This Identity Is Useful

The derivative formula converts a distributional calculation into a calculation with a function. Once a PGF has a manageable algebraic or exponential form, differentiating it can be much simpler than summing a probability series term by term. In applications involving counts, derivatives at one provide expected falling-factorial counts, with the order \(r\) specifying how many successive factors appear.

The identity also provides a useful check on calculations. A proposed \(r\)th factorial moment must be nonnegative, and it must be zero for a distribution supported only on values below \(r\). Most importantly, the endpoint condition makes clear what a derivative calculation has established: an interior derivative formula is valid for \(s<1\), while its value at one requires a finite factorial moment if a finite boundary derivative is claimed.

Check Your Understanding

Answer each question using the derivative identity and its conditions.

  1. For a nonnegative integer-valued \(X\), write the series expression for \(G^{(r)}(s)\) when \(0<s<1\).
  2. What finiteness condition gives \(G^{(r)}(1-)=E[(X)_r]\) as a finite identity?
  3. If \(X\) has support \(\{0,1,2\}\), what is \(G^{(3)}(s)\), and why?
  4. For \(X\sim\operatorname{Poisson}(\lambda)\) with \(\lambda>0\), what does differentiating the PGF give for the \(r\)th factorial moment?
  5. Why does \(G(1)=1\) alone not guarantee that \(G'(1-)\) is finite?