Skip to article frontmatterSkip to article content
Site not loading correctly?

This may be due to an incorrect BASE_URL configuration. See the MyST Documentation for reference.

LLN Failure Under Infinite Mean

Statement

Let X1,X2,…X_1,X_2,\dots be independent copies of a nonnegative random variable XX, and let

Sn=∑i=1nXi.S_n=\sum_{i=1}^n X_i.

If E[X]=∞\mathbb E[X]=\infty, then

Snn→a.s.∞.\frac{S_n}{n}\xrightarrow{\text{a.s.}}\infty.

For a Pareto Type I variable with lower cutoff xm>0x_m>0 and tail exponent α\alpha, this applies exactly when α≤1\alpha\le1. In that regime the sample mean is not estimating a hidden finite number; the ordinary law of large numbers normalization has failed.

Here E\mathbb E is expectation and a.s. means almost surely. The Pareto parameters xmx_m and α\alpha are the lower cutoff and positive tail exponent. See Shared notation.

Intuition

The finite-mean law of large numbers says that many small and moderate observations eventually average out the noise. With a nonnegative infinite mean, every finite truncation has an ordinary average, but those truncation levels can be pushed higher without bound. The untruncated average must eventually dominate each one.

For Pareto tails with α≤1\alpha\le1, rare observations are large enough that no finite long-run mean exists. A running average may drift downward between records, but the theorem says there is no stable finite level waiting in the limit.

Proof sketch

We prove the idea by truncating the variables, applying the strong law to each bounded truncation, and then letting the cutoff rise. The Pareto threshold condition is not reproved here; it is supplied by Pareto Moment Existence.

For a cutoff c>0c>0, define the truncated variable

Xi(c)=min⁡(Xi,c).X_i^{(c)}=\min(X_i,c).

Each Xi(c)X_i^{(c)} is bounded, so the strong law of large numbers gives

1n∑i=1nXi(c)→a.s.E[min⁡(X,c)].\frac1n\sum_{i=1}^n X_i^{(c)} \xrightarrow{\text{a.s.}} \mathbb E[\min(X,c)].

Since Xi≥Xi(c)X_i\ge X_i^{(c)},

lim inf⁡n→∞Snn≥E[min⁡(X,c)]\liminf_{n\to\infty}\frac{S_n}{n} \ge \mathbb E[\min(X,c)]

almost surely for each fixed cc. Apply this on the countable sequence c=1,2,3,…c=1,2,3,\dots. By monotone convergence,

E[min⁡(X,c)]↑E[X]=∞.\mathbb E[\min(X,c)]\uparrow \mathbb E[X]=\infty.

Therefore the liminf of Sn/nS_n/n is larger than every finite number, almost surely, which proves Sn/n→∞S_n/n\to\infty almost surely.

For a Pareto Type I variable, Pareto Moment Existence proves that E[X]\mathbb E[X] is infinite exactly when α≤1\alpha\le1.

Sample-path behavior

The running average obeys the exact update identity

Sn+1n+1−Snn=Xn+1−Sn/nn+1.\frac{S_{n+1}}{n+1}-\frac{S_n}{n} =\frac{X_{n+1}-S_n/n}{n+1}.

It falls whenever the next observation is below the current average and rises whenever it is above. Divergence to infinity does not imply a monotone sample path. Long downward stretches between records are compatible with the theorem. The max-to-sum ratio measures a different quantity: the largest observation’s share of the realized total. In particular, infinite mean alone does not imply that this share tends to one.

Capped means for exact Pareto tails

The truncation proof can be inspected directly. For Pareto Type I with xm=1x_m=1 and c≥1c\ge1,

E[min⁡(X,c)]=1+∫1cx−α dx={1+c1−α−11−α,α≠1,1+log⁡c,α=1.\mathbb E[\min(X,c)] =1+\int_1^c x^{-\alpha}\,dx =\begin{cases} 1+\dfrac{c^{1-\alpha}-1}{1-\alpha}, & \alpha\ne1,\\ 1+\log c, & \alpha=1. \end{cases}

The following values are evaluations of this identity, rounded to three decimals. They are capped population means, not sample averages or E[X1{X≤c}]\mathbb E[X\mathbf 1_{\{X\le c\}}].

Exponent α\alphac=10c=10c=1000c=1000c=107c=10^7Limit as c→∞c\to\infty
0.83.92415.905121.594∞\infty
13.3037.90817.118∞\infty
1.32.6633.9144.30713/313/3

For a general regularly varying tail at exponent α=1\alpha=1, the slowly varying factor can make the mean finite. The theorem requires infinite mean; the exact Pareto cutoff α≤1\alpha\le1 is not a universal boundary rule at equality. See Karamata’s theorem for the tail-integral criterion.

Counterexamples and caveats

References

References
  1. Resnick, S. I. (2007). Heavy-Tail Phenomena: Probabilistic and Statistical Modeling. Springer. 10.1007/978-0-387-45024-7