Quiz 1 Probability Theory 2025.pdf
Problem 1
Define the group operation to be symmetric difference.
Problem 2
is a probability space such that for all . Let be a random variable, not necessarily discrete. Prove that there exists such that .
Let . Note that is countable. Now,
Since , it must be the case that for exactly one . Consider the interval . If , we are done. Else, either or . Repeat the steps on the interval whose probability is . We will either get a point such that and stop, or keep going and obtain a sequence of nested intervals . We know from the nested interval property that their intersection will be a singleton, . Also, if we consider the set in , it forms a countable descending sequence. Let their intersection be . We know that the probability of their intersection is the limit of their probabilities, which is . Thus, . Clearly, , since if , , and there exists an interval in containing but not containing . Thus, .
Problem 3
Let be a probability space. Let be a sequence of events in . Note that
Fatou’s Lemma
Theorem 1(Lemma).
is a probability space, and is a sequence of events in . Then,
where this property has been used. Results from here have also been used.
Now, for all . Thus, it is a lower bound for and hence must be less than or equal to its infimum. Thus, we have
This holds for all . Thus, it must be that .
Hence the first inequality holds.
The second inequality follows from the definition of lim inf and lim sup.
For the third inequality, we have
Since is an upper bound for , . Thus, the fourth inequality holds.
Borel-Cantelli lemma
Theorem 2(Lemma).
Let be a sequence of events such that . Then, . In other words, the probability of infinitely many occurring is .
. We know that
So, . Since , .
Second Borel-Cantelli lemma
A partial converse of the first lemma.
Theorem 3(Lemma).
If is a sequence of independent events such that , then . In other words, If the events are independent and the sum of the probabilities of the diverges to infinity, then the probability that infinitely many of them occur is 1.