2
$\begingroup$

I noticed that if $X$ is a RV in $[0,1]$ then $V[X] \leq E[X](1-E[X])$, which also implies that the bernoulli distribution maximizes variance (one of many solutions).

For interest's sake consider the discrete case: let $p_i \geq 0$ give probability of $1 \geq x_i \geq 0$, we assume: $V[X] > E[X](1-E[X])$

\begin{align} E[X^2] - E[X]^2 & > E[X](1-E[X]) \\ \sum_i x_i^2p_i & > \sum_i x_ip_i\\ \sum_i (x_i-1)x_ip_i & > 0 \end{align}

Which is a contradiction since $(x_i-1) \leq 0, x_i \geq 0, p_i \geq 0$.

Anyway, this is a rather handy fact, does this inequality have a name, generalization, or further extensions?

$\endgroup$
5
  • $\begingroup$ jensen inequality? $\endgroup$ – Simone May 7 '13 at 6:20
  • $\begingroup$ I don't see a relationship to Jensen's.. care to elaborate? $\endgroup$ – fairidox May 7 '13 at 6:42
  • $\begingroup$ Sorry, my bad. I didn't read it carefully. I just found this, they use this fact to exploit other upper bounds: stat.fsu.edu/techreports/M807.pdf $\endgroup$ – Simone May 7 '13 at 10:30
  • $\begingroup$ I don't know if the inequality $\operatorname{var}(X) \leq E[X](1-E[X])$ for random variables taking on values in $[0,1]$ has a name or not, but a generalized version (for random variables taking on values in $[0,c]$) can be found here. See also this question and the answers to it. $\endgroup$ – Dilip Sarwate May 7 '13 at 12:55
  • 1
    $\begingroup$ There is a much, much simpler proof which is fully general: since $V[X]+E[X]^2$ = $E[X^2]$ and $|X|\le 1$, it is obvious that $E[X^2]\le E[1\cdot X] = E[X]$ and the result follows upon subtracting $E[X]^2$. (This is a trivial instance of Holder's Inequality, inter alia.) It can also be seen as an application of the Cauchy-Schwarz Inequality. $\endgroup$ – whuber May 7 '13 at 13:49

Your Answer

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

Browse other questions tagged or ask your own question.