Chebyshev's inequality

Chebyshev's inequality

also called  Bienaymé-Chebyshev inequality 

      in probability theory, a theorem that characterizes the dispersion of data away from its mean (average). The general theorem is attributed to the 19th-century Russian mathematician Pafnuty Chebyshev (Chebyshev, Pafnuty Lvovich), though credit for it should be shared with the French mathematician Irénée-Jules Bienaymé, whose (less general) 1853 proof predated Chebyshev's by 14 years.

      Chebyshev's inequality puts an upper bound on the probability that an observation should be far from its mean. It requires only two minimal conditions: (1) that the underlying distribution (distribution function) have a mean and (2) that the average size of the deviations away from this mean (as gauged by the standard deviation) not be infinite. Chebyshev's inequality then states that the probability that an observation will be more than k standard deviations from the mean is at most 1/k2. Chebyshev used the inequality to prove his version of the law of large numbers.

      Unfortunately, with virtually no restriction on the shape of an underlying distribution, the inequality is so weak as to be virtually useless to anyone looking for a precise statement on the probability of a large deviation. To achieve this goal, people usually try to justify a specific error distribution, such as the normal distribution as proposed by the German mathematician Carl Friedrich Gauss (Gauss, Carl Friedrich). Gauss also developed a tighter bound, 4/9k2 (for k > 2/√3), on the probability of a large deviation by imposing the natural restriction that the error distribution decline symmetrically from a maximum at 0.

      The difference between these values is substantial. According to Chebyshev's inequality, the probability that a value will be more than two standard deviations from the mean (k = 2) cannot exceed 25 percent. Gauss's bound is 11 percent, and the value for the normal distribution is just under 5 percent. Thus, it is apparent that Chebyshev's inequality is useful only as a theoretical tool for proving generally applicable theorems, not for generating tight probability bounds.

Richard Routledge
 

* * *


Universalium. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Chebyshev's inequality — For the similarly named inequality involving series, see Chebyshev s sum inequality. In probability theory, Chebyshev’s inequality (also spelled as Tchebysheff’s inequality) guarantees that in any data sample or probability distribution, nearly… …   Wikipedia

  • Chebyshev's inequality — noun The theorem that in any data sample with finite variance, the probability of any random variable X lying within an arbitrary real k number of standard deviations of the mean is 1 / k, i.e. assuming mean μ and standard deviation σ, the… …   Wiktionary

  • Multidimensional Chebyshev's inequality — In probability theory, the multidimensional Chebyshev s inequality is a generalization of Chebyshev s inequality, which puts a bound on the probability of the event that a random variable differs from its expected value by more than a specified… …   Wikipedia

  • Chebyshev's theorem — is a name given to several theorems proven by Russian mathematician Pafnuty Chebyshev Bertrand s postulate Chebyshev s inequality Chebyshev s sum inequality Chebyshev s equioscillation theorem The statement that if the function has a limit at… …   Wikipedia

  • Chebyshev, Pafnuty Lvovich — ▪ Russian mathematician born May 4 [May 16, New Style], 1821, Okatovo, Russia died November 26 [December 8], 1894, St. Petersburg  founder of the St. Petersburg mathematical school (sometimes called the Chebyshev school), who is remembered… …   Universalium

  • Chebyshev's sum inequality — For the similarly named inequality in probability theory, see Chebyshev s inequality. In mathematics, Chebyshev s sum inequality, named after Pafnuty Chebyshev, states that if and then Similarly, if …   Wikipedia

  • Inequality — In mathematics, an inequality is a statement about the relative size or order of two objects, or about whether they are the same or not (See also: equality) *The notation a < b means that a is less than b . *The notation a > b means that a is… …   Wikipedia

  • Inequality (mathematics) — Not to be confused with Inequation. Less than and Greater than redirect here. For the use of the < and > signs as punctuation, see Bracket. More than redirects here. For the UK insurance brand, see RSA Insurance Group. The feasible regions… …   Wikipedia

  • Pafnuty Chebyshev — Chebyshev redirects here. For other uses, see Chebyshev (disambiguation). Pafnuty Chebyshev Pafnuty Lvovich Chebyshev Born May 16, 1821 …   Wikipedia

  • Markov's inequality — gives an upper bound for the measure of the set (indicated in red) where f(x) exceeds a given level . The bound combines the level with the average value of f …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”