Stok 2 Januar 2019
Stok 2 Januar 2019
4 hours ITX exam. All aids are allowed, except for laptops and similar devices.
The problem set consists of 4 pages. There are 3 problems with a total of 13
questions. The 13 questions carry the same weight in the final grading.
Note the convention that all limits are understood as for n → ∞ if nothing
else is stated.
Problem 1
Question 1.1. Show that E Xn2 < ∞ for all n, and compute
E Xn and E Xn2 .
Pn
Consider Sn = i=1 Xi .
1
Question 1.4. Will Sn → S in L1 ?
√
Question 1.5. Show that Sn / n → 0 almost surely and in L2 .
Pn
Consider Tn = i=1 Xi Xi+1 .
Problem 2
β2
a.s.
Tn ∼ N α,
n
2
Problem 3
Question 3.1. Assume for this question that there are constants
α > 0 and K > 0 such that
D
Use Lindebergs CLT to show that Yn → N (0, 1).
D
Show that there is a limit variable Y such that Yn → Y .
3
Show that (2) is satisfied. Hence it is known from the previous
D
question that there is a limit variable Y such that Yn → Y . Show
that √ !
2
P |Y | < =0
3
and conclude that Y is not N (0, 1)-distributed.