Hamburger moment problem¶

The problem of deciding whether a given sequence is the sequence of moments of a positive Borel measure on the whole real line, and whether that representing measure is unique.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4812
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Analysis Probability and Moment Problems → Mathematics

Core Idea¶

Solvability is characterized by positivity of the associated Hankel forms, while determinacy requires additional growth or approximation conditions; Stieltjes and Hausdorff variants change the support domain. The proposed moments define a linear functional on polynomials; positivity on squares yields a positive semidefinite Hankel kernel and permits measure representation, while density or growth controls whether two measures can share all moments. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

No faithful explanation at this level. A picture simple enough for a young child collapses into 'a list of clues always identifies exactly one pile'. That hides the two points the problem rests on: a positivity test decides whether any matching distribution exists at all, and even when one exists, different distributions can share every moment.

Rebuilding Sand From Clues

Imagine sand spread along an endless straight line. You can compute numbers about it: how much sand there is, where it is centered on average, how spread out it is, and on through an endless list of fancier averages called moments. The Hamburger moment problem goes the other way. Given such an endless list of numbers, is there any sand spread that matches it? And if there is, could two different spreads match the very same list? There is a test for whether a match exists, and sometimes two different spreads really can share every number.

Real-Line Moment Matching

The Hamburger moment problem asks: given a sequence of real numbers m_0, m_1, m_2, ..., is there a positive measure on the whole real line whose k-th moment (the integral of x^k) equals m_k for every k? It is solvable exactly when the Hankel matrices built from the sequence, with entries m_{i+j}, are positive semidefinite. Intuitively, that says the sequence never assigns a negative value to the square of a polynomial, which a real distribution never could. A separate question is determinacy: whether the measure is unique. Uniqueness needs extra conditions, such as the moments not growing too fast, and without them two different measures can share all their moments. The Stieltjes and Hausdorff versions restrict the measure to the half-line or to an interval instead.

In the Hamburger moment problem one is given a real sequence (m_n) and asks whether there is a positive Borel measure μ on ℝ with every moment finite and ∫x^n dμ = m_n for all n. The sequence defines a linear functional L on polynomials via L(x^n) = m_n. Solvability is characterized by positivity: L must be nonnegative on squares of polynomials, equivalently the Hankel matrices [m_{i+j}] are positive semidefinite, and then a representing measure exists. Determinacy is a separate question: whether μ is unique. It requires extra growth or approximation conditions (for instance, density of polynomials in a suitable space), and indeterminate sequences with many representing measures exist. The Stieltjes problem restricts support to [0,∞) and the Hausdorff problem to a bounded interval, changing the conditions. A correct statement makes explicit the indexing, positivity and regularity of the measure, support on the real line, total mass, and which criterion is used.

Scope of Application¶

Hamburger moment problem belongs to analysis probability and moment problems and is useful where the analyst can specify the typed analysis probability and moment problems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the real sequence and indexing, measure positivity and Borel regularity, support on the real line, finiteness of every moment, Hankel positivity, existence theorem, total mass, determinacy versus indeterminacy criterion, reconstruction, and comparison support problem are explicit.

Clarity¶

The abstraction clarifies a crowded vocabulary by making the real sequence and indexing, measure positivity and Borel regularity, support on the real line, finiteness of every moment, Hankel positivity, existence theorem, total mass, determinacy versus indeterminacy criterion, reconstruction, and comparison support problem are explicit the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Hamburger moment problem. Hamburger moment problem compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed analysis probability and moment problems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem. 2.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of analysis probability and moment problems because they reuse the typed analysis probability and moment problems carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, The proposed moments define a linear functional on polynomials; positivity on squares yields a positive semidefinite Hankel kernel and permits measure representation, while density or growth controls whether two measures can share all moments., and type the carrier, state every parameter and convention in the definition, test that the real sequence and indexing, measure positivity and Borel regularity, support on the real line, finiteness of every moment, Hankel positivity, existence theorem, total mass, determinacy versus indeterminacy criterion, reconstruction, and comparison support problem are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Hamburger moment problem Domain-specific

Parents (1) — outgoing typed relations

Hamburger moment problem is a kind of Estimation Prime

It remains its own entry because its identity is fixed by the real sequence and indexing, measure positivity and Borel regularity, support on the real line, finiteness of every moment, Hankel positivity, existence theorem, total mass, determinacy versus indeterminacy criterion, reconstruction, and comparison support problem.

Hierarchy path (1) — routes to 1 parentless root

Hamburger moment problem → is a kind of Estimation → is a kind of Approximation → is a decomposition of Representation → presupposes Abstraction

Neighborhood in Abstraction Space¶

Hamburger moment problem sits in a crowded region of the domain-specific corpus (19^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Moment Problems & Measure Recovery (6 abstractions)

Nearest neighbors

Stieltjes moment problem — 0.95
Moment problem — 0.94
Hausdorff moment problem — 0.93
Moment matrix — 0.90
Riesz–Markov–Kakutani representation theorem — 0.89

Computed from structural-signature embeddings · 2026-10-25