Chebyshev's inequality


Also found in: Dictionary, Wikipedia.

Chebyshev's inequality

[′cheb·ə·shəfs ‚in·i′kwäl·əd·ē]
(statistics)
Given a nonnegative random variable ƒ(x), and k > 0, the probability that ƒ(x) ≥ k is less than or equal to the expected value of ƒ divided by k.
References in periodicals archive ?
The proof is straightforward using Chebyshev's inequality.
Under the assumption of unimodality, Chebyshev's inequality may be sharpened (though not uniformly).
Using the Chebyshev's inequality to sin A/2, sin B/2, sin c/2 and cos A/2, cos c/2 we get