Markov's inequality: Definition from Answers.com

Markov's inequality gives an upper bound for the probability that X lies within the set indicated in red.

In probability theory, Markov's inequality gives an upper bound for the probability that a non-negative function of a random variable is greater than or equal to some positive constant. It is named after the Russian mathematician Andrey Markov, although it appeared earlier in the work of Pafnuty Chebyshev (Markov's teacher).

Markov's inequality (and other similar inequalities) relate probabilities to expectations, and provide (frequently) loose but still useful bounds for the cumulative distribution function of a random variable.

An example of an application of Markov's inequality is the fact that (assuming incomes are non-negative) no more than 1/5th of the population can have more than 5 times the average income.

1 Statement
2 Proofs
- 2.1 Special case: probability theory
- 2.2 General case: measure theory
3 Examples

Statement

In the language of measure theory, Markov's inequality states that if (X,Σ,μ) is a measure space, f is a measurable extended real-valued function, and t > 0, then

$\mu(\{x\in X:|f(x)|\geq t\}) \leq {1\over t}\int_X |f|\,d\mu.$

For the special case where the space has measure 1 (i.e., it is a probability space), it can be restated as follows: if X is any random variable and a > 0, then

$\textrm{Pr}(|X| \geq a) \leq \frac{\textrm{E}(|X|)}{a}.$

Proofs

We separate the case in which the measure space is a probability space from the more general case because the probability case is more accessible for the general reader.

Special case: probability theory

For any event E, let I_E be the indicator random variable of E, that is, I_E = 1 if E occurs and = 0 otherwise. Thus I_{(|X| ≥ a)} = 1 if the event |X| ≥ a occurs, and I_{(|X| ≥ a)} = 0 if |X| < a. Then, given a > 0,

$aI_{(|X| \geq a)} \leq |X|.\,$

which is clear if we consider the two possible values of I_{(|X| ≥ a)}. Either |X| < a and thus I_{(|X| ≥ a)} = 0, or I_{(|X| ≥ a)} = 1 and by the condition of I_{(|X| ≥ a)}, the inequality must be true.

Therefore

$\operatorname{E}(aI_{(|X| \geq a)}) \leq \operatorname{E}(|X|).\,$

Now, using linearity of expectations, the left side of this inequality is the same as

$a\operatorname{E}(I_{(|X| \geq a)})=a\Pr(|X| \geq a).\,$

Thus we have

$a\Pr(|X| \geq a) \leq \operatorname{E}(|X|)\,$

and since a > 0, we can divide both sides by a.

General case: measure theory

For any measurable set A, let 1_A be its indicator function, that is, 1_A(x) = 1 if x ∈ A, and 0 otherwise. If A_t is defined as A_t = {x ∈ X| |f(x)| ≥ t}, then

$0\leq t\,1_{A_t}\leq |f|1_{A_t}\leq |f|.$

Therefore

$\int_X t\,1_{A_t}\,d\mu\leq\int_{A_t}|f|\,d\mu\leq\int_X |f|\,d\mu.$

Now, note that the left side of this inequality is the same as

$t\int_X 1_{A_t}\,d\mu=t\mu(A_t).$

Thus we have

$t\mu(\{x\in X|\,|f(x)|\geq t\}) \leq \int_X|f|\,d\mu,$

and since t > 0, both sides can be divided by t, obtaining

$\mu(\{x\in X|\,|f(x)|\geq t\}) \leq {1\over t}\int_X|f|\,d\mu.$

Q.E.D.

Examples

Markov's inequality is used to prove Chebyshev's inequality.

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

	Hoeffding's inequality
	Multidimensional Chebyshev's inequality
	Chebyshev's inequality

	What are inequalities? Read answer...
	How do you write an inequality as two inequalities? Read answer...
	Why the Gauss Markov Theorem is Important in the econometrics? Read answer...

	Can SPSS tools do Markov Analysis?
	What is the Markov analysis technique?
	What are the examples of gauss-markov theorem?

		Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more
		Wikipedia. This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article "Markov's inequality". Read more

Markov's inequality

Contents

Statement

Proofs

Special case: probability theory

General case: measure theory

Examples