Lindeberg's condition

In probability theory, Lindeberg's condition is a sufficient condition (and under certain conditions also a necessary condition) for the central limit theorem (CLT) to hold for a sequence of independent random variables.[1][2][3] Unlike the classical CLT, which requires that the random variables in question have finite variance and be both independent and identically distributed, Lindeberg's CLT only requires that they have finite variance, satisfy Lindeberg's condition, and be independent. It is named after the Finnish mathematician Jarl Waldemar Lindeberg.[4]

Statement

Let ( Ω , F , P ) {\displaystyle (\Omega ,{\mathcal {F}},\mathbb {P} )} be a probability space, and X k : Ω R , k N {\displaystyle X_{k}:\Omega \to \mathbb {R} ,\,\,k\in \mathbb {N} } , be independent random variables defined on that space. Assume the expected values E [ X k ] = μ k {\displaystyle \mathbb {E} \,[X_{k}]=\mu _{k}} and variances V a r [ X k ] = σ k 2 {\displaystyle \mathrm {Var} \,[X_{k}]=\sigma _{k}^{2}} exist and are finite. Also let s n 2 := k = 1 n σ k 2 . {\displaystyle s_{n}^{2}:=\sum _{k=1}^{n}\sigma _{k}^{2}.}

If this sequence of independent random variables X k {\displaystyle X_{k}} satisfies Lindeberg's condition:

lim n 1 s n 2 k = 1 n E [ ( X k μ k ) 2 1 { | X k μ k | > ε s n } ] = 0 {\displaystyle \lim _{n\to \infty }{\frac {1}{s_{n}^{2}}}\sum _{k=1}^{n}\mathbb {E} \left[(X_{k}-\mu _{k})^{2}\cdot \mathbf {1} _{\{|X_{k}-\mu _{k}|>\varepsilon s_{n}\}}\right]=0}

for all ε > 0 {\displaystyle \varepsilon >0} , where 1{…} is the indicator function, then the central limit theorem holds, i.e. the random variables

Z n := k = 1 n ( X k μ k ) s n {\displaystyle Z_{n}:={\frac {\sum _{k=1}^{n}(X_{k}-\mu _{k})}{s_{n}}}}

converge in distribution to a standard normal random variable as n . {\displaystyle n\to \infty .}

Lindeberg's condition is sufficient, but not in general necessary (i.e. the inverse implication does not hold in general). However, if the sequence of independent random variables in question satisfies

max k = 1 , , n σ k 2 s n 2 0 ,  as  n , {\displaystyle \max _{k=1,\ldots ,n}{\frac {\sigma _{k}^{2}}{s_{n}^{2}}}\to 0,\quad {\text{ as }}n\to \infty ,}

then Lindeberg's condition is both sufficient and necessary, i.e. it holds if and only if the result of central limit theorem holds.

Remarks

Feller's theorem

Feller's theorem can be used as an alternative method to prove that Lindeberg's condition holds.[5] Letting S n := k = 1 n X k {\displaystyle S_{n}:=\sum _{k=1}^{n}X_{k}} and for simplicity E [ X k ] = 0 {\displaystyle \mathbb {E} \,[X_{k}]=0} , the theorem states

if ε > 0 {\displaystyle \forall \varepsilon >0} , lim n max 1 k n P ( | X k | > ε s n ) = 0 {\displaystyle \lim _{n\rightarrow \infty }\max _{1\leq k\leq n}P(|X_{k}|>\varepsilon s_{n})=0} and S n s n {\displaystyle {\frac {S_{n}}{s_{n}}}} converges weakly to a standard normal distribution as n {\displaystyle n\rightarrow \infty } then X k {\displaystyle X_{k}} satisfies the Lindeberg's condition.


This theorem can be used to disprove the central limit theorem holds for X k {\displaystyle X_{k}} by using proof by contradiction. This procedure involves proving that Lindeberg's condition fails for X k {\displaystyle X_{k}} .

Interpretation

Because the Lindeberg condition implies max k = 1 , , n σ k 2 s n 2 0 {\displaystyle \max _{k=1,\ldots ,n}{\frac {\sigma _{k}^{2}}{s_{n}^{2}}}\to 0} as n {\displaystyle n\to \infty } , it guarantees that the contribution of any individual random variable X k {\displaystyle X_{k}} ( 1 k n {\displaystyle 1\leq k\leq n} ) to the variance s n 2 {\displaystyle s_{n}^{2}} is arbitrarily small, for sufficiently large values of n {\displaystyle n} .

Example

Consider the following informative example which satisfies the Lindeberg condition. Let ξ i {\displaystyle \xi _{i}} be a sequence of zero mean, variance 1 iid random variables and a i {\displaystyle a_{i}} a non-random sequence satisfying:

max i n | a i | a i 2 0 {\displaystyle \max _{i}^{n}{\frac {|a_{i}|}{\|a_{i}\|_{2}}}\rightarrow 0}

Now, define the normalized elements of the linear combination:

X n , i = a i ξ i a 2 {\displaystyle X_{n,i}={\frac {a_{i}\xi _{i}}{\|a\|_{2}}}}

which satisfies the Lindeberg condition:

i n E [ | X i | 2 1 ( | X i | > ε ) ] i n E [ | X i | 2 1 ( | ξ i | > ε a 2 max i n | a i | ) ] = E [ | ξ i | 2 1 ( | ξ i | > ε a 2 max i n | a i | ) ] {\displaystyle \sum _{i}^{n}\mathbb {E} \left[\left|X_{i}\right|^{2}1(|X_{i}|>\varepsilon )\right]\leq \sum _{i}^{n}\mathbb {E} \left[\left|X_{i}\right|^{2}1\left(|\xi _{i}|>\varepsilon {\frac {\|a\|_{2}}{\max _{i}^{n}|a_{i}|}}\right)\right]=\mathbb {E} \left[\left|\xi _{i}\right|^{2}1\left(|\xi _{i}|>\varepsilon {\frac {\|a\|_{2}}{\max _{i}^{n}|a_{i}|}}\right)\right]}

but ξ i 2 {\displaystyle \xi _{i}^{2}} is finite so by DCT and the condition on the a i {\displaystyle a_{i}} we have that this goes to 0 for every ε {\displaystyle \varepsilon } .

See also

  • Lyapunov condition
  • Central limit theorem

References

  1. ^ Billingsley, P. (1986). Probability and Measure (2nd ed.). Wiley. p. 369. ISBN 0-471-80478-9.
  2. ^ Ash, R. B. (2000). Probability and measure theory (2nd ed.). p. 307. ISBN 0-12-065202-1.
  3. ^ Resnick, S. I. (1999). A probability Path. p. 314.
  4. ^ Lindeberg, J. W. (1922). "Eine neue Herleitung des Exponentialgesetzes in der Wahrscheinlichkeitsrechnung". Mathematische Zeitschrift. 15 (1): 211–225. doi:10.1007/BF01494395. S2CID 119730242.
  5. ^ Athreya, K. B.; Lahiri, S. N. (2006). Measure Theory and Probability Theory. Springer. p. 348. ISBN 0-387-32903-X.