Chapter 4

Random Variables and Expected Values

[85/34%]
Show
LaTeX
Problem 20.1

2.11↑2.11 \uparrow A necessary and sufficient condition for a σ\sigma-field G\mathscr {G} to be countably generated is that G=σ(X)\mathscr {G}=\sigma (X) for some random variable XX. Hint: If G=σ(A1,A2,…)\mathscr {G}= \sigma \left(A_{1}, A_{2}, \ldots \right), consider X=∑k=1∞f(IAk)/10kX=\sum_{k=1}^{\infty } f\left(I_{A_{k}}\right) / 10^{k}, where f(x)f(x) is 4 for x=0x=0 and 5 for x≠0x \neq 0.

?
Problem 20.2

If XX is a positive random variable with density ff, then X−1X^{-1} has density f(1/x)/x2f(1 / x) / x^{2}. Prove this by (20.16) and by a direct argument.

?
Problem 20.3

Suppose that a two-dimensional distribution function FF has a continuous density ff. Show that f(x,y)=∂2F(x,y)/∂x∂yf(x, y)=\partial^{2} F(x, y) / \partial x \partial y.

?
Problem 20.4

The construction in Theorem 20.4 requires only Lebesgue measure on the unit interval. Use the theorem to prove the existence of Lebesgue measure on RkR^{k}. First construct λk\lambda_{k} restricted to (−n,n]×⋅×(−n,n](-n, n] \times \cdot \times (-n, n], and then pass to the limit (n→∞)(n \rightarrow \infty ). The idea is to argue from first principles, and not to use previous constructions, such as those in Theorems 12.5 and 18.2.

?
Problem 20.5

Suppose that A,BA, B, and CC are positive, independent random variables with distribution function FF. Show that the quadratic Az2+Bz+CA z^{2}+B z+C has real zeros with probability ∫0∞∫0∞F(x2/4y)dF(x)dF(y)\int_{0}^{\infty } \int_{0}^{\infty } F\left(x^{2} / 4 y\right) d F(x) d F(y).

?
Problem 20.6

Show that X1,X2,…X_{1}, X_{2}, \ldots are independent if σ(X1,…,Xn−1)\sigma \left(X_{1}, \ldots , X_{n-1}\right) and σ(Xn)\sigma \left(X_{n}\right) are independent for each nn.

?
Problem 20.7

Let X0,X1,…X_{0}, X_{1}, \ldots be a persistent, irreducible Markov chain, and for a fixed state jj let T1,T2,…T_{1}, T_{2}, \ldots be the times of the successive passages through jj. Let Z1=T1Z_{1}=T_{1} and Zn=Tn−Tn−1,n≥2Z_{n}=T_{n}-T_{n-1}, n \geq 2. Show that Z1,Z2,…Z_{1}, Z_{2}, \ldots are independent and that P[Zn=k]=fjf(k)P\left[Z_{n}=k\right]=f_{j f}^{(k)} for n≥2n \geq 2.

?
Problem 20.8

Ranks and records. Let X1,X2,…X_{1}, X_{2}, \ldots be independent random variables with a common continuous distribution function. Let BB be the ω\omega-set where Xm(ω)=Xn(ω)X_{m}(\omega )=X_{n}(\omega ) for some pair m,nm, n of distinct integers, and show that P(B)=0\mathbb {P}\left(B\right)=0. Remove BB from the space Ω\Omega on which the XnX_{n} are defined. This leaves the joint distributions of the XnX_{n} unchanged and makes ties impossible.

Let T(n)(ω)=(T1(n)(ω),…,Tn(n)(ω))T^{(n)}(\omega )=\left(T_{1}^{(n)}(\omega ), \ldots , T_{n}^{(n)}(\omega )\right) be that permutation (t1,…,tn)\left(t_{1}, \ldots , t_{n}\right) of (1,…,n)(1, \ldots , n) for which Xt1(ω)<Xt2(ω)<⋯<Xtn(ω)X_{t_{1}}(\omega )<X_{t_{2}}(\omega )<\cdots <X_{t_{n}}(\omega ). Let YnY_{n} be the rank of XnX_{n} among X1,…,Xn:Yn=rX_{1}, \ldots , X_{n}: Y_{n}=r if and only if Xi<XnX_{i}<X_{n} for exactly r−1r-1 values of ii preceding nn.

?
(a)

Show that T(n)T^{(n)} is uniformly distributed over the n!n! permutations.

(b)

Show that P(Yn=r)=1/n,1≤r≤n\mathbb {P}\left(Y_{n}=r\right)=1 / n, 1 \leq r \leq n.

(c)

Show that YkY_{k} is measurable σ(T(n))\sigma \left(T^{(n)}\right) for k≤nk \leq n.

(d)

Show that Y1,Y2,…Y_{1}, Y_{2}, \ldots are independent.

Problem 20.9

↑\uparrow Record values. Let AnA_{n} be the event that a record occurs at time nn : max⁡k<nXk<Xn\max_{k<n} X_{k}<X_{n}.

?
(a)

Show that A1,A2,…A_{1}, A_{2}, \ldots are independent and P(An)=1/n\mathbb {P}\left(A_{n}\right)=1 / n.

(b)

Show that no record stands forever.

(c)

Let NnN_{n} be the time of the first record after time nn. Show that P(Nn=n+k)=n(n+k−1)−1(n+k)−1\mathbb {P}\left(N_{n}=n+k\right)=n(n+k-1)^{-1}(n+k)^{-1}.

Problem 20.10

Use Fubini's theorem to prove that convolution of finite measures is commutative and associative.

?
Problem 20.11

Suppose that XX and YY are independent and have densities. Use (20.20) to find the joint density for (X+Y,X)(X+Y, X) and then use (20.19) to find the density for X+YX+Y. Check with (20.38).

?
Problem 20.12

If F(x−ϵ)<F(x+ϵ)F(x-\epsilon )<F(x+\epsilon ) for all positive ϵ\epsilon, then xx is a point of increase of FF (see Problem 12.9). If F(x−)<F(x)F(x-)<F(x), then xx is an atom of FF.

?
(a)

Show that, if xx and yy are points of increase of FF and GG, then x+yx+y is a point of increase of F∗GF * G.

(b)

Show that, if xx and yy are atoms of FF and GG, then x+yx+y is an atom of F∗GF * G.

Problem 20.13

Suppose that μ\mu and ν\nu consist of masses αn\alpha_{n} and βn\beta_{n} at n,n=0,1,2,…n, n=0,1,2, \ldots. Show that μ∗ν\mu * \nu consists of a mass of ∑k=0nαkβn−k\sum_{k=0}^{n} \alpha_{k} \beta_{n-k} at n,n=0,1,2,…n, n=0,1,2, \ldots. Show that two Poisson distributions (the parameters may differ) convolve to a Poisson distribution.

?
Problem 20.14

The Cauchy distribution has density

cu(x)=1πuu2+x2,−∞<x<∞(20.45) c_{u}(x)=\frac{1}{\pi } \frac{u}{u^{2}+x^{2}}, \quad -\infty <x<\infty \tag {20.45}

for u>0u>0. (By (17.9), the density integrates to 1.)

?
(a)

Show that cu∗ci=cu+1c_{u} * c_{i}=c_{u+1}. Hint: Expand the convolution integrand in partial fractions.

(b)

Show that, if X1,…,XnX_{1}, \ldots , X_{n} are independent and have density cuc_{u}, then (X1+⋯+Xn)/n\left(X_{1}+\cdots +X_{n}\right) / n has density cuc_{u} as well.

Problem 20.15
?
(a)

Show that, if XX and YY are independent and have the standard normal density, then X/YX / Y has the Cauchy density with u=1u=1.

(b)

Show that, if XX has the uniform distribution over (−π/2,π/2)(-\pi / 2, \pi / 2), then tan⁡X\tan X has the Cauchy distribution with u=1u=1.

Problem 20.16

18.18↑18.18 \uparrow Let X1,…,XnX_{1}, \ldots , X_{n} be independent, each having the standard normal distribution Show that

χn2=X12+⋯+Xn2 \chi _{n}^{2}=X_{1}^{2}+\cdots +X_{n}^{2}

has density

12n/2Γ(n/2)x(n/2)−1e−x/2(20.46) \frac{1}{2^{n / 2} \Gamma (n / 2)} x^{(n / 2)-1} e^{-x / 2} \tag {20.46}

over (0,∞)(0, \infty ). This is called the chi-squared distribution with nn degrees of freedom.

?
Problem 20.17

↑ The gamma distribution has density

f(x;α,u)=αuΓ(u)xu−1e−αx(20.47) f(x ; \alpha , u)=\frac{\alpha ^{u}}{\Gamma (u)} x^{u-1} e^{-\alpha x} \tag {20.47}

over (0,∞)(0, \infty ) for positive parameters α\alpha and uu. Check that (20.47) integrates to 1 Show that

f(⋅,α,u)∗f(⋅;α,v)=f(⋅;α,u+v).(20.48) f(\cdot , \alpha , u) * f\left(\cdot ; \alpha , v\right)=f(\cdot ; \alpha , u+v). \tag {20.48}

Note that (20.46) is f(x;12,n/2)f\left(x ; \frac{1}{2}, n / 2\right), and from (20.48) deduce again that (20.46) is the density of χn2\chi_{n}^{2}. Note that the exponential density (20.10) is f(x;α,1)f(x ; \alpha , 1), and from (20.48) deduce (20.39) once again.

?
Problem 20.18

↑\uparrow Let N,X1,X2,…N, X_{1}, X_{2}, \ldots be independent, where P(N=n)=qn−1p,n≥1\mathbb {P}\left(N=n\right)=q^{n-1} p, n \geq 1, and each XkX_{k} has the exponential density f(x;α,1)f(x ; \alpha , 1). Show tnat X1+⋯+XNX_{1}+\cdots +X_{N} has density f(x;αp,1)f(x ; \alpha p, 1).

?
Problem 20.19

Let Anm(ϵ)=[∣Zk−Z∣<ϵ,n≤k≤m]A_{n m}(\epsilon )=\left[\left|Z_{k}-Z\right|<\epsilon , n \leq k \leq m\right]. Show that Zn→ZZ_{n} \rightarrow Z with probability 1 if and only if lim⁡nlim⁡mP(Anm(ϵ))=1\lim_{n} \lim_{m} \mathbb {P}\left(A_{n m}(\epsilon )\right)=1 for all positive ϵ\epsilon, whereas Zn→pZZ_{n} \rightarrow_{p} Z if and only if lim⁡nP(Anη(ϵ))=1\lim_{n} \mathbb {P}\left(A_{n \eta }(\epsilon )\right)=1 for all positive ϵ\epsilon.

?
Problem 20.20
?
(a)

Suppose that f:R2→R1f: R^{2} \rightarrow R^{1} is continuous. Show that Xn→PXX_{n} \rightarrow_{P} X and Yn→PYY_{n} \rightarrow_{P} Y imply f(Xn,Yn)→pf(X,Y)f\left(X_{n}, Y_{n}\right) \rightarrow_{p} f(X, Y).

(b)

Show that addition and multiplication preserve convergence in probability.

Problem 20.21

Suppose that the sequence (Xn)\left(X_{n}\right) is fundamental in probability in the sense that for ϵ\epsilon positive there exists an NϵN_{\epsilon } such that P(∣Xm−Xn∣>ϵ)<ϵ\mathbb {P}\left(\left|X_{m}-X_{n}\right|>\epsilon \right)<\epsilon for m,n>Nϵm, n>N_{\epsilon }.

?
(a)

Prove there is a subsequence {Xnk}\left\{ X_{n_{k}}\right\} and a random variable XX such that lim⁡kXnk=X\lim_{k} X_{n_{k}}=X with probability 1. Hint: Choose increasing nkn_{k} such that P(∣Xm−Xn∣>2−k)<2−k\mathbb {P}\left(\left|X_{m}-X_{n}\right|>2^{-k}\right)<2^{-k} for m,n≥nkm, n \geq n_{k}. Analyze P(∣Xnk+1−Xnk∣>2−k)\mathbb {P}\left(\left|X_{n_{k+1}}-X_{n_{k}}\right|>2^{-k}\right).

(b)

Show that Xn→PXX_{n} \rightarrow_{P} X.

Problem 20.22
?
(a)

Suppose that X1≤X2≤⋯X_{1} \leq X_{2} \leq \cdots and that Xn→pXX_{n} \rightarrow_{p} X. Show that Xn→XX_{n} \rightarrow X with probability 1.

(b)

Show by example that in an infinite measure space functions can converge almost everywhere without converging in measure.

Problem 20.23

If Xn→0X_{n} \rightarrow 0 with probability 1, then n−1∑k=1nXk→0n^{-1} \sum_{k=1}^{n} X_{k} \rightarrow 0 with probability 1 by the standard theorem on Cesàro means [A30]. Show by example that this is not so if convergence with probability 1 is replaced by convergence in probability.

?
Problem 20.24
?
(a)

2.19↑2.19 \uparrow Show that in a discrete probability space convergence in probability is equivalent to convergence with probability 1.

(b)

Show that discrete spaces are essentially the only ones where this equivalence holds: Suppose that PP has a nonatomic part in the sense that there is a set AA such that P(A)>0\mathbb {P}\left(A\right)>0 and P(⋅∣A)\mathbb {P}\left( \cdot \mid A \right) is nonatomic. Construct random variables XnX_{n} such that Xn→P0X_{n} \rightarrow_{P} 0 but XnX_{n} does not converge to 0 with probability 1.

Problem 20.25

20.21,20.24↑20.21, 20.24 \uparrow Let d(X,Y)d(X, Y) be the infimum of those positive ϵ\epsilon for which P(∣X−Y∣≥ϵ)≤ϵ\mathbb {P}\left(\left|X-Y\right| \geq \epsilon \right) \leq \epsilon.

?
(a)

Show that d(X,Y)=0d(X, Y)=0 if and only if X=YX=Y with probability 1. Identify random variables that are equal with probability 1, and show that dd is a metric on the resulting space.

(b)

Show that Xn→pXX_{n} \rightarrow_{p} X if and only if d(Xn,X)→0d\left(X_{n}, X\right) \rightarrow 0.

(c)

Show that the space is complete.

(d)

Show that in general there is no metric d0d_{0} on this space such that Xn→XX_{n} \rightarrow X with probability 1 if and only if d0(Xn,X)→0d_{0}\left(X_{n}, X\right) \rightarrow 0.

Problem 20.26

Construct in RkR^{k} a random variable XX that is uniformly distributed over the surface of the unit sphere in the sense that ∣X∣=1\left|X\right|=1 and UXU X has the same distribution as XX for orthogonal transformations UU. Hint Let ZZ be uniformly distributed in the unit ball in RkR^{k}, define ψ(x)=x/∣x∣(ψ(0)=(1,0,0)\psi (x)=x /\left|x\right|(\psi (0)=(1,0, \quad 0), say), and take X=ψ(Z)X=\psi (Z).

?
Problem 20.27

↑\uparrow Let Θ\Theta and Φ\Phi be the longitude and latitude of a random point on the surface of the unit sphere in R3R^{3}. Show that Θ\Theta and Φ\Phi are independent, Θ\Theta is uniformly distributed over [0,2π)[0,2 \pi ), and Φ\Phi is distributed over [−π/2,+π/2][-\pi / 2,+\pi / 2] with density 12cos⁡ϕ\frac{1}{2} \cos \phi

?
Problem 21.1

Prove

12π∫−∞∞e−tx2/2dx=t−1/2 \frac{1}{\sqrt{2 \pi }} \int _{-\infty }^{\infty } e^{-t x^{2} / 2} d x=t^{-1 / 2}

differentiate kk times with respect to tt inside the integral (justify), and derive (21.7) again.

?
Problem 21.2

Show that, if XX has the standard normal distribution, then E[∣X∣2n+1]=2nn!2/π\mathbb {E}\left[|X|^{2 n+1}\right]= 2^{n} n!\sqrt{2 / \pi }.

?
Problem 21.3

20.9↑20.9 \uparrow Records. Consider the sequence of records in the sense of Problem 20.9. Show that the expected waiting time to the next record is infinite.

?
Problem 21.4

20.14 ↑ Show that the Cauchy distribution has no mean.

?
Problem 21.5

Prove the first Borel-Cantelli lemma by applying Theorem 16.6 to indicator random variables. Why is Theorem 16.6 not enough for the second Borel-Cantelli lemma?

?
Problem 21.6

Prove ( 21.9 ) by Fubini's theorem.

?
Problem 21.7

Prove for integrable XX that

E[X]=∫0∞P(X>t)dt−∫−∞0P(X<t)dt \mathbb {E}\left[X\right]=\int _{0}^{\infty } \mathbb {P}\left(X>t\right) d t-\int _{-\infty }^{0} \mathbb {P}\left(X<t\right) d t
?
Problem 21.8
?
(a)

Suppose that XX and YY have first moments, and prove

E[Y]−E[X]=∫−∞∞(P(X<t≤Y)−P(Y<t≤X))dt \mathbb {E}\left[Y\right]-\mathbb {E}\left[X\right]=\int _{-\infty }^{\infty }(\mathbb {P}\left(X<t \leq Y\right)-\mathbb {P}\left(Y<t \leq X\right)) d t
(b)

Let ( X,YX, Y ] be a nondegenerate random interval Show that its expected length is the integral with respect to tt of the probability that it covers tt.

Problem 21.9

Suppose that XX and YY are random variables with distribution functions FF and GG.

?
(a)

Show that if FF and GG have no common jumps, then E[F(Y)]+E[G(X)]=1\mathbb {E}\left[F(Y)\right]+\mathbb {E}\left[G(X)\right] =1.

(b)

If FF is continuous, then E[F(X)]=12\mathbb {E}\left[F(X)\right]=\frac{1}{2}.

(c)

Even if FF and GG have common jumps, if XX and YY are taken to be independent, then E[F(Y)]+E[G(X)]=1+P(X=Y)\mathbb {E}\left[F(Y)\right]+\mathbb {E}\left[G(X)\right]=1+\mathbb {P}\left(X=Y\right).

(d)

Even if FF has jumps, E[F(X)]=12+12∑xP(X=x)2\mathbb {E}\left[F(X)\right]=\frac{1}{2}+\frac{1}{2} \sum_{x} \mathbb {P}\left(X=x\right)^{2}

Problem 21.10
?
(a)

Show that uncorrelated variables need not be independent.

(b)

Show that Var⁡[∑i=1nXi]=∑i,j=1nCov⁡[Xi,Xj]=∑i=1nVar⁡[Xi]+2∑1≤i<j≤nCov⁡[Xi,Xj]\operatorname {Var}\left[\sum_{i=1}^{n} X_{i}\right]=\sum_{i, j=1}^{n} \operatorname {Cov}\left[X_{i}, X_{j}\right]=\sum_{i=1}^{n} \operatorname {Var}\left[X_{i}\right]+ 2 \sum_{1 \leq i<j \leq n} \operatorname {Cov}\left[X_{i}, X_{j}\right]. The cross terms drop out if the XiX_{i} are uncorrelated, and hence drop out if they are independent.

Problem 21.11

↑ Let X,YX, Y, and ZZ be independent random variables such that XX and YY assume the values 0,1,20,1,2 with probability 13\frac{1}{3} each and ZZ assumes the values 0 and 1 with probabilities 13\frac{1}{3} and 23\frac{2}{3}. Let X′=XX^{\prime }=X and Y′=X+Z( mod 3)Y^{\prime }=X+Z(\bmod 3).

?
(a)

Show that X′,Y′X^{\prime }, Y^{\prime }, and X′+Y′X^{\prime }+Y^{\prime } have the same one-dimensional distributions as X,YX, Y, and X+YX+Y, respectively, even though (X′,Y′)(X^{\prime }, Y^{\prime }) and (X,Y)(X, Y) have different distributions.

(b)

Show that X′X^{\prime } and Y′Y^{\prime } are dependent but uncorrelated

(c)

Show that, despite dependence, the moment generating function of X′+Y′X^{\prime }+Y^{\prime } is the product of the moment generating functions of X′X^{\prime } and Y′Y^{\prime }.

Problem 21.12

Suppose that XX and YY are independent, nonnegative random variables and that E[X]=∞\mathbb {E}\left[X\right]=\infty and E[Y]=0\mathbb {E}\left[Y\right]=0. What is the value common to E[XY]\mathbb {E}\left[X Y\right] and E[X]E[Y]\mathbb {E}\left[X\right] \mathbb {E}\left[Y\right]? Use the conventions (15.2) for both the product of the random variables and the product of their expected values. What if E[X]=∞\mathbb {E}\left[X\right]=\infty and 0<E[Y]<∞0<\mathbb {E}\left[Y\right]<\infty?

?
Problem 21.13

Suppose that XX and YY are independent and that f(x,y)f(x, y) is nonnegative. Put g(x)=E[f(x,Y)]g(x)=\mathbb {E}\left[f(x, Y)\right] and show that E[g(X)]=E[f(X,Y)]\mathbb {E}\left[g(X)\right]=\mathbb {E}\left[f(X, Y)\right]. Show more generally that ∫X∈Ag(X)dP=∫X∈Af(X,Y)dP\int_{X \in A} g(X) d P=\int_{X \in A} f(X, Y) d P. Extend to ff that may be negative.

?
Problem 21.14

↑\uparrow The integrability of X+YX+Y does not imply that of XX and YY separately. Show that it does if XX and YY are independent.

?
Problem 21.15

20.25↑20.25 \uparrow Write d1(X,Y)=E[∣X−Y∣/(1+∣X−Y∣)]d_{1}(X, Y)=\mathbb {E}\left[\left|X-Y\right| /(1+\left|X-Y\right|)\right]. Show that this is a metric equivalent to the one in Problem 20.25.

?
Problem 21.16

For the density Cexp⁡(−∣x∣1/2),−∞<x<∞C \exp \left(-|x|^{1 / 2}\right),-\infty <x<\infty, show that moments of all orders exist but that the moment generating function exists only at s=0s=0.

?
Problem 21.17

16.6 ↑ Show that a moment generating function M(s)M(s) defined in (−s0,s0)\left(-s_{0}, s_{0}\right), s0>0s_{0}>0, can be extended to a function analytic in the strip [z:−s0<Re⁡z<s0]\left[z:-s_{0}<\operatorname {Re} z<s_{0}\right]. If M(s)M(s) is defined in [0,s0),s0>0\left[0, s_{0}\right), s_{0}>0, show that it can be extended to a function continuous in [z:0≤Re⁡z<s0]\left[z: 0 \leq \operatorname {Re} z<s_{0}\right] and analytic in [z⋅0<Re⁡z<s0]\left[z \cdot 0<\operatorname {Re} z<s_{0}\right].

?
Problem 21.18

Use (21.28) to find the generating function of (20.39).

?
Problem 21.19

For independent random variables having moment generating functions, show by (21.28) that the variances add.

?
Problem 21.20

20.17 Show that the gamma density (20.47) has moment generating function (1−s/α)−u(1-s / \alpha )^{-u} for s<αs<\alpha. Show that the kk th moment is u(u+1)⋯(u+k−u(u+1) \cdots (u+k- 1) /αk/ \alpha^{k} Show that the chi-squared distribution with nn degrees of freedom has mean nn and variance 2n2 n.

?
Problem 21.21

Let X1,X2,…X_{1}, X_{2}, \ldots be identically distributed random variables with finite second moment. Show that nP(∣X1∣≥ϵn)→0n \mathbb {P}\left(\left|X_{1}\right| \geq \epsilon \sqrt{n}\right) \rightarrow 0 and n−1/2max⁡k≤n∣Xk∣→p0n^{-1 / 2} \max_{k \leq n}\left|X_{k}\right| \rightarrow_{p} 0.

?
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.

Problem 23.1

Show that the minimum of independent exponential waiting times is again exponential and that the parameters add.

?
Problem 23.2

20.17 ↑ Show that the time SnS_{n} of the nnth event in a Poisson stream has the gamma density f(x;α,n)f(x ; \alpha , n) as defined by (20.47). This is sometimes called the Erlang density.

?
Problem 23.3

Let Ai=t−SN1A_{i}=t-S_{N_{1}} be the time back to the most recent event in the Poisson stream (or to 0 ), and let Bi=SNt+1−tB_{i}=S_{N_{t}+1}-t be the time forward to the next event. Show that AtA_{t} and BtB_{t} are independent, that BtB_{t} is distributed as X1X_{1} (exponentially with parameter α\alpha ), and that AtA_{t} is distributed as min⁡{X1,t}:P(At≤i)\min \left\{ X_{1}, t\right\} : \mathbb {P}\left(A_{t} \leq i\right) is 0,1−e−αx0,1-e^{-\alpha x}, or 1 as x<0,0≤x<tx<0,0 \leq x<t, or x≥tx \geq t.

?
Problem 23.4

↑\uparrow Let Lt=At+Bt=SNt+1−SNtL_{t}=A_{t}+B_{t}=S_{N_{t}+1}-S_{N_{t}} be the length of the interarrival interval covering tt.

?
(a)

Show that LtL_{t} has density

dt(x)={α2xe−αx if 0<x<t,α(1+αt)e−αx if x≥t. d_{t}(x)= \begin{cases} \alpha ^{2} x e^{-\alpha x} & \text{ if } 0<x<t, \\ \alpha (1+\alpha t) e^{-\alpha x} & \text{ if } x \geq t. \end{cases}
(b)

Show that E[Lt]\mathbb {E}\left[L_{t}\right] converges to 2E[X1]2 \mathbb {E}\left[X_{1}\right] as t→∞t \rightarrow \infty. This seems paradoxical because LtL_{t} is one of the XnX_{n}. Give an intuitive resolution of the apparent paradox.

Problem 23.5

Merging Poisson streans. Define a process {Nt}\left\{ N_{t}\right\} by (23.5) for a sequence {Xn}\left\{ X_{n}\right\} of random variables satisfying (23.4). Let {Xn′}\left\{ X_{n}^{\prime }\right\} be a second sequence of random variables, on the same probability space, satisfying (23.4), and define {Nl′}\left\{ N_{l}^{\prime }\right\} by Ntt=max⁡[n:X1′+⋯+Xn′≤t]N_{t}^{t}=\max \left[n: X_{1}^{\prime }+\cdots +X_{n}^{\prime } \leq t\right]. Define {Nt′′}\left\{ N_{t}^{\prime \prime }\right\} by Nt′′=Nt+Nt′N_{t}^{\prime \prime }=N_{t}+N_{t}^{\prime }. Show that, if σ(X1,X2,…)\sigma \left(X_{1}, X_{2}, \ldots \right) and σ(X1′,X2′,…)\sigma \left(X_{1}^{\prime }, X_{2}^{\prime }, \ldots \right) are independent and {Nt}\left\{ N_{t}\right\} and {Nt′}\left\{ N_{t}^{\prime }\right\} are Poisson processes with respective rates α\alpha and β\beta, then {Nt′′}\left\{ N_{t}^{\prime \prime }\right\} is a Poisson process with rate α+β\alpha +\beta.

?
Problem 23.6

↑\uparrow The nnth and (n+1)(n+1) st events in the process {Nt}\left\{ N_{t}\right\} occur at times SnS_{n} and Sn+1S_{n+1}.

?
(a)

Find the distribution of the number NSn+1′−NSn′N_{S_{n+1}}^{\prime }-N_{S_{n}}^{\prime } of events in the other process during this time interval.

(b)

Generalize to NSmr−NSnrN_{S_{m}}^{r}-N_{S_{n}}^{r}.

Problem 23.7

Suppose that X1,X2,…X_{1}, X_{2}, \ldots are independent and exponentially distributed with parameter α\alpha, so that (23.5) defines a Poisson process {Nt}\left\{ N_{t}\right\}. Suppose that Y1,Y2,…Y_{1}, Y_{2}, \ldots are independent and identically distributed and that σ(X1,X2,…)\sigma \left(X_{1}, X_{2}, \ldots \right) and σ(Y1,Y2,…)\sigma \left(Y_{1}, Y_{2}, \ldots \right) are independent. Put Z1=Σk≤NtYkZ_{1}=\Sigma_{k \leq N_{t}} Y_{k}. This is the compound Poisson process. If, for example, the event at time SnS_{n} in the original process represents an insurance claim, and if YnY_{n} represents the amount of the claim, then ZtZ_{t}, represents the total claims to time tt,

?
(a)

If Yk=1Y_{k}=1 with probability 1, then {Zt}\left\{ Z_{t}\right\} is an ordinary Poisson process.

(b)

Show that (Zt)\left(Z_{t}\right) has independent increments and that Zs+t−ZsZ_{s+t}-Z_{s} has the same distribution as ZtZ_{t}.

(c)

Show that, if YkY_{k} assumes the values 1 and 0 with probabilities pp and 1−p(0<p<1)1-p (0<p<1), then (Z1)\left(Z_{1}\right) is a Poisson process with rate pαp \alpha.

Problem 23.8

Suppose a process satisfies Condition 0∘0^{\circ } and has independent, Poisson-distributed increments and no fixed discontinuities. Show that it has the form {Nφ(1)}\left\{ N_{\varphi (1)}\right\}, where (Nt)\left(N_{t}\right) is a standard Poisson process and φ\varphi is a nondecreasing, continuous function on [0,∞)[0, \infty ) with φ(0)=0\varphi (0)=0.

?
Problem 23.9

If the waiting times XnX_{n} are independent and exponentially distributed with parameter α\alpha, then Sn/n→α−1S_{n} / n \rightarrow \alpha^{-1} with probability 1, by the strong law of large numbers. From lim⁡t→∞Nt=∞\lim_{t \rightarrow \infty } N_{t}=\infty and SNt≤t<SNt+1S_{N_{t}} \leq t<S_{N_{t}+1} deduce that lim⁡t→∞Nt/t=α\lim_{t \rightarrow \infty } N_{t} / t= \alpha with probability 1.

?
Problem 23.10
?
(a)

↑\uparrow Suppose that X1,X2,…X_{1}, X_{2}, \ldots are positive, and assume directly that Sn/n→mS_{n} / n \rightarrow m with probability 1, as happens if the XnX_{n} are independent and identically distributed with mean mm. Show that lim⁡,Nt/t=1/m\lim , N_{t} / t=1 / m with probability 1.

(b)

Suppose now that Sn/n→∞S_{n} / n \rightarrow \infty with probability 1, as happens if the XnX_{n} are independent and identically distributed and have infinite mean. Show that lim⁡tNt/t=0\lim_{t} N_{t} / t=0 with probability 1.

The results in Problem 23.10 are theorems in renewal theory: A component of some mechanism is replaced each time it fails or wears out The XnX_{n} are the lifetimes of the successive components, and NtN_{t} is the number of replacements, or renewals, to time tt.

Problem 23.11

20.723 .10 ↑ Consider a persistent, irreducible Markov chain, and for a fixed state jj let NnN_{n} be the number of passages through jj up to time nn. Show that Nn/n→1/mN_{n} / n \rightarrow 1 / m with probability 1, where m=∑k=1∞kfjj(k)m=\sum_{k=1}^{\infty } k f_{j j}^{(k)} is the mean return time (replace 1/m1 / m by 0 if this mean is infinite). See Lemma 3 in Section 8.

?
Problem 23.12

Suppose that XX and YY have Poisson distributions with parameters α\alpha and β\beta. Show that ∣P(X=i)−P(Y=i)∣≤∣α−β∣\left|\mathbb {P}\left(X=i\right)-\mathbb {P}\left(Y=i\right)\right| \leq \left|\alpha -\beta \right|. Hint: Suppose that α<β\alpha <\beta, and represent YY as X+DX+D, where XX and DD are independent and have Poisson distributions with parameters α\alpha and β−α\beta -\alpha.

?
Problem 23.13

↑ Use the methods in the proof of Theorem 23.2 to show that the error in (23.15) is bounded uniformly in ii by ∣λ−λn∣+λnmax⁡kpnk\left|\lambda -\lambda_{n}\right|+\lambda_{n} \max_{k} p_{n k}.

?
Problem 24.1

Fix (Ω,F)(\Omega , \mathscr {F}) and a TT measurable F/F\mathscr {F} / \mathscr {F}. The probability measures on (Ω,F)(\Omega , \mathscr {F}) preserved by TT form a convex set CC. Show that TT is ergodic under PP if and only if PP is an extreme point of CC-cannot be represented as a proper convex combination of distinct elements of CC.

?
Problem 24.2

Show that TT is ergodic if and only if n−1∑k=1n−1P(A∩T−kB)→P(A)P(B)n^{-1} \sum_{k=1}^{n-1} \mathbb {P}\left(A \cap T^{-k} B\right) \rightarrow \mathbb {P}\left(A\right) \mathbb {P}\left(B\right) for all AA and BB (or all AA and BB in a π\pi-system generating F\mathscr {F} ).

?
Problem 24.3

↑ The transformation TT is mixing if

P(A∩T−nB)→P(A)P(B)(24.39) \mathbb {P}\left(A \cap T^{-n} B\right) \rightarrow \mathbb {P}\left(A\right) \mathbb {P}\left(B\right) \tag {24.39}

for all AA and BB.

?
(a)

Show that mixing implies ergodicity.

(b)

Show that TT is mixing if (24.39) holds for all AA and BB in a π\pi-system generating F\mathscr {F}.

(c)

Show that the Bernoulli shift is mixing.

(d)

Show that a cyclic permutation is ergodic but not mixing.

(e)

Show that if cc is not a root of unity, then the rotation (Example 24.4) is ergodic but not mixing.

Problem 24.4

↑\uparrow Write T−nF=[T−nA:A∈F]T^{-n} \mathscr {F}=\left[T^{-n} A: A \in \mathscr {F}\right], and call the σ\sigma-field F∞=⋂n=1∞T−nF\mathscr {F}_{\infty }=\bigcap_{n=1}^{\infty } T^{-n} \mathscr {F} trivial if every set in it has probability either 0 or 1. (If TT is invertible, F∞\mathscr {F}_{\infty } is F\mathscr {F} and hence is trivial only in uninteresting cases.)

?
(a)

Show that if F∞\mathscr {F}_{\infty } is trivial, then TT is ergodic. (A cyclic permutation is ergodic even though F∞\mathscr {F}_{\infty } is not trivial.)

(b)

Show that if the hypotheses of Lemma 2 are satisfied, then F∞\mathscr {F}_{\infty } is trivial.

(c)

It can be shown by martingale theory that if F∞\mathscr {F}_{\infty } is trivial, then TT is mixing; see Problem 35.20. Reconsider Problem 24.3(c)

Problem 24.5

8.3524.4↑8.35 \quad 24.4 \uparrow

?
(a)

Show that the shift corresponding to an irreducible, aperiodic Markov chain is mixing. Do this first by Problem 835, then by Problem 24.4(b), (c).

(b)

Show that if the chain is irreducible but has period greater than 1, then the shift is ergodic but not mixing.

(c)

Suppose the state space splits into two closed, disjoint, nonempty subsets, and that the initial distribution (stationary) gives positive weight to each. Show that the corresponding shift is not ergodic.

Problem 24.6

Show that if TT is ergodic and if ff is nonnegative and E[f]=∞\mathbb {E}\left[f\right]=\infty, then n−1∑k=1nf(Tk−1ω)→∞n^{-1} \sum_{k=1}^{n} f\left(T^{k-1} \omega \right) \rightarrow \infty with probability 1.

?
Problem 24.7

24.3 ↑ Suppose that P0(A)=∫AδdP\mathbb {P}_{0}\left(A\right)=\int_{A} \delta d P for all A(δ≥0)A(\delta \geq 0) and that TT is mixing with respect to PP ( TT need not preserve P0P_{0} ). Use (21.9) to prove

P0(T−nA)=∫T−nAδdP→P(A) \mathbb {P}_{0}\left(T^{-n} A\right)=\int _{T^{-n} A} \delta d P \rightarrow \mathbb {P}\left(A\right)
?
Problem 24.8
?
(a)

24.6↑24.6 \uparrow Show that

1n∑k=1nak(x)→∞ \frac{1}{n} \sum _{k=1}^{n} a_{k}(x) \rightarrow \infty

and

a1(x)⋯an(x)n→∏k=1∞(1+1k2+2k)(log⁡k)/(log⁡2) \sqrt[n]{a_{1}(x) \cdots a_{n}(x)} \rightarrow \prod _{k=1}^{\infty }\left(1+\frac{1}{k^{2}+2 k}\right)^{(\log k) /(\log 2)}

almost everywhere.

(b)

Show that

1nlog⁡(qn(x)∣x−pn(x)qn(x)∣)→−π212log⁡2 \frac{1}{n} \log \left(q_{n}(x)\left|x-\frac{p_{n}(x)}{q_{n}(x)}\right|\right) \rightarrow -\frac{\pi ^{2}}{12 \log 2}
Problem 24.9
?
(a)

Show that the continued-fraction transformation is mixing.

(b)

Show that

λ[x:Tnx≤t]→log⁡(1+t)log⁡2,0≤t≤1 \lambda \left[x: T^{n} x \leq t\right] \rightarrow \frac{\log (1+t)}{\log 2}, \quad 0 \leq t \leq 1