Math 2.0

statement theorem

Markov's inequality

Statement

Let XX be a random variable with values in [0,∞)[0, \infty) and let a>0a > 0. Then P(X≥a)≤E[X]a.P(X \ge a) \le \frac{E[X]}{a}.

Remarks

Proof: a 1{X≥a}≤Xa \, 1_{\{X \ge a\}} \le X pointwise. Take expectations: a P(X≥a)≤E[X]a \, P(X \ge a) \le E[X]. More generally, for each nondecreasing g ⁣:[0,∞)→[0,∞)g \colon [0, \infty) \to [0, \infty) with g(a)>0g(a) > 0, P(X≥a)≤E[g(X)]/g(a)P(X \ge a) \le E[g(X)]/g(a). Applied to (X−E[X])2(X - E[X])^2, the inequality gives Chebyshev's inequality. Applied to etXe^{tX}, it gives the Chernoff bound.

History

The inequality is named after Andrey Markov. It appears earlier in the work of Pafnuty Chebyshev, the teacher of Markov.

Explanations

L1 human

A nonnegative quantity with a small average cannot often be large. If the mean income is 3000030000, then at most one person in five can have an income of 150000150000 or more.

What this node needs for W2
  • edge about out: the concepts that the statement is about (0 of 1)
  • edge proves in: at least one proof node (0 of 1)
  • edge instance_of or illustrates in: one example that shows the statement at work (0 of 1)
  • explanation L2 (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What depends on this

6 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Markov's_inequality, Statement