Stieltjes moment problem

In mathematics, the Stieltjes moment problem, named after Thomas Joannes Stieltjes, seeks necessary and sufficient conditions for a sequence { mn, : n = 0, 1, 2, ... } to be of the form

for some measure μ. If such a function μ exists, one asks whether it is unique.

The essential difference between this and other well-known moment problems is that this is on a half-line [0, ), whereas in the Hausdorff moment problem one considers a bounded interval [0, 1], and in the Hamburger moment problem one considers the whole line (, ).

Existence

Let

and

Then { mn : n = 1, 2, 3, ... } is a moment sequence of some measure on with infinite support if and only if for all n, both

{ mn : n = 1, 2, 3, ... } is a moment sequence of some measure on with finite support of size m if and only if for all , both

and for all larger

Uniqueness

There are several sufficient conditions for uniqueness, for example, Carleman's condition, which states that the solution is unique if

gollark: JEI = NEI = PotatOS
gollark: The best way to do it is probably "check first characters match, check lengths match".
gollark: Ah, good, it is not.
gollark: If it *is* O(n) I'll just use a simpler heuristic, like "first character of strings match".
gollark: This is Cobalt, I bet the lua strings are just java byte arrays.

References

  • Reed, Michael; Simon, Barry (1975), Fourier Analysis, Self-Adjointness, Methods of modern mathematical physics, 2, Academic Press, p. 341 (exercise 25), ISBN 0-12-585002-6
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.