Hausdorff moment problem

The problem of characterizing sequences that are moments of a positive measure on the unit interval, with a unique representing measure whenever one exists.

Version

v2 · 2026-09-19 · History

Domain-specific #

4833

Domain group

Formal Sciences

Origin domain

Mathematics

Subdomain

Analysis and Probability → Mathematics

Core Idea

Complete monotonicity of finite differences characterizes normalized moment sequences; bounded support makes the problem determinate unlike general Hamburger or Stieltjes cases. Moment values define a positive functional on polynomials, bounded interval constraints enforce alternating finite-difference positivity and approximation extends the functional to a unique measure. 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.

The load-bearing residual is not the broad topic of analysis and probability. It is the domain-specific identity determined by the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem are explicit.

How would you explain it like I'm…

Sand-on-a-Ruler Clues

Imagine some sand is hidden along a ruler that goes from 0 to 1. You get clues: how much sand there is, where it balances, and more clues like that. The Hausdorff moment problem asks which lists of clues could come from real sand. When the clues do work, they tell you exactly how the sand is spread.

Rebuild the Spread From Averages

Picture mass spread along a stick from 0 to 1. Its 'moments' are a list of averages: the total amount, the average position, the average of position squared, and so on forever. The Hausdorff moment problem asks two things. First, given a list of numbers, could it be the moments of some real spread of mass on that stick? Second, if so, is that spread the only one? There is a test using differences between neighboring numbers that answers the first question. Because the stick has fixed ends, the answer to the second is always yes: only one spread fits.

Moments on the Unit Interval

Given a sequence of real numbers m₀, m₁, m₂, …, the Hausdorff moment problem asks whether there is a positive measure μ on [0,1] with mₙ = ∫xⁿ dμ for every n. The answer is yes exactly when the sequence is 'completely monotone.' That means repeated finite differences of the sequence alternate in sign in a specific way, so that a certain family of combinations is never negative. When such a measure exists it is unique, because the interval is bounded. This differs from the Hamburger and Stieltjes moment problems on unbounded sets, where different measures can share the same moments.

 

Given a real sequence (mₙ), the Hausdorff moment problem asks for a positive measure μ on [0,1] with ∫xⁿ dμ = mₙ for every n, under a stated indexing and normalization. The moments define a linear functional on polynomials by sending xⁿ to mₙ. Positivity on the interval forces the alternating finite differences (−1)ᵏΔᵏmₙ to be non-negative, which is complete monotonicity. Hausdorff's criterion says this condition is both necessary and sufficient for a measure to exist. Polynomial approximation then extends the functional to a unique measure. So the problem is determinate: bounded support guarantees uniqueness, unlike the general Hamburger (ℝ) and Stieltjes ([0,∞)) moment problems.

Scope of Application

Hausdorff moment problem belongs to analysis and probability and is useful where the analyst can specify the typed analysis and probability carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem are explicit. The scope is broad within that domain but bounded by the need for the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem are explicit. The entry records a descriptive analytical identity; practical use requires the governing domain's evidence, standards, and safety obligations.

Clarity

The abstraction clarifies a crowded vocabulary by making the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem 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. A bare label is insufficient because the name Hausdorff moment problem can be used for a formal identity, an implementation, or a neighboring result unless carrier and convention are stated.

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 Hausdorff moment problem. Hausdorff 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

1. Identify the carrier. State what the elements, states, objects, or observations are: the typed analysis and probability carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
2. Lock the constitutive rule. Express the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem are explicit independently of one notation or implementation.

Knowledge Transfer

Knowledge transfers strongly among subfields of analysis and probability because they reuse the typed analysis and probability carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Moment values define a positive functional on polynomials, bounded interval constraints enforce alternating finite-difference positivity and approximation extends the functional to a unique measure., and type the carrier, state every parameter and convention in the definition, test that the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem are explicit, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions

Current abstraction Hausdorff moment problem Domain-specific

Parents (1) — outgoing typed relations

• Hausdorff moment problem is a kind of Hidden Information Reconstruction Prime

  It remains its own entry because its identity is fixed by the real sequence and indexing, support interval zero to one, positive-measure and normalization convention, moment equations, finite-difference existence criterion and uniqueness theorem.

Hierarchy path (1) — routes to 1 parentless root

• Hausdorff moment problem → is a kind of Hidden Information Reconstruction

Neighborhood in Abstraction Space

Hausdorff moment problem sits in a crowded region of the domain-specific corpus (10^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

• Moment problem — 0.94
• Stieltjes moment problem — 0.93
• Hamburger moment problem — 0.93
• Singular function — 0.91
• Differentiable vector-valued functions from Euclidean space — 0.91

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