Method of moments (probability theory) Created 2026-10-14 Updated 2026-11-05
If all moments of real random variables converge to those of a moment-determinate limit law, then the variables converge to that law in the sense of convergence in distribution. Moment determinacy is essential; the standard normal distribution meets this condition.
Moment Created 2026-09-28 Updated 2026-11-05
A moment integrates a power of a quantity against a specified measure. For a real random variable , the th raw moment is when defined; the th central moment instead measures powers of deviation from its mean. For equally likely values one and three, the first raw moment is two and the second raw moment is five, while the second central moment is one, its variance. Moments summarize features of a law and can be easier to compute than its full probability distribution. Even knowing every moment does not always determine the law: that additional property is moment determinacy.
Past exam of the mathematics course of the University of Cambridge 2016 iii Paper 124 5 c Solution Created 2026-10-03 Updated 2026-10-06
A useful method of moments in probability states that if real random variables have all moments, for every integer , and is the moment sequence of a moment-determinate probability distribution, then converges to that distribution in the sense of convergence in distribution. In particular, convergence to the standard normal distribution follows from limiting odd moments zero and limiting even moments . The moment-generating function of a standard normal variable, finite in a neighbourhood of zero, ensures moment determinacy.
For the classical Erdős-Kac theorem, put and choose, for example, , with a harmless modification for small . Truncate the prime omega function to primes . The omitted number of distinct prime factors of any is at most , since a product of omitted primes exceeds . Thus this truncation changes the normalized variable by uniformly. Also, the Mertens theorem for reciprocal primes gives
Part (b) transfers every fixed normalized central moment of the truncated prime omega function to the independent Bernoulli random variables model. Indeed, its unnormalized error is at most , using , and this tends to zero for each fixed . In the independent expansion, any singleton index has zero expectation; the leading contributions are pairings, giving exactly the standard normal distribution moments, while blocks of size at least three are negligible after normalization. The method of moments in probability, followed by the uniformly negligible truncation and centering errors, proves the Erdős-Kac theorem.
The same strategy proves the bounded-prime-weight form in part (a). Choose slowly enough that . The omitted weighted contribution is ; its mean is likewise , and its independent variance is by the Mertens theorem for reciprocal primes. Hence the truncated model has the same normalization, and part (b) again transfers each fixed central moment.
It suffices that the moment-generating function be finite on some open interval containing zero:Equivalently, some two-sided exponential moment exists: for some . For the forward implication, choose and use ; the converse follows from for .
Under this weaker hypothesis, all moments exist. For , dominated convergence justifies the Taylor series argument in (i). Vanishing odd moments gives near zero, and the local uniqueness theorem for moment-generating functions gives the symmetric distribution. The reverse implication follows directly from equality of the two probability distributions.
More generally, it suffices that all moments exist and the probability distribution have moment determinacy: and then have identical moments and hence identical probability distributions. Existence of all moments by itself does not provide that uniqueness.