How would you go about doing this? is it really obvious?

Printable View

- May 15th 2009, 08:15 AMn7615rProbability Axioms
How would you go about doing this? is it really obvious?

- May 15th 2009, 08:53 AMIsomorphism
So where are you having trouble? Is it in:

The first part : Reading set notations(about the infinitely often)

The second part : The union bound axiom? the one that says probability of union of countable number of events is upperbounded by the sum of probability of those events

In case of basic application problems like these, its beneficial to both (us and you), if you tell us where you are having trouble. - May 15th 2009, 09:22 AMn7615r
i'm having trouble understanding the set notation and how 'infintely often can be written in that way.

and also showing how the P(A)≤P(Bn). is it because A is a subset of Bn?

and how does this relate to the third part? - May 15th 2009, 11:33 AMMoo
Hello,

If happens, it means that there is at least one in its union that happens.

This can be translated as " , such that happens"

Then, for to happen, has to happen for any

This can finally be translated as "for any n, there exists m>n such that happens".

In other words, there are infinitely many events that happen.

You can read this for more things : http://www.mathhelpforum.com/math-he...up-liminf.html in particular post #4, by**Laurent**(Wink)

Quote:

and also showing how the P(A)≤P(Bn). is it because A is a subset of Bn?

Since A is, as you noticed, a subset of , then there exists a set ,*disjoint*from A, such that

By the third axiom, we have (the red equality) :

Now, by the first axiom, we know that

And it follows that (Wink)

Quote:

and how does this relate to the third part?

And note that if , this implies that the partial reminder (I don't know the exact name)

It should be okay from now :)

Quote:

The second part : The union bound axiom? the one that says probability of union of countable number of events is upperbounded by the sum of probability of those events

- May 15th 2009, 11:43 AMn7615r
Thanks so much! this was a great help :)

- May 15th 2009, 12:45 PMIsomorphism