Random Variables and Expected Values
[85/34%]A necessary and sufficient condition for a -field to be countably generated is that for some random variable . Hint: If , consider , where is 4 for and 5 for .
If is a positive random variable with density , then has density . Prove this by (20.16) and by a direct argument.
Suppose that a two-dimensional distribution function has a continuous density . Show that .
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 . First construct restricted to , and then pass to the limit . The idea is to argue from first principles, and not to use previous constructions, such as those in Theorems 12.5 and 18.2.
Suppose that , and are positive, independent random variables with distribution function . Show that the quadratic has real zeros with probability .
Show that are independent if and are independent for each .
Let be a persistent, irreducible Markov chain, and for a fixed state let be the times of the successive passages through . Let and . Show that are independent and that for .
Ranks and records. Let be independent random variables with a common continuous distribution function. Let be the -set where for some pair of distinct integers, and show that . Remove from the space on which the are defined. This leaves the joint distributions of the unchanged and makes ties impossible.
Let be that permutation of for which . Let be the rank of among if and only if for exactly values of preceding .
Show that is uniformly distributed over the permutations.
Show that .
Show that is measurable for .
Show that are independent.
Record values. Let be the event that a record occurs at time : .
Show that are independent and .
Show that no record stands forever.
Let be the time of the first record after time . Show that .
Use Fubini's theorem to prove that convolution of finite measures is commutative and associative.
Suppose that and are independent and have densities. Use (20.20) to find the joint density for and then use (20.19) to find the density for . Check with (20.38).
If for all positive , then is a point of increase of (see Problem 12.9). If , then is an atom of .
Show that, if and are points of increase of and , then is a point of increase of .
Show that, if and are atoms of and , then is an atom of .
Suppose that and consist of masses and at . Show that consists of a mass of at . Show that two Poisson distributions (the parameters may differ) convolve to a Poisson distribution.
The Cauchy distribution has density
for . (By (17.9), the density integrates to 1.)
Show that . Hint: Expand the convolution integrand in partial fractions.
Show that, if are independent and have density , then has density as well.
Show that, if and are independent and have the standard normal density, then has the Cauchy density with .
Show that, if has the uniform distribution over , then has the Cauchy distribution with .
Let be independent, each having the standard normal distribution Show that
has density
over . This is called the chi-squared distribution with degrees of freedom.
↑ The gamma distribution has density
over for positive parameters and . Check that (20.47) integrates to 1 Show that
Note that (20.46) is , and from (20.48) deduce again that (20.46) is the density of . Note that the exponential density (20.10) is , and from (20.48) deduce (20.39) once again.
Let be independent, where , and each has the exponential density . Show tnat has density .
Let . Show that with probability 1 if and only if for all positive , whereas if and only if for all positive .
Suppose that is continuous. Show that and imply .
Show that addition and multiplication preserve convergence in probability.
Suppose that the sequence is fundamental in probability in the sense that for positive there exists an such that for .
Prove there is a subsequence and a random variable such that with probability 1. Hint: Choose increasing such that for . Analyze .
Show that .
Suppose that and that . Show that with probability 1.
Show by example that in an infinite measure space functions can converge almost everywhere without converging in measure.
If with probability 1, then 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.
Show that in a discrete probability space convergence in probability is equivalent to convergence with probability 1.
Show that discrete spaces are essentially the only ones where this equivalence holds: Suppose that has a nonatomic part in the sense that there is a set such that and is nonatomic. Construct random variables such that but does not converge to 0 with probability 1.
Let be the infimum of those positive for which .
Show that if and only if with probability 1. Identify random variables that are equal with probability 1, and show that is a metric on the resulting space.
Show that if and only if .
Show that the space is complete.
Show that in general there is no metric on this space such that with probability 1 if and only if .
Construct in a random variable that is uniformly distributed over the surface of the unit sphere in the sense that and has the same distribution as for orthogonal transformations . Hint Let be uniformly distributed in the unit ball in , define , say), and take .
Let and be the longitude and latitude of a random point on the surface of the unit sphere in . Show that and are independent, is uniformly distributed over , and is distributed over with density
Prove
differentiate times with respect to inside the integral (justify), and derive (21.7) again.
Show that, if has the standard normal distribution, then .
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.
20.14 ↑ Show that the Cauchy distribution has no mean.
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?
Prove ( 21.9 ) by Fubini's theorem.
Prove for integrable that
Suppose that and have first moments, and prove
Let ( ] be a nondegenerate random interval Show that its expected length is the integral with respect to of the probability that it covers .
Suppose that and are random variables with distribution functions and .
Show that if and have no common jumps, then .
If is continuous, then .
Even if and have common jumps, if and are taken to be independent, then .
Even if has jumps,
Show that uncorrelated variables need not be independent.
Show that . The cross terms drop out if the are uncorrelated, and hence drop out if they are independent.
↑ Let , and be independent random variables such that and assume the values with probability each and assumes the values 0 and 1 with probabilities and . Let and .
Show that , and have the same one-dimensional distributions as , and , respectively, even though and have different distributions.
Show that and are dependent but uncorrelated
Show that, despite dependence, the moment generating function of is the product of the moment generating functions of and .
Suppose that and are independent, nonnegative random variables and that and . What is the value common to and ? Use the conventions (15.2) for both the product of the random variables and the product of their expected values. What if and ?
Suppose that and are independent and that is nonnegative. Put and show that . Show more generally that . Extend to that may be negative.
The integrability of does not imply that of and separately. Show that it does if and are independent.
Write . Show that this is a metric equivalent to the one in Problem 20.25.
For the density , show that moments of all orders exist but that the moment generating function exists only at .
16.6 ↑ Show that a moment generating function defined in , , can be extended to a function analytic in the strip . If is defined in , show that it can be extended to a function continuous in and analytic in .
Use (21.28) to find the generating function of (20.39).
For independent random variables having moment generating functions, show by (21.28) that the variances add.
20.17 Show that the gamma density (20.47) has moment generating function for . Show that the th moment is 1) Show that the chi-squared distribution with degrees of freedom has mean and variance .
Let be identically distributed random variables with finite second moment. Show that and .
Suppose that is an independent sequence and is measurable for each . Show that there exists a constant such that .
Assume independent, and define as in Theorem 22.8. Prove that for to converge with probability 1 it is necessary that and converge for all positive and sufficient that they converge for some positive . If the three series (22.13) converge but , then there is probability 1 that converges conditionally but not absolutely.
Generalize the Borel-Cantelli lemmas: Suppose are nonnegative If , then converges with probability 1. If the are indepen dent and uniformly bounded, and if , then diverges witk probability 1.
Construct independent, nonnegative such that converges with probability 1 but diverges For an extreme example, arrange that but .
Show under the hypothesis of Theorem 22.6 that has finite variance and extend Theorem 22.4 to infinite sequences.
Suppose that are independent, each with the Cauchy distribution (20.45) for a common value of .
Show that does not converge with probability 1. Contrast with Theorem 22.1.
Show that for . Relate to Theorem 14.3.
If are independent and identically distributed, and if and , then with probability 1. Deduce this from Theorem 22.1 and its corollary and also directly: find a positive such that infinitely often with probability 1.
Suppose that are independent and identically distributed and . Use (21.9) to show that for each , and conclude that with probability 1. Now show that with probability 1. Compare with the corollary to Theorem 22.1.
Wald's equation. Let be independent and identically distributed with finite mean, and put . Suppose that is a stopping time: has positive integers as values and ; see Section 7 for examples. Suppose also that .
Prove that
Suppose that is with probabilities and , let be the first for which is or ( and positive integers), and calculate . This gives the expected duration of the game in the gambler's ruin problem for unequal and .
Let be 1 or 0 according as at time there is or is not a record in the sense of Problem 20.9. Let be the number of records up to time . Show that .
Show that for an independent sequence the radius of convergence of the random Taylor series is with probability 1 for some nonrandom .
Suppose that the have the same distribution and . Show that is 1 or 0 according as has finite mean or not.
Suppose that are independent and each is uniformly distributed over . Show that with probability 1 the series has the unit circle as its natural boundary.
Prove (what is essentially Kolmogorov's zero-one law) that if is independent of a -system and , then is either 0 or 1.
Suppose that is a semiring containing .
Show that if for all , and if and , then .
Show that if for all , and if , then is 0 or 1.
Show that if for all , and if and , then .
Show that if for all , and if , then is 0 or 1.
Reconsider Problem 3.20
Burstin's theorem. Let be a Borel function on with arbitrarily small periods: For each there is a such that and for . Show that such an is constant almost everywhere:
Show that it is enough to prove that is 0 or 1 for every Borel set , where is Lebesgue measure on the unit interval.
Show that is independent of each interval , and conclude that is 0 or 1.
Show by example that need not be constant.
Assume that are independent and are nonnegative Let
Following the first part of the proof of (22.10), show that
Take and ; use (22.22), together with the inequalities and , to prove Etemadi's inequality (22.10) in the form
Carry the rightmost term in (22.22) to the left side, take , and prove Ottaviani's inequality:
Prove
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.
Show that the minimum of independent exponential waiting times is again exponential and that the parameters add.
20.17 ↑ Show that the time of the th event in a Poisson stream has the gamma density as defined by (20.47). This is sometimes called the Erlang density.
Let be the time back to the most recent event in the Poisson stream (or to 0 ), and let be the time forward to the next event. Show that and are independent, that is distributed as (exponentially with parameter ), and that is distributed as is , or 1 as , or .
Let be the length of the interarrival interval covering .
Show that has density
Show that converges to as . This seems paradoxical because is one of the . Give an intuitive resolution of the apparent paradox.
Merging Poisson streans. Define a process by (23.5) for a sequence of random variables satisfying (23.4). Let be a second sequence of random variables, on the same probability space, satisfying (23.4), and define by . Define by . Show that, if and are independent and and are Poisson processes with respective rates and , then is a Poisson process with rate .
The th and st events in the process occur at times and .
Find the distribution of the number of events in the other process during this time interval.
Generalize to .
Suppose that are independent and exponentially distributed with parameter , so that (23.5) defines a Poisson process . Suppose that are independent and identically distributed and that and are independent. Put . This is the compound Poisson process. If, for example, the event at time in the original process represents an insurance claim, and if represents the amount of the claim, then , represents the total claims to time ,
If with probability 1, then is an ordinary Poisson process.
Show that has independent increments and that has the same distribution as .
Show that, if assumes the values 1 and 0 with probabilities and , then is a Poisson process with rate .
Suppose a process satisfies Condition and has independent, Poisson-distributed increments and no fixed discontinuities. Show that it has the form , where is a standard Poisson process and is a nondecreasing, continuous function on with .
If the waiting times are independent and exponentially distributed with parameter , then with probability 1, by the strong law of large numbers. From and deduce that with probability 1.
Suppose that are positive, and assume directly that with probability 1, as happens if the are independent and identically distributed with mean . Show that with probability 1.
Suppose now that with probability 1, as happens if the are independent and identically distributed and have infinite mean. Show that 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 are the lifetimes of the successive components, and is the number of replacements, or renewals, to time .
20.723 .10 ↑ Consider a persistent, irreducible Markov chain, and for a fixed state let be the number of passages through up to time . Show that with probability 1, where is the mean return time (replace by 0 if this mean is infinite). See Lemma 3 in Section 8.
Suppose that and have Poisson distributions with parameters and . Show that . Hint: Suppose that , and represent as , where and are independent and have Poisson distributions with parameters and .
↑ Use the methods in the proof of Theorem 23.2 to show that the error in (23.15) is bounded uniformly in by .
Fix and a measurable . The probability measures on preserved by form a convex set . Show that is ergodic under if and only if is an extreme point of -cannot be represented as a proper convex combination of distinct elements of .
Show that is ergodic if and only if for all and (or all and in a -system generating ).
↑ The transformation is mixing if
for all and .
Show that mixing implies ergodicity.
Show that is mixing if (24.39) holds for all and in a -system generating .
Show that the Bernoulli shift is mixing.
Show that a cyclic permutation is ergodic but not mixing.
Show that if is not a root of unity, then the rotation (Example 24.4) is ergodic but not mixing.
Write , and call the -field trivial if every set in it has probability either 0 or 1. (If is invertible, is and hence is trivial only in uninteresting cases.)
Show that if is trivial, then is ergodic. (A cyclic permutation is ergodic even though is not trivial.)
Show that if the hypotheses of Lemma 2 are satisfied, then is trivial.
It can be shown by martingale theory that if is trivial, then is mixing; see Problem 35.20. Reconsider Problem 24.3(c)
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).
Show that if the chain is irreducible but has period greater than 1, then the shift is ergodic but not mixing.
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.
Show that if is ergodic and if is nonnegative and , then with probability 1.
24.3 ↑ Suppose that for all and that is mixing with respect to ( need not preserve ). Use (21.9) to prove
Show that
and
almost everywhere.
Show that
Show that the continued-fraction transformation is mixing.
Show that