Section 22

Sums of Independent Random Variables

[15/33%]
Show
LaTeX
Problem 22.1

Suppose that X1,X2,…X_{1}, X_{2}, \ldots is an independent sequence and YY is measurable σ(Xn,Xn+1,…)\sigma \left(X_{n}, X_{n+1}, \ldots \right) for each nn. Show that there exists a constant aa such that P(Y=a)=1\mathbb {P}\left(Y=a\right)=1.

?
Problem 22.2

Assume {Xn}\left\{ X_{n}\right\} independent, and define Xn(c)X_{n}^{(c)} as in Theorem 22.8. Prove that for ∑∣Xn∣\sum \left|X_{n}\right| to converge with probability 1 it is necessary that ∑P(∣Xn∣>c)\sum \mathbb {P}\left(\left|X_{n}\right|>c\right) and ∑E[∣Xn(c)]∣\sum \mathbb {E}\left[\mid X_{n}^{(c)}\right] \mid converge for all positive cc and sufficient that they converge for some positive cc. If the three series (22.13) converge but ΣE[∣Xn(c)∣]=∞\Sigma \mathbb {E}\left[\left|X_{n}^{(c)}\right|\right]=\infty, then there is probability 1 that ∑Xn\sum X_{n} converges conditionally but not absolutely.

?
Problem 22.3
?
(a)

↑\uparrow Generalize the Borel-Cantelli lemmas: Suppose XnX_{n} are nonnegative If ∑E[Xn]<∞\sum \mathbb {E}\left[X_{n}\right]<\infty, then ∑Xn\sum X_{n} converges with probability 1. If the XnX_{n} are indepen dent and uniformly bounded, and if ∑E[Xn]=∞\sum \mathbb {E}\left[X_{n}\right]=\infty, then ∑Xn\sum X_{n} diverges witk probability 1.

(b)

Construct independent, nonnegative XnX_{n} such that ∑Xn\sum X_{n} converges with probability 1 but ∑E[Xn]\sum \mathbb {E}\left[X_{n}\right] diverges For an extreme example, arrange that P(Xn>0 i.o.)=0\mathbb {P}\left(X_{n}>0 \text{ i.o.}\right)=0 but E[Xn]≡∞\mathbb {E}\left[X_{n}\right] \equiv \infty.

Problem 22.4

Show under the hypothesis of Theorem 22.6 that ∑Xn\sum X_{n} has finite variance and extend Theorem 22.4 to infinite sequences.

?
Problem 22.5

20.1422.1↑20.1422 .1 \uparrow Suppose that X1,X2,…X_{1}, X_{2}, \ldots are independent, each with the Cauchy distribution (20.45) for a common value of uu.

?
(a)

Show that n−1∑k=1nXkn^{-1} \sum_{k=1}^{n} X_{k} does not converge with probability 1. Contrast with Theorem 22.1.

(b)

Show that P(n−1max⁡k≤nXk≤x)→e−u/πx\mathbb {P}\left(n^{-1} \max_{k \leq n} X_{k} \leq x\right) \rightarrow e^{-u / \pi x} for x>0x>0. Relate to Theorem 14.3.

Problem 22.6

If X1,X2,…X_{1}, X_{2}, \ldots are independent and identically distributed, and if P(X1≥0)=1\mathbb {P}\left(X_{1} \geq 0\right)=1 and P(X1>0)>0\mathbb {P}\left(X_{1}>0\right)>0, then ∑nXn=∞\sum_{n} X_{n}=\infty with probability 1. Deduce this from Theorem 22.1 and its corollary and also directly: find a positive ϵ\epsilon such that Xr>cX_{r}>c infinitely often with probability 1.

?
Problem 22.7

Suppose that X1,X2,…X_{1}, X_{2}, \ldots are independent and identically distributed and E[∣X1∣]=∞\mathbb {E}\left[\left|X_{1}\right|\right]=\infty. Use (21.9) to show that ∑nP(∣Xn∣≥an)=∞\sum_{n} \mathbb {P}\left(\left|X_{n}\right| \geq a n\right)=\infty for each aa, and conclude that sup⁡nn−1∣Xn∣=∞\sup_{n} n^{-1}\left|X_{n}\right|=\infty with probability 1. Now show that sup⁡nn−1∣Sn∣=∞\sup_{n} n^{-1}\left|S_{n}\right| =\infty with probability 1. Compare with the corollary to Theorem 22.1.

?
Problem 22.8

Wald's equation. Let X1,X2,…X_{1}, X_{2}, \ldots be independent and identically distributed with finite mean, and put Sn=X1+⋯+XnS_{n}=X_{1}+\cdots +X_{n}. Suppose that τ\tau is a stopping time: τ\tau has positive integers as values and [τ=n]∈σ(X1,…,Xn)[\tau =n] \in \sigma \left(X_{1}, \ldots , X_{n}\right); see Section 7 for examples. Suppose also that E[τ]<∞\mathbb {E}\left[\tau \right]<\infty.

?
(a)

Prove that

E[Sτ]=E[X1]E[τ].(22.21) \mathbb {E}\left[S_{\tau }\right]=\mathbb {E}\left[X_{1}\right] \mathbb {E}\left[\tau \right]. \tag {22.21}
(b)

Suppose that XnX_{n} is ±1\pm 1 with probabilities pp and q,p≠qq, p \neq q, let τ\tau be the first nn for which SnS_{n} is −a-a or bb ( aa and bb positive integers), and calculate E[τ]\mathbb {E}\left[\tau \right]. This gives the expected duration of the game in the gambler's ruin problem for unequal pp and qq.

Problem 22.9

20.9↑20.9 \uparrow Let ZnZ_{n} be 1 or 0 according as at time nn there is or is not a record in the sense of Problem 20.9. Let Rn=Z1+⋯+ZnR_{n}=Z_{1}+\cdots +Z_{n} be the number of records up to time nn. Show that Rn/log⁡n→P1R_{n} / \log n \rightarrow_{P} 1.

?
Problem 22.10
?
(a)

22.1↑22.1 \uparrow Show that for an independent sequence {Xn}\left\{ X_{n}\right\} the radius of convergence of the random Taylor series ∑nXnzn\sum_{n} X_{n} z^{n} is rr with probability 1 for some nonrandom rr.

(b)

Suppose that the XnX_{n} have the same distribution and P(X1≠0)>0\mathbb {P}\left(X_{1} \neq 0\right)>0. Show that rr is 1 or 0 according as log⁡+∣X1∣\log^{+}\left|X_{1}\right| has finite mean or not.

Problem 22.11

Suppose that X0,X1,…X_{0}, X_{1}, \ldots are independent and each is uniformly distributed over [0,2π][0,2 \pi ]. Show that with probability 1 the series ∑neiXnzn\sum_{n} e^{i X_{n}} z^{n} has the unit circle as its natural boundary.

?
Problem 22.12

Prove (what is essentially Kolmogorov's zero-one law) that if AA is independent of a π\pi-system P\mathscr {P} and A∈σ(P)A \in \sigma (\mathscr {P}), then P(A)\mathbb {P}\left(A\right) is either 0 or 1.

?
Problem 22.13

Suppose that A\mathscr {A} is a semiring containing Ω\Omega.

?
(a)

Show that if P(A∩B)≤bP(B)\mathbb {P}\left(A \cap B\right) \leq b \mathbb {P}\left(B\right) for all B∈AB \in \mathscr {A}, and if b<1b<1 and A∈σ(A)A \in \sigma (\mathscr {A}), then P(A)=0\mathbb {P}\left(A\right)=0.

(b)

Show that if P(A∩B)≤P(A)P(B)\mathbb {P}\left(A \cap B\right) \leq \mathbb {P}\left(A\right) \mathbb {P}\left(B\right) for all B∈AB \in \mathscr {A}, and if A∈σ(A)A \in \sigma (\mathscr {A}), then P(A)\mathbb {P}\left(A\right) is 0 or 1.

(c)

Show that if aP(B)≤P(A∩B)a \mathbb {P}\left(B\right) \leq \mathbb {P}\left(A \cap B\right) for all B∈AB \in \mathscr {A}, and if a>0a>0 and A∈σ(A)A \in \sigma (\mathscr {A}), then P(A)=1\mathbb {P}\left(A\right)=1.

(d)

Show that if P(A)P(B)≤P(A∩B)\mathbb {P}\left(A\right) \mathbb {P}\left(B\right) \leq \mathbb {P}\left(A \cap B\right) for all B∈AB \in \mathscr {A}, and if A∈σ(A)A \in \sigma (\mathscr {A}), then P(A)\mathbb {P}\left(A\right) is 0 or 1.

(e)

Reconsider Problem 3.20

Problem 22.14

22.12↑22.12 \uparrow Burstin's theorem. Let ff be a Borel function on [0,1][0,1] with arbitrarily small periods: For each ϵ\epsilon there is a pp such that 0<p<ϵ0<p<\epsilon and f(x)=f(x+p)f(x)=f(x+p) for 0≤x≤1−p0 \leq x \leq 1-p. Show that such an ff is constant almost everywhere:

?
(a)

Show that it is enough to prove that P(f−1B)\mathbb {P}\left(f^{-1} B\right) is 0 or 1 for every Borel set BB, where PP is Lebesgue measure on the unit interval.

(b)

Show that f−1Bf^{-1} B is independent of each interval [0,x][0, x], and conclude that P(f−1B)\mathbb {P}\left(f^{-1} B\right) is 0 or 1.

(c)

Show by example that ff need not be constant.

Problem 22.15

Assume that X1,…,XnX_{1}, \ldots , X_{n} are independent and s,t,αs, t, \alpha are nonnegative Let

L(s)=max⁡k≤nP(∣Sk∣≥s),R(s)=max⁡k≤nP(∣Sn−Sk∣>s),M(s)=P(max⁡k≤n∣Sk∣≥s),T(s)=P(∣Sn∣≥s). \begin{aligned} L(s) & =\max _{k \leq n} \mathbb {P}\left(\left|S_{k}\right| \geq s\right), R(s)=\max _{k \leq n} \mathbb {P}\left(\left|S_{n}-S_{k}\right|>s\right), \\ M(s) & =\mathbb {P}\left(\max _{k \leq n}\left|S_{k}\right| \geq s\right), T(s)=\mathbb {P}\left(\left|S_{n}\right| \geq s\right). \end{aligned}
?
(a)

Following the first part of the proof of (22.10), show that

M(s+t)≤T(t)+M(s+t)R(s)(22.22) M(s+t) \leq T(t)+M(s+t) R(s) \tag {22.22}
(b)

Take s=2αs=2 \alpha and t=αt=\alpha; use (22.22), together with the inequalities T(s)≤L(s)T(s) \leq L(s) and R(2s)≤2L(s)R(2 s) \leq 2 L(s), to prove Etemadi's inequality (22.10) in the form

M(3α)≤BE(α)=1∧3L(α).(22.23) M(3 \alpha ) \leq B_{E}(\alpha )=1 \wedge 3 L(\alpha ). \tag {22.23}
(c)

Carry the rightmost term in (22.22) to the left side, take s=t=αs=t=\alpha, and prove Ottaviani's inequality:

M(2α)≤BO(α)=1∧T(α)1−R(α)(22.24) M(2 \alpha ) \leq B_{O}(\alpha )=1 \wedge \frac{T(\alpha )}{1-R(\alpha )} \tag {22.24}
(d)

Prove

BE(α)≤3BO(α/2),BO(α)≤3BE(α/6). B_{E}(\alpha ) \leq 3 B_{O}(\alpha / 2), \quad B_{O}(\alpha ) \leq 3 B_{E}(\alpha / 6).

This shows that the Etemadi and Ottaviani inequalities are of the same power for most purposes (as, for example, for the proofs of Theorem 22.7 and (37.9)). Etemadi's inequality seems the more natural of the two. Neither inequality can replace (9.39) in the proof of the law of the iterated logarithm.