Is this equality generally true? | Probability

  • Thread starter Thread starter michonamona
  • Start date Start date
  • Tags Tags
    Probability
michonamona
Messages
120
Reaction score
0
Suppose Xn is a random variable. Let b and c be a constant.

Is the following generally true?

P(|X_{n}-b| \geq \epsilon) = P(|X_{n}-b|^{2} \geq \epsilon^{2})

This says that the probability that Xn minus b is greater than or equal to epsilon is equal to the probability that Xn minus b squared is greater than epsilon squared.

My prof keeps saying that they are the same event, therefore, they have the same probability. But I still don't understand. Any insight?

Thanks,
M
 
Physics news on Phys.org
Yes, it's generally true. It is because for any positive numbers a and b,

a \geq b

if and only if

a^2 \geq b^2
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top