What a Lyapunov Check Requires
The Lyapunov central limit theorem is useful when summands are independent but need not have the same distribution. In applications, the main work is often not invoking the theorem but showing that a particular sum has a sufficiently small contribution from large deviations. Lyapunov’s condition measures that contribution through moments of order greater than two, relative to the total variance.
For each \(n\), consider independent random variables \(X_{n,1},\ldots,X_{n,m_n}\) with finite means and variances. The distributions may vary between summands and may also depend on \(n\). Define the centered variables \(Y_{n,k}=X_{n,k}-E[X_{n,k}]\), and let \(s_n^2\) be the variance of their sum.
The denominator is the total standard deviation raised to the same power as the moments in the numerator. A useful check therefore compares each summand’s higher moment with the scale of the whole sum. Choosing \(\delta=1\) uses third absolute moments; choosing \(\delta=2\) uses fourth moments. The theorem requires one fixed choice of \(\delta>0\) for which the ratio tends to zero.
A Bound for Centered Bounded Variables
A simple moment bound often makes Lyapunov’s condition immediate. Suppose the centered summands in the \(n\)-th sum satisfy \(|Y_{n,k}|\le b_n\) almost surely, with the same bound \(b_n\) applying to every summand in that sum. Since \(2+\delta>2\), multiplying \(|Y_{n,k}|^2\) by \(|Y_{n,k}|^\delta\) gives a direct bound.
Proof. The almost-sure bound implies \(|Y_{n,k}|^\delta\le b_n^\delta\), and hence
Taking expectations gives \(E[|Y_{n,k}|^{2+\delta}]\le b_n^\delta E[|Y_{n,k}|^2]=b_n^\delta\operatorname{Var}(X_{n,k})\), because \(Y_{n,k}\) is centered. Summing over \(k\) yields the first inequality. Dividing by \(s_n^{2+\delta}\), and using \(\sum_k\operatorname{Var}(X_{n,k})=s_n^2\), gives the ratio bound. If \(b_n/s_n\to0\), its fixed positive power also tends to zero. \(\square\)
Worked Example: Bounded Bernoulli Summands with a Fixed Success Probability
Let \(X_1,\ldots,X_n\) be independent Bernoulli random variables with \(P(X_i=1)=p\), where \(0<p<1\) is fixed. Check Lyapunov’s condition for their centered sum.
Write \(Y_i=X_i-p\) and \(q=1-p\). The centered variable equals \(q\) with probability \(p\), and \(-p\) with probability \(q\). Thus
Using \(\delta=1\), the total variance is \(s_n^2=npq\), so the Lyapunov ratio is
Since \(p\) and \(q\) are fixed and positive, the numerator is constant and the denominator grows proportionally to \(\sqrt n\). Therefore \(L_n(1)\to0\). For instance, if \(p=0.2\) and \(q=0.8\), then \(p^2+q^2=0.68\) and \(pq=0.16\), giving \(L_n(1)=1.7/\sqrt n\). The Lyapunov theorem consequently gives a standard normal limit for the centered sum divided by \(\sqrt{npq}\).
Unequal Variances: Compare the Largest Scale with the Total
For variables with unequal variances, a common strategy is to bound each third moment in terms of its own standard deviation. Write \(\sigma_{n,k}^2=\operatorname{Var}(X_{n,k})\). If \(E[|Y_{n,k}|^3]\le C\sigma_{n,k}^3\) for a constant \(C\) not depending on \(n\) or \(k\), then the third-moment ratio has a convenient upper bound.
Proof. Summing the assumed moment bounds gives the first inequality, since \(s_n^2=\sum_k\sigma_{n,k}^2\). For the second, each \(\sigma_{n,k}\le\max_j\sigma_{n,j}\), so
Dividing by \((\sum_k\sigma_{n,k}^2)^{3/2}\) proves the claimed bound. If its final fraction tends to zero, then \(L_n(1)\to0\). \(\square\)
Worked Example: Independent Normal Variables with Increasing Variances
For each \(n\), let \(X_1,\ldots,X_n\) be independent with \(X_i\sim N(0,i)\). The distributions do not have a common variance. Check the Lyapunov condition with \(\delta=1\).
If \(Z\sim N(0,1)\), direct integration of the normal density gives \(E[|Z|^3]=2\sqrt{2/\pi}\). Since \(X_i\) has the same distribution as \(\sqrt{i}Z\),
Consequently,
For every \(i\le n\), \(i^{3/2}=\sqrt{i}\,i\le\sqrt{n}\,i\). Therefore
The right-hand side tends to zero, so Lyapunov’s condition holds. This bound shows why a single summand with a larger variance does not automatically prevent a normal limit: what matters here is its scale relative to the variance accumulated by the full sum.
Changing Distributions and Moment Bounds
When distributions change with \(n\), do not assume a moment is constant just because the variables have the same form. Calculate or bound the moment at the current value of \(n\), sum those bounds, and compare the result with \(s_n^{2+\delta}\). Uniform bounds are helpful, but the relevant question is how their total compares with the denominator.
Worked Example: Bernoulli Probabilities Decreasing with Sample Size
For each \(n\ge2\), let \(X_{n,1},\ldots,X_{n,n}\) be independent Bernoulli variables with success probability \(p_n=n^{-1/2}\). Check Lyapunov’s condition with \(\delta=1\).
Set \(q_n=1-p_n\). As in the fixed-probability calculation, each variable has variance \(p_nq_n\) and centered third absolute moment \(p_nq_n(p_n^2+q_n^2)\). Thus
The numerator satisfies \(p_n^2+q_n^2\to1\). The denominator squared is \(np_nq_n=\sqrt n(1-1/\sqrt n)\), which tends to infinity. More explicitly, its square root is of order \(n^{1/4}\), so \(L_n(1)\to0\). Lyapunov’s condition holds even though the success probability changes with \(n\).
Contrast this with \(p_n=1/n\). Then \(np_nq_n=1-1/n\to1\), while \(p_n^2+q_n^2\to1\), and therefore
not zero. This calculation shows that the same boundedness of the centered summands does not ensure Lyapunov’s condition when the total variance fails to grow. It shows only that this particular sufficient condition cannot be used; failure of Lyapunov’s condition alone does not prove that a normal limit is impossible.
Choosing a Moment Bound and Avoiding a Pitfall
A good Lyapunov check is usually short once the right bound has been identified. For bounded centered variables, the bound \(E[|Y|^{2+\delta}]\le b_n^\delta\operatorname{Var}(X)\) is effective when the common bound \(b_n\) is small relative to \(s_n\). For variables whose moments scale with their standard deviations, a bound such as \(E[|Y|^3]\le C\sigma^3\) reduces the check to comparing the largest \(\sigma\) with the total standard deviation.
Higher moments can also help, but they must be normalized consistently. For example, using \(\delta=2\) requires summing fourth absolute moments and dividing by \(s_n^4\); a fourth-moment bound is useful only if that resulting ratio tends to zero. The theorem needs a fixed \(\delta>0\), not an exponent that changes with \(n\).
The practical value of Lyapunov checks is that they turn a central limit theorem’s hypothesis into concrete moment arithmetic. They allow different variances and changing distributions, while making explicit which control is doing the work: bounded summands relative to total variance, or higher moments that grow no faster than an appropriate power of each summand’s standard deviation. Keep the conclusion appropriately limited: a vanishing Lyapunov ratio establishes the theorem’s condition; a nonvanishing ratio merely leaves that route unavailable.
Check Your Understanding
For each question, identify the moment or scale comparison that decides the Lyapunov check.
- If centered variables satisfy \(|Y_{n,k}|\le b_n\), what condition on \(b_n\) and \(s_n\) guarantees Lyapunov’s condition?
- For independent Bernoulli summands with a fixed success probability \(p\), derive the third absolute centered moment in terms of \(p\) and \(q=1-p\).
- If \(E[|Y_{n,k}|^3]\le C\sigma_{n,k}^3\), which comparison involving the largest \(\sigma_{n,k}\) suffices to make \(L_n(1)\to0\)?
- For Bernoulli variables with \(p_n=1/n\) and \(n\) summands, what happens to the third-moment Lyapunov ratio, and what does that alone allow you to conclude?