Chebyshev Inequality

Chebyshev Inequality 

(1) A basic inequality for monotonic sequences or functions. In the case of the finite sequences a₁ ≤ a₂ ≤ . . . ≤ a_n and b_l ≤ b₂ = ≤ . . . ≤ b_n it has the form

In integral form we have

Here, f(x) ≥ 0 and g(x) ≥ 0; in addition, the functions are either both increasing or both decreasing. The inequality was derived by P. L. Chebyshev in 1882.

(2) An inequality that provides an estimate of the probability that the deviation of a random variable from its mathematical expectation exceeds some given limit. Let ξ be a random variable, Eξ = a its mathematical expectation, and Dξ = σ² its variance. The Chebyshev inequality asserts that the probability of the inequality

|ξ – a| ≥ kσ

does not exceed the quantity 1/k². If ξ is the sum of independent random variables and some additional restrictions are made, then the estimate 1/k² can be replaced by the estimate 2 exp (–k²/4), which decreases with increasing k much more rapidly.

The inequality is named for P. L. Chebyshev, who used it in 1867 to establish extremely broad conditions for the application of the law of large numbers to sums of independent random variables. (SeeLARGE NUMBERS, LAW OF; LIMIT THEOREMS.)