How to prove the tightness of Markov's bound?

$\begingroup$

Show that Markov's inequality is as tight as it possible. Given a positive integer $k$, describe a random variable $X$ that assumes only non-negative values:

$$\Pr[X \geq k E[X] ] = 1/k.$$

Using Markov's bound, we can show at most $1/k$. But how to show equality?! My question to be exact what is the idea to prove the tightness of this bound!

$\endgroup$

1 Answer

$\begingroup$

Consider a random variable $X$ which takes the value $1$ with probability $1/k$ and $0$ with probability $1-1/k$.

$\endgroup$ 4

Your Answer

Sign up or log in

Sign up using Google Sign up using Facebook Sign up using Email and Password Submit

Post as a guest

Post Your Answer Discard

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy