Moment problem

In mathematics, a moment problem arises as the result of trying to invert the mapping that takes a measure μ to the sequences of moments

More generally, one may consider

for an arbitrary sequence of functions M_n.

Introduction

In the classical setting, μ is a measure on the real line, and M is in the sequence { xⁿ : n = 0, 1, 2, ... } In this form the question appears in probability theory, asking whether there is a probability measure having specified mean, variance and so on, and whether it is unique.

There are three named classical moment problems: the Hamburger moment problem in which the support of μ is allowed to be the whole real line; the Stieltjes moment problem, for [0, +∞); and the Hausdorff moment problem for a bounded interval, which without loss of generality may be taken as [0, 1].

Existence

A sequence of numbers m_n is the sequence of moments of a measure μ if and only if a certain positivity condition is fulfilled; namely, the Hankel matrices H_n,

should be positive semi-definite. A condition of similar form is necessary and sufficient for the existence of a measure μ supported on a given interval [a, b].

One way to prove these results is to consider the linear functional that sends a polynomial

to

If m_kn are the moments of some measure μ supported on [a, b], then evidently

(*) φ(P) ≥ 0 for any polynomial P that is non-negative on [a, b].

Vice versa, if (*) holds, one can apply the M. Riesz extension theorem and extend φ to a functional on the space of continuous functions with compact support C₀([a, b]), so that

such that ƒ ≥ 0 on [a, b].

By the Riesz representation theorem, (**) holds iff there exists a measure μ supported on [a, b], such that

for every ƒ ∈ C₀([a, b]).

Thus the existence of the measure μ is equivalent to (*). Using a representation theorem for positive polynomials on [a, b], one can see reformulate (*) as a condition on Hankel matrices.

See Refs. 1–3. for more details.

Uniqueness (or determinacy)

The uniqueness of μ in the Hausdorff moment problem follows from the Weierstrass approximation theorem, which states that polynomials are dense in the uniform norm on [0, 1]. For the problem on an infinite interval, uniqueness is a more delicate question; see Carleman's condition, Krein's condition and Ref. 2.

Variations

An important variation is the truncated moment problem, which studies the properties of measures with fixed first k moments (for a finite k). Results on the truncated moment problem have numerous applications to extremal problems, optimisation and limit theorems in probability theory. See also: Chebyshev–Markov–Stieltjes inequalities and Ref. 3.

References

1. Shohat, James Alexander; Tamarkin, J. D.; The Problem of Moments, American mathematical society, New York, 1943.

2. Akhiezer, N. I., The classical moment problem and some related questions in analysis, translated from the Russian by N. Kemmer, Hafner Publishing Co., New York 1965 x+253 pp.

3. Krein, M. G.; Nudelman, A. A.; The Markov moment problem and extremal problems. Ideas and problems of P. L. Chebyshev and A. A. Markov and their further development. Translated from the Russian by D. Louvish. Translations of Mathematical Monographs, Vol. 50. American Mathematical Society, Providence, R.I., 1977. v+417 pp.