The central limit theorem states that if are independent and identically distributed random variables with finite mean and finite positive variance , thenHere the arrow means convergence in distribution: for every real , the probability that the expression on the left is at most tends to , the standard normal distribution function. If , the variables equal almost surely and their sample mean is exactly .
The probability density function must integrate to one, soAlso, linearity of expectation and the mean and variance of the standard normal distribution giveUsing the probability density function to compute this expected value givesThese are the values and of the gamma function.
Differentiate the cumulative distribution function for , using and . The probability density function isIts value at zero can be assigned arbitrarily without changing any probability. Although this probability density function diverges as , and there is no point mass at zero. Equivalently, has a gamma distribution with shape and rate one.
Since is nonnegative, its cumulative distribution function is zero for . For ,The last equality uses the symmetry of the standard normal distribution. Thus
Normalization of the probability density function and the specified mean give two equations:Dividing the second by the first gives . ConsequentlyBoth are positive, as required for the stated probability density function.
Expand the square and use linearity of expectation, together with and :This proof applies whenever the second moment is finite, and does not require the random variable to be continuous.
For a random variable with a continuous probability distribution and probability density function , the mean and variance areA finite mean requires . A finite variance additionally requires the second moment to be finite; without that condition the nonnegative integral for the variance may be infinite.
Computing the same expected value directly from the Poisson distribution instead givesFor each fixed positive integer , the ratio test shows that this sum converges. This identity is Dobiński's formula. The case also gives if is interpreted as one in this particular moment formula.
Substitute into the polynomial identity and apply linearity of expectation to its finite sum. The factorial moments of the Poisson distribution in part (a)(iv) are all one, givingThus its th moment counts set partitions: it equals the th Bell number.
Every assignment determines a unique set partition into its nonempty colour classes. If there are such blocks of a set partition, there are choices for that set partition. For each fixed choice, assign distinct colours to the blocks of a set partition inways. Although the blocks of a set partition are unlabelled, they are distinguishable by their elements: ordering them temporarily, for instance by their least elements, counts each assignment exactly once. The falling factorial is zero when , as it should be. Summing over the possible numbers of used colours provesHere is the Stirling number of the second kind. Both sides are polynomials in and agree at infinitely many integers , so the identity also holds for every real , including . This extension will justify substituting the random variable in part (iii).
Each of the distinct elements can receive any of the labelled colours. The multiplication principle therefore givescolour assignments; colours are allowed to remain unused.
For the specified Poisson distribution, the exponential series gives the probability generating functionEvery derivative of is again , so the factorial moments and variance areAlso .
Under the extra hypothesis that exists for every real , its power series has infinite radius of convergence. Termwise differentiation of a power series is therefore valid to every finite order. For ,At this is the expected value of the falling factorial of :In particular . The terms with vanish because their falling factorials contain a zero factor. These factorial moments are finite under the stated hypothesis.
For a nonnegative integer-valued random variable, its probability generating function isThe convention , including at , gives . The power series has absolute convergence for every real , since . More generally its real domain as a finite expected value is , which may extend beyond . No extension beyond that guaranteed interval is automatic.
Each has the same probability distribution as , and independence makes and identically distributed. Thus their two strict tail probabilities are equal:Apply Chebyshev's inequality using the mean and variance from part (i):The equal-tail argument is essential: applying Chebyshev's inequality directly to the absolute tail alone gives the weaker bound .
Each random variable has mean zero and second moment , so its variance is . For , linearity of expectation and variance additivity for independent random variables give
At an absorbing state, the remaining absorption time is zero, so . Multiplying the linear recurrence relation by three givesThe second finite difference of is two. A particular solution is therefore , while every solution of the corresponding homogeneous linear recurrence relation has the form . The boundary conditions give and , henceThis is the mean absorption time of a lazy symmetric random walk with holding probability .
First the expected value of the absorption time is finite. From any interior state, consecutive leftward moves lead to absorption within at most steps, with probability at least . By independence of the subsequent steps, the probability of surviving steps is at most . Summing this geometric series bounds the expected value of the absorption time by .
Now apply first-step analysis. Starting from in the interior, one step is always used. Conditional on that step, the remaining expected values are , , and , each with probability . The law of total expectation therefore givesThe term remains even when the particle stays at , because a step has elapsed. Rearranging gives
There are unlisted articles, also show them or only show them.