Chebyshev's inequality
Chebyshev's inequality is an inequality applying to random variables with finite expected values.
All 4 facts, and where they come from
Facts
4 facts · 0 confirmed by two sources · 0 cited · 4 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2553154313
- Described as
- inequality applying to random variables with finite expected values
- Other names
- Bienaymé–Chebyshev inequality
- What it is
- concentration inequality; theorem
- Named after
- Pafnuty Chebyshev; Irénée-Jules Bienaymé
- Wikipedias with a page
- 32
Wikidata item Q249514 (wikidata.org/wiki/Q249514), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1372897661
In probability theory, Chebyshev's inequality (also called the Bienaymé–Chebyshev inequality) provides an upper bound on the probability of deviation of a random variable (with finite variance) from its mean. More specifically, the probability that a random variable deviates from its mean by more than kσ is at most 1/k2, where k is any positive constant and σ is the standard deviation (the square root of the variance).
The rule is often called Chebyshev's theorem, about the range of standard deviations around the mean, in statistics. The inequality has great utility because it can be applied to any probability distribution in which the mean and variance are defined. For example, it can be used to prove the weak law of large numbers.
Its practical usage is similar to the 68–95–99.7 rule, which applies only to normal distributions. Chebyshev's inequality is more general, stating that a minimum of just 75% of values must lie within two standard deviations of the mean and 88.88% within three standard deviations for a broad range of different probability distributions.
The term Chebyshev's inequality may also refer to Markov's inequality, especially in the context of analysis. They are closely related, and some authors refer to Markov's inequality as "Chebyshev's First Inequality," and the similar one referred to on this page as "Chebyshev's Second Inequality."
Chebyshev's inequality is tight in the sense that for each chosen positive constant, there exists a random variable such that the inequality is in fact an equality.
From the Wikipedia article “Chebyshev's inequality” (en.wikipedia.org/wiki/Chebyshev's_inequality), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
