F.3 BIENAYMÉ, CHEBYSHEV, AND MARKOV INEQUALITIES

Theorem F.5 (Bienaymé's inequality). For random variable X and nonrandom c:

(F.16) Numbered Display Equation

for every and .

Proof. Define the translated random variable with probability density function (pdf) fY(y). Since Y and fY(y) are nonnegative:

(F.17) Numbered Display Equation

where the lower limit has been increased from zero. Using the smallest value of y in the integrand and factoring it from the integral gives

(F.18) Numbered Display Equation

Rearranging the last expression completes the proof.

Theorem F.6 (Chebyshev's inequality). For random variable X with mean and variance :

(F.19) Numbered Display Equation

for every .

Proof. ...

Get Probability, Random Variables, and Random Processes: Theory and Signal Processing Applications now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.