Markov's inequality

Markov's inequality
Markov's inequality gives an upper bound for the measure of the set (indicated in red) where f(x) exceeds a given level \epsilon. The bound combines the level \epsilon with the average value of f.

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), and many sources, especially in analysis, refer to it as Chebyshev's inequality or Bienaymé's inequality.

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/5 of the population can have more than 5 times the average income.

Contents

Statement

If X is any random variable and a > 0, then

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

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

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

Corollary: Chebyshev's inequality

Chebyshev's inequality uses the variance to bound the probability that a random variable deviates far from the mean. Specifically:

\Pr(|X-\textrm{E}(X)| \geq a) \leq \frac{\textrm{Var}(X)}{a^2},

for any a>0. Here Var(X) is the variance of X, defined as:

 \operatorname{Var}(X) = \operatorname{E}[(X - \operatorname{E}(X) )^2].

Chebyshev's inequality follows from Markov's inequality by considering the random variable

 (X - \operatorname{E}(X))^2

for which Markov's inequality reads

 \Pr( (X - \operatorname{E}(X))^2 \ge a^2) \le \frac{\operatorname{Var}(X)}{a^2},


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.

In the language of probability theory

For any event E, let IE be the indicator random variable of E, that is, IE = 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.

In the language of measure theory

We may assume that the function f is non-negative, since only its absolute value enters in the equation. Now, consider the real-valued function s on X given by


s(x) =
\begin{cases}
 \epsilon, & \text{if } f(x) \geq \epsilon  \\
 0, & \text{if } f(x) < \epsilon
\end{cases}

Then s is a simple function such that 0\leq s(x)\leq f(x). By the definition of the Lebesgue integral


\int_X f(x) \, d\mu \geq \int_X s(x) \, d \mu = \epsilon \mu( \{ x\in X : \, f(x) \geq \epsilon \} )

and since ε > 0 , both sides can be divided by \epsilon, obtaining

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

Q.E.D.

Examples

See also


Wikimedia Foundation. 2010.

Игры ⚽ Нужна курсовая?

Look at other dictionaries:

  • Markov brothers' inequality — In mathematics, the Markov brothers inequality is an inequality proved by Andrey Markov and Vladimir Markov. This inequality bounds the maximum of the derivatives of a polynomial on an interval in terms of the maximum of the polynomial.[1] For k …   Wikipedia

  • Inequality — In mathematics, an inequality is a statement about the relative size or order of two objects, or about whether they are the same or not (See also: equality) *The notation a < b means that a is less than b . *The notation a > b means that a is… …   Wikipedia

  • Inequality (mathematics) — Not to be confused with Inequation. Less than and Greater than redirect here. For the use of the < and > signs as punctuation, see Bracket. More than redirects here. For the UK insurance brand, see RSA Insurance Group. The feasible regions… …   Wikipedia

  • Markov process — In probability theory and statistics, a Markov process, named after the Russian mathematician Andrey Markov, is a time varying random phenomenon for which a specific property (the Markov property) holds. In a common description, a stochastic… …   Wikipedia

  • Chebyshev's inequality — For the similarly named inequality involving series, see Chebyshev s sum inequality. In probability theory, Chebyshev’s inequality (also spelled as Tchebysheff’s inequality) guarantees that in any data sample or probability distribution, nearly… …   Wikipedia

  • Concentration inequality — In mathematics, concentration inequalities provide probability bounds on how a random variable deviates from some value (e.g. its expectation). The laws of large numbers of classical probability theory state that sums of independent random… …   Wikipedia

  • Andrey Markov — For other people named Andrey Markov, see Andrey Markov (disambiguation). Andrey (Andrei) Andreyevich Markov Born June 14, 1856( …   Wikipedia

  • Kolmogorov's inequality — In probability theory, Kolmogorov s inequality is a so called maximal inequality that gives a bound on the probability that the partial sums of a finite collection of independent random variables exceed some specified bound. The inequality is… …   Wikipedia

  • Hoeffding's inequality — Hoeffding s inequality, named after Wassily Hoeffding, is a result in probability theory that gives an upper bound on the probability for the sum of random variables to deviate from its expected value.Let :X 1, dots, X n ! be independent random… …   Wikipedia

  • Bernstein's inequality (mathematical analysis) — In the mathematical theory of mathematical analysis, Bernstein s inequality, named after Sergei Natanovich Bernstein, is defined as follows.Let P be a polynomial of degree n with derivative P prime; . Then:max(P ) le ncdotmax(P) where we define… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”