Chebyshev inequalities

E451512

concentration inequality probabilistic inequality

Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (7)

Label	Occurrences
Chebyshev inequality	3
Chebyshev inequalities canonical	1
Chebyshev inequality in many settings	1
Chebyshev–Cantelli inequalities	1
Chebyshev’s inequality	1
Chebyshev’s theorems	1
Markov inequality	1

How this entity was disambiguated

This entity first appeared as the object of triple T4552117 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.

NED1 Entity disambiguation (via context triple) gpt-5-mini-2025-08-07

Target entity: Chebyshev inequalities
Context triple: [Inequalities, containsTopic, Chebyshev inequalities]

A. Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
B. Bernstein inequalities
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
C. Cauchy–Schwarz inequality
The Cauchy–Schwarz inequality is a fundamental result in linear algebra and analysis that bounds the inner product of two vectors by the product of their magnitudes, underpinning many concepts in geometry, probability, and functional analysis.
D. Minkowski inequality
The Minkowski inequality is a fundamental result in functional analysis and measure theory that generalizes the triangle inequality to L^p spaces, providing a key tool for studying norms and integrable functions.
E. Karamata's inequality
Karamata's inequality is a fundamental result in majorization theory that generalizes several classical inequalities by comparing sums of convex (or concave) functions over majorized sequences.
F. None of above. chosen
G. Unsure - the case is ambiguous/there is not enough information to decide.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Chebyshev inequalities
Target entity description: Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.

A. Berry–Esseen theorem
The Berry–Esseen theorem is a quantitative refinement of the central limit theorem that provides explicit bounds on the rate of convergence of normalized sums of independent random variables to the normal distribution.
B. Bernstein inequalities
Bernstein inequalities are fundamental results in approximation theory and probability that provide bounds on the derivatives or deviations of functions and random variables under certain smoothness or moment conditions.
C. Cauchy–Schwarz inequality
The Cauchy–Schwarz inequality is a fundamental result in linear algebra and analysis that bounds the inner product of two vectors by the product of their magnitudes, underpinning many concepts in geometry, probability, and functional analysis.
D. Minkowski inequality
The Minkowski inequality is a fundamental result in functional analysis and measure theory that generalizes the triangle inequality to L^p spaces, providing a key tool for studying norms and integrable functions.
E. Karamata's inequality
Karamata's inequality is a fundamental result in majorization theory that generalizes several classical inequalities by comparing sums of convex (or concave) functions over majorized sequences.
F. None of above. chosen

Statements (46)

Predicate	Object
instanceOf	concentration inequality ⓘ probabilistic inequality ⓘ
alsoKnownAs	Chebyshev–Cantelli inequalities ⓘ linked to: Chebyshev inequalities Chebyshev’s inequality ⓘ linked to: Chebyshev inequalities
appliesTo	both discrete and continuous random variables ⓘ random variables with finite variance ⓘ
assumes	finite second moment ⓘ
category	inequalities in probability theory ⓘ
doesNotAssume	independence of observations ⓘ symmetry of distribution ⓘ
doesNotRequire	specific distributional assumptions ⓘ
field	probability theory ⓘ statistics ⓘ
foundationFor	other concentration inequalities ⓘ
generalizes	empirical rule to arbitrary distributions with finite variance ⓘ
guarantees	at least 1−1/k² of probability mass lies within k standard deviations of mean ⓘ
hasForm	P(\|X−μ\| ≥ kσ) ≤ 1/k² for k>0 ⓘ
hasOneSidedForm	P(X−μ ≥ kσ) ≤ 1/(1+k²) in Cantelli form ⓘ
hasProperty	applies for all k>0 ⓘ tight for some distributions ⓘ
implies	at least 75% of values lie within 2 standard deviations of mean ⓘ at least 89% of values lie within 3 standard deviations of mean ⓘ at least 96% of values lie within 5 standard deviations of mean ⓘ probability of large deviation is small if variance is small ⓘ
is	distribution-agnostic ⓘ often loose compared to distribution-specific bounds ⓘ
isSpecialCaseOf	Markov inequality ⓘ linked to: Chebyshev inequalities
namedAfter	Pafnuty Chebyshev ⓘ
provides	upper bound on tail probabilities ⓘ
relatedTo	Chernoff bounds ⓘ linked to: Chernoff bound Hoeffding inequality ⓘ linked to: Azuma–Hoeffding inequality Markov inequality ⓘ
relates	variance to deviation from mean ⓘ
type	moment inequality ⓘ
usedFor	bounding error probabilities in algorithms ⓘ constructing confidence bounds ⓘ distribution-free bounds ⓘ proving weak law of large numbers ⓘ robust risk assessment ⓘ sample size estimation ⓘ
usedIn	actuarial science ⓘ finance ⓘ machine learning ⓘ quality control ⓘ
uses	mean of a random variable ⓘ variance of a random variable ⓘ

How these facts were elicited