From Free net encyclopedia

This article is not about Chebyshev's sum inequality.

In probability theory, Chebyshev's inequality (also known as Tchebysheff's inequality, Chebyshev's theorem, or the Bienaymé-Chebyshev inequality), named after Pafnuty Chebyshev, who first proved it, states that in any data sample or probability distribution, nearly all the values are close to the mean value, and provides a quantitative description of "nearly all" and "close to". For example, no more than 1/4 of the values are more than 2 standard deviations away from the mean, no more than 1/9 are more than 3 standard deviations away, no more than 1/25 are more than 5 standard deviations away, and so on.

Contents 1 General statement 1.1 Measure-theoretic statement 1.2 Probabilistic statement 1.3 Example application 2 Variants 3 Proof 3.1 Measure-theoretic proof 3.2 Probabilistic proof 4 {1 \over k^2} {\operatorname{E}((X-\mu)^2) \over \sigma^2} 4.1 See also

General statement

The inequality can be stated quite generally using measure theory; the statement in the language of probability theory then follows as a particular case, for a space of measure 1.

Measure-theoretic statement

Let (X,Σ,μ) be a measure space, and let f be an extended real-valued measurable function defined on X. Then for any real number t > 0,

<math>\mu(\{x\in X|\,|f(x)|\geq t\}) \leq {1\over t^2} \int_X f^2 \, d\mu.</math>

More generally, if g is a nonnegative extended real-valued measurable function, nondecreasing on the range of f, then

<math>\mu(\{x\in X|\,f(x)\geq t\} \leq {1\over g(t)} \int_X g\circ f\, d\mu.</math>

The previous statement then follows by defining g(t) as

<math>g(t)=\begin{cases}t^2&\mbox{if }t\geq0\\0&\mbox{otherwise,}\end{cases}</math>

and taking |f| instead of f.

Probabilistic statement

Let X be a random variable with expected value μ and finite variance σ². Then for any real number k > 0,

<math>\Pr(\left|X-\mu\right|\geq k\sigma)\leq\frac{1}{k^2}.</math>

Only the cases k > 1 provide useful information.

Another consequence of the theorem is that for any distribution with mean μ and finite standard deviation σ, at least half of the values lie in the interval (μ − √2 σ, μ + √2 σ).

Typically, the theorem will provide rather loose bounds. However, the bounds provided by Chebyshev's inequality cannot, in general (remaining sound for variables of arbitrary distribution), be improved upon. For example, for any k > 1, the following example (where σ = 1/k) meets the bounds exactly.

<math>\begin{matrix}\Pr(X=-1) & = & 1/2k^2 \\ \\ \Pr(X=0) & = & 1 - 1/k^2 \\ \\ \Pr(X=1) & = & 1/2k^2 \end{matrix} </math>

The theorem can be useful despite loose bounds because it applies to random variables of any distribution, and because these bounds can be calculated knowing no more about the distribution than the mean and variance.

Chebyshev's inequality is used for proving the weak law of large numbers.

Example application

For illustration, assume we have a large body of text, for example articles from a publication. Assume we know that the articles are on average 1000 characters long with a standard deviation of 200 characters. From Chebyshev's inequality we can then deduce that at least 75% of the articles have a length between 600 and 1400 characters (k = 2).

Variants

A one-tailed variant with k > 0, is

<math>\Pr(X-\mu \geq k\sigma)\leq\frac{1}{1+k^2}.</math>

A stronger result applicable to unimodal probability distributions is the Vysochanskiï-Petunin inequality.

Proof

Measure-theoretic proof

Let A_t be defined as A_t = {x ∈ X | f(x) ≥ t}, and let

<math>1_{A_t}</math>

be the indicator function of the set A_t. Then, it is easy to check that

<math>0\leq g(t)1_{A_t}\leq g\circ f\,1_{A_t}\leq g\circ f,</math>

and therefore,

<math>g(t)\mu(A_t)=\int_X g(t)1_{A_t}\,d\mu\leq\int_{A_t} g\circ f\,d\mu\leq\int_X g\circ f\,d\mu.</math>

The desired inequality follows from dividing the above inequality by g(t).

Probabilistic proof

Markov's inequality states that for any real-valued random variable Y and any positive number a, we have Pr(|Y| > a) ≤ E(|Y|)/a. One way to prove Chebyshev's inequality is to apply Markov's inequality to the random variable Y = (X − μ)² with a = (σk)².

It can also be proved directly. For any event A, let I_A be the indicator random variable of A, i.e. I_A equals 1 if A occurs and 0 otherwise. Then

<math>\Pr(|X-\mu| \geq k\sigma) = \operatorname{E}(I_{|X-\mu| \geq k\sigma})

= \operatorname{E}(I_{[(X-\mu)/(k\sigma)]^2 \geq 1})</math>

<math>\leq \operatorname{E}\left( \left( {X-\mu \over k\sigma} \right)^2 \right)

{1 \over k^2} {\operatorname{E}((X-\mu)^2) \over \sigma^2}

{1 \over k^2}.</math>

The direct proof shows why the bounds are quite loose in typical cases: the number 1 to the left of "≥" is replaced by [(X − μ)/(kσ)]² to the right of "≥" whenever the latter exceeds 1. In some cases it exceeds 1 by a very wide margin.

See also

• Markov's inequality
• Table of mathematical symbolsde:Tschebyschow-Ungleichung

es:Desigualdad de Chebyshev fr:Inégalité de Bienaymé-Tchebychev it:Disuguaglianza di Tchebicheff no:Tsjebysjevs ulikhet pl:Nierówność Czebyszewa su:Chebyshev's inequality th:อสมการของเชบิเชฟ