Berry–Esseen theorem

In probability theory, the central limit theorem states that, under certain circumstances, the probability distribution of the scaled mean of a random sample converges to a normal distribution as the sample size increases to infinity. Under stronger assumptions, the Berry–Esseen theorem, or Berry–Esseen inequality, gives a more quantitative result, because it also specifies the rate at which this convergence takes place by giving a bound on the maximal error of approximation between the normal distribution and the true distribution of the scaled sample mean. The approximation is measured by the Kolmogorov–Smirnov distance. In the case of independent samples, the convergence rate is n^−1/2, where n is the sample size, and the constant is estimated in terms of the third absolute normalized moment.

Statement of the theorem

Statements of the theorem vary, as it was independently discovered by two mathematicians, Andrew C. Berry (in 1941) and Carl-Gustav Esseen (1942), who then, along with other authors, refined it repeatedly over subsequent decades.

Identically distributed summands

One version, sacrificing generality somewhat for the sake of clarity, is the following:

There exists a positive constant C such that if X₁, X₂, ..., are i.i.d. random variables with E(X₁) = 0, E(X₁²) = σ² > 0, and E(|X₁|³) = ρ < ∞,^{[note 1]} and if we define

${\displaystyle Y_{n}={X_{1}+X_{2}+\cdots +X_{n} \over n}}$

the sample mean, with F_n the cumulative distribution function of

${\displaystyle {Y_{n}{\sqrt {n}} \over {\sigma }},}$

and Φ the cumulative distribution function of the standard normal distribution, then for all x and n,

${\displaystyle \left|F_{n}(x)-\Phi (x)\right|\leq {C\rho \over \sigma ^{3}{\sqrt {n}}}.\ \ \ \ (1)}$

That is: given a sequence of independent and identically distributed random variables, each having mean zero and positive variance, if additionally the third absolute moment is finite, then the cumulative distribution functions of the standardized sample mean and the standard normal distribution differ (vertically, on a graph) by no more than the specified amount. Note that the approximation error for all n (and hence the limiting rate of convergence for indefinite n sufficiently large) is bounded by the order of n^−1/2.

Calculated upper bounds on the constant C have decreased markedly over the years, from the original value of 7.59 by Esseen (1942), to 0.7882 by van Beek (1972), then 0.7655 by Shiganov (1986), then 0.7056 by Shevtsova (2007), then 0.7005 by Shevtsova (2008), then 0.5894 by Tyurin (2009), then 0.5129 by Korolev & Shevtsova (2010a), then 0.4785 by Tyurin (2010). The detailed review can be found in the papers Korolev & Shevtsova (2010a) and Korolev & Shevtsova (2010b). The best estimate as of 2012^[update], C < 0.4748, follows from the inequality

${\displaystyle \sup _{x\in \mathbb {R} }\left|F_{n}(x)-\Phi (x)\right|\leq {0.33554(\rho +0.415\sigma ^{3}) \over \sigma ^{3}{\sqrt {n}}},}$

due to Shevtsova (2011), since σ³ ≤ ρ and 0.33554 · 1.415 < 0.4748. However, if ρ ≥ 1.286σ³, then the estimate

${\displaystyle \sup _{x\in \mathbb {R} }\left|F_{n}(x)-\Phi (x)\right|\leq {0.3328(\rho +0.429\sigma ^{3}) \over \sigma ^{3}{\sqrt {n}}},}$

which is also proved in Shevtsova (2011), gives an even tighter upper estimate.

Esseen (1956) proved that the constant also satisfies the lower bound

${\displaystyle C\geq {\frac {{\sqrt {10}}+3}{6{\sqrt {2\pi }}}}\approx 0.40973\approx {\frac {1}{\sqrt {2\pi }}}+0.01079.}$

Non-identically distributed summands

Let X₁, X₂, ..., be independent random variables with E(X_i) = 0, E(X_i²) = σ_i² > 0, and E(|X_i|³) = ρ_i < ∞. Also, let

${\displaystyle S_{n}={X_{1}+X_{2}+\cdots +X_{n} \over {\sqrt {\sigma _{1}^{2}+\sigma _{2}^{2}+\cdots +\sigma _{n}^{2}}}}}$

be the normalized n-th partial sum. Denote F_n the cdf of S_n, and Φ the cdf of the standard normal distribution. For the sake of convenience denote

${\displaystyle {\vec {\sigma }}=(\sigma _{1},\ldots ,\sigma _{n}),\ {\vec {\rho }}=(\rho _{1},\ldots ,\rho _{n}).}$

In 1941, Andrew C. Berry proved that for all n there exists an absolute constant C₁ such that

${\displaystyle \sup _{x\in \mathbb {R} }\left|F_{n}(x)-\Phi (x)\right|\leq C_{1}\cdot \psi _{1},\ \ \ \ (2)}$

where

${\displaystyle \psi _{1}=\psi _{1}{\big (}{\vec {\sigma }},{\vec {\rho }}{\big )}={\Big (}{\textstyle \sum \limits _{i=1}^{n}\sigma _{i}^{2}}{\Big )}^{-1/2}\cdot \max _{1\leq i\leq n}{\frac {\rho _{i}}{\sigma _{i}^{2}}}.}$

Independently, in 1942, Carl-Gustav Esseen proved that for all n there exists an absolute constant C₀ such that

${\displaystyle \sup _{x\in \mathbb {R} }\left|F_{n}(x)-\Phi (x)\right|\leq C_{0}\cdot \psi _{0},\ \ \ \ (3)}$

where

${\displaystyle \psi _{0}=\psi _{0}{\big (}{\vec {\sigma }},{\vec {\rho }}{\big )}={\Big (}{\textstyle \sum \limits _{i=1}^{n}\sigma _{i}^{2}}{\Big )}^{-3/2}\cdot \sum \limits _{i=1}^{n}\rho _{i}.}$

It is easy to make sure that ψ₀≤ψ₁. Due to this circumstance inequality (3) is conventionally called the Berry–Esseen inequality, and the quantity ψ₀ is called the Lyapunov fraction of the third order. Moreover, in the case where the summands X₁, ..., X_n have identical distributions

${\displaystyle \psi _{0}=\psi _{1}={\frac {\rho _{1}}{\sigma _{1}^{3}{\sqrt {n}}}},}$

and thus the bounds stated by inequalities (1), (2) and (3) coincide apart from the constant.

Regarding C₀, obviously, the lower bound established by Esseen (1956) remains valid:

${\displaystyle C_{0}\geq {\frac {{\sqrt {10}}+3}{6{\sqrt {2\pi }}}}=0.4097\ldots .}$

The lower bound is exactly reached only for certain Bernoulli distributions (see Esseen (1956) for their explicit expressions).

The upper bounds for C₀ were subsequently lowered from the original estimate 7.59 due to Esseen (1942) to (considering recent results only) 0.9051 due to Zolotarev (1967), 0.7975 due to van Beek (1972), 0.7915 due to Shiganov (1986), 0.6379 and 0.5606 due to Tyurin (2009) and Tyurin (2010). As of 2011^[update] the best estimate is 0.5600 obtained by Shevtsova (2010).

Multidimensional version

As with the multidimensional central limit theorem, there is a multidimensional version of the Berry–Esseen theorem.^[1][2]

Let ${\displaystyle X_{1},\dots ,X_{n}}$ be independent ${\displaystyle \mathbb {R} ^{d}}$-valued random vectors each having mean zero. Write ${\displaystyle S_{n}=\sum _{i=1}^{n}X_{i}}$ and assume ${\displaystyle \Sigma _{n}=\operatorname {Cov} [S_{n}]}$ is invertible. Let ${\displaystyle Z_{n}\sim \operatorname {N} (0,{\Sigma _{n}})}$ be a ${\displaystyle d}$-dimensional Gaussian with the same mean and covariance matrix as ${\displaystyle S_{n}}$. Then for all convex sets ${\displaystyle U\subseteq \mathbb {R} ^{d}}$,

${\displaystyle {\big |}\Pr[S_{n}\in U]-\Pr[Z_{n}\in U]\,{\big |}\leq Cd^{1/4}\gamma _{n}}$,

where ${\displaystyle C}$ is a universal constant and ${\displaystyle \gamma _{n}=\sum _{i=1}^{n}\operatorname {E} {\big [}\|\Sigma _{n}^{-1/2}X_{i}\|_{2}^{3}{\big ]}}$ (the third power of the L² norm).

The dependency on ${\displaystyle d^{1/4}}$ is conjectured to be optimal, but might not be.^[2]

See also

• Chernoff's inequality
• Edgeworth series
• List of inequalities
• List of mathematical theorems
• Concentration inequality

Notes

References

External links

• Gut, Allan & Holst Lars. Carl-Gustav Esseen, retrieved Mar. 15, 2004.
• "Berry–Esseen inequality", Encyclopedia of Mathematics, EMS Press, 2001 [1994]