Lower Bound on Q(x) for X ~ Gaussian RV

  • Thread starter Thread starter iVenky
  • Start date Start date
  • Tags Tags
    Bound Gaussian
iVenky
Messages
212
Reaction score
12
I think everyone knows that

Q(x)= P(X>x) where X is a Gaussian Random variable.

Now I was reading about it and it says that Q(x) is bounded as follows

Q(x)≤ (1/2)(e-x2/2) for x≥0

and

Q(x)< [1/(√(2∏)x)](e-x2/2) for x≥0

and the lower bound is

Q(x)> [1/(√(2∏)x)](1-1/x2) e-x2/2 for x≥0

Can you tell me how you get this?Thanks a lot.
 
Last edited:
Physics news on Phys.org
One example for the first inequality: It is exact at x=0, as you can check. For 0&lt;x&lt;\frac{1}{\sqrt{2pi}}, the derivative of the upper estimate is larger (negative with a smaller magnitude) than the derivative of Q(x), which is simply the normal distribution. Therefore, the upper estimate is valid.

In the same way, for all larger x, consider the limit of both for x->inf: It is 0. Now, the upper bound has a smaller derivative (negative with larger magnitude) everywhere, therefore it is valid there, too.

I would expect that you can get the other inequalities with similar methods.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top