Sheet 4
††course: Wahrscheinlichkeitstheorie 1††semester: FSS 2022††tutorialDate: 14.03.2022††dueDate: 10:15 in the exercise on Monday 14.03.2022Exercise 1 (Scheffé’s Lemma).
Suppose that is a sequences of random variables in such that almost surely. Show that the following statements are equivalent:
-
(i)
in , as ;
-
(ii)
, as .
Hint.
Apply Fatou’s Lemma to .
Solution.
(i) (ii) Follows from the reverse triangle inequality
(1) |
and Jensen’s inequality
(ii) (i): By Fatou’s Lemma we have
This implies
and therefore convergence. ∎
Exercise 1’ (Generalized Scheffé’s Lemma - Optional).
Assume that converges in probability to . Then the following statements are equivalent:
-
(i)
, as .
-
(ii)
For all we have
-
(iii)
are uniformly integrable
-
(iv)
in , as ;
Hint.
Solution.
(i) (ii): Fix and choose any . Then there exists such that
(2) |
Since is uniformly integrable, there exists such that
Since in probability, there therefore exists such that for all
(3) |
Now we plug things together. We have for
This implies the claim. The first sum exploits the fact that the mass of the random variables has to be similar. So we can not concentrate mass on a small event such as being far from . Which is what examples of convergence in probability without convergence exploit.
So fix some . We select and then select such that for all we have
(4) |
As is a finite set it is uniformly integrable, and there exists such that
(5) |
Similarly there exists , such that
(6) |
To put things together, note that we always have
(7) |
This implies for all
Exercise 2 (Lemma 6.3.5).
Let be an -submartingale and be bounded stopping times such that a.s. Prove that, .
Hint.
Consider the stochastic integral of against with .
Solution.
Since are stopping times, we have that
is measurable and therefore that the process is previsible. The stochastic integral
is a submartingale since is positive. Since are bounded, there exists such that
Exercise 3 (Uniform Integrability).
-
(i)
(Example 6.3.12 (i)) Prove that every finite set of integrable random variables is uniformly integrable.
Solution.
The first property follows by the fact that the set of random variables is integrable. The second property follows from
where we use that limits can be interchanged with finite sums. ∎
-
(ii)
If , then the set is uniformly bounded if and only if is uniformly bounded.
Solution.
Assume that is uniformly bounded. Then there exists some such that for all . Therefore we have for all that a.s. for all , which implies
In particular the limit in is zero. Assume on the other hand that is not uniformly bounded. Then for every there exists some with , implying
Therefore the limes superior in is at least , so we know that is not uniformly bounded. ∎
Exercise 4 (Uniqueness of Limits in Probability).
-
(i)
(Triangle Inequality of Probability) Prove that for random variables on some metric space with metric we have
Solution.
Assume is in the set on the left, then due to
we have either or , therefore has to be in the union of sets on the right. ∎
Let us now assume that and
-
(ii)
Prove that for all .
Hint.
Recall the proof of uniqueness for deterministic sequences. Apply a similar trick.
Solution.
As the triangle inequality of probability with , holds for all it also holds for the limit, therefore
-
(iii)
Conclude that a.s.
Solution.
We can calculate the complementing event by
Exercise 5 (Bound on Stopping Times).
Let be a -stopping time. Suppose that there exists and , such that for every ,
-
(i)
Prove that for each , we have .
Hint.
.
Solution.
Using induction we have the statement for , as . The induction step is:
-
(ii)
Deduce that .
Solution.
As is positive we have
Exercise 6 (Monkey Typewriter Theorem).
At each of times , a monkey types a capital letter at random, the sequence of letters typed forming an i.i.d. sequence of random variables chosen uniformly amongst the 26 possible capital letters. Let be the first time by which the monkey has produced the consecutive sequence ABRACADABRA of letters. We prove that
For this, imagine that just before each time , a new gambler indexed by arrives on the scene. He bets 1 euro that
the -th letter will be A.
If he loses, he loses all his money and leaves. If he wins, he receives 26 euros, all of which he bets on the event that
the -th letter will be B.
If he loses, he loses all his money and leaves. If he wins, he bets his whole current fortune of that
the -th letter will be R.
and so on through the ABRACADABRA sequence. All gamblers come and play and leave independently of each other. Let denote the fortune of the -th gambler just after time : in particular, for all .
For simplicity of notation, we can add infinitely many Z’s after ABRACADABRA. Gamblers then bet on the word ABRACADABRAZZZZZ… We denote by the -th letter of this word for every . We also denote by the -th letter typed for every and the corresponding filtration.
-
(ii)
For every , let be the total net profit of all gamblers who have participated in the game just after time , i.e.
and . Show that is a martingale.
Hint.
Show that is a martingale for every , by defining for all .
Solution.
By definition, is adapted to the filtration and it is also clearly integrable. The net profit of the first gambler is as follows:
and more generally, for every ,
and then
So is a martingale with respect to . More generally, for every , for every and for every ,
and is also a martingale with respect to . For every , and therefore is a martingale with respect to . ∎
-
(iii)
Show that . Conclude that .
Solution.
If , then all gamblers who started before time (where ABRACADABRA starts) have lost at time so that for every . The -th gambler is the winner: . We also have (because the four first and last letters of ABRACADABRA are the same, viz. ABRA) and for the same reason, . Finally, for every . Putting all pieces together,
Therefore, almost surely,
We also see that if , we have
Thus
Moreover, since almost surely,
Now for every , . Since , we derive from the dominated convergence theorem
Then, finally,