Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Hamburger moment problem: moment measures, moment sequences, Hankel kernel and Hankel matrices

Definition
HamburgerMoment_Defs

by Lucas · Oct 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

hankel-matrixmeasure-theorymoment-problem

This file fixes the vocabulary of the Hamburger moment problem.

Let m=(mn)n≥0m=(m_n)_{n\ge0}m=(mn​)n≥0​ be a sequence of real numbers.

  1. Solution (IsMomentMeasure m μ). A positive Borel measure μ\muμ on R\mathbb RR solves the moment problem for mmm if, for every n≥0n\ge 0n≥0, the function x↦xnx\mapsto x^nx↦xn is μ\muμ-integrable and
mn=∫−∞∞xn dμ(x).m_n=\int_{-\infty}^{\infty}x^n\,d\mu(x).mn​=∫−∞∞​xndμ(x).
  1. Moment sequence (IsMomentSequence m). mmm is a moment sequence if it has at least one solution μ\muμ.
  2. Hankel form (hankelForm m c). For a finitary complex sequence c=(cj)j≥0c=(c_j)_{j\ge0}c=(cj​)j≥0​ (only finitely many cj≠0c_j\ne0cj​=0),
∑j,k≥0mj+k cj ck‾∈C.\sum_{j,k\ge0} m_{j+k}\,c_j\,\overline{c_k}\in\mathbb C.j,k≥0∑​mj+k​cj​ck​​∈C.
  1. Positive definite Hankel kernel (HankelPosDef m). The kernel A=(mj+k)j,k≥0A=(m_{j+k})_{j,k\ge0}A=(mj+k​)j,k≥0​ is positive definite if the Hankel form is ≥0\ge 0≥0 for every finitary complex sequence ccc.
  2. Hankel matrices (hankelMatrix m n). Δn=(mi+j)0≤i,j≤n\Delta_n=(m_{i+j})_{0\le i,j\le n}Δn​=(mi+j​)0≤i,j≤n​, the real (n+1)×(n+1)(n+1)\times(n+1)(n+1)×(n+1) matrix.

These are the objects in which every statement of the mission is phrased.

Formalization Note Finitary sequences are finitely supported functions ℕ →₀ ℂ and the Hankel form sums over their support. "≥0\ge0≥0" for the complex-valued Hankel form is the standard partial order on C\mathbb CC, so it asserts that the value is a nonnegative real number. Integrability of x0=1x^0=1x0=1 forces a solution to be a finite measure.

Definition code
import Mathlib

/-!
# Hamburger moment problem — definitions

Source: Wikipedia, "Hamburger moment problem" (revision oldid=1356180072),
sections "Hamburger moment problem" (lead), "Characterization" and
"Uniqueness of solutions".
-/

namespace HamburgerMoment

open MeasureTheory

/-- `μ` is a solution of the Hamburger moment problem for `m`: `μ` is a positive Borel
measure on `ℝ` all of whose power moments exist (are finite) and satisfy
`m n = ∫_{-∞}^{∞} x ^ n dμ(x)` for every `n ≥ 0`. -/
def IsMomentMeasure (m : ℕ → ℝ) (μ : Measure ℝ) : Prop :=
  ∀ n : ℕ, Integrable (fun x : ℝ => x ^ n) μ ∧ ∫ x, x ^ n ∂μ = m n

/-- The Hamburger moment problem for `m` is solvable: `m` is the moment sequence of some
positive Borel measure on the real line. -/
def IsMomentSequence (m : ℕ → ℝ) : Prop :=
  ∃ μ : Measure ℝ, IsMomentMeasure m μ

/-- The quadratic form `∑_{j,k ≥ 0} m_{j+k} c_j \overline{c_k}` of the Hankel kernel
`A = (m_{j+k})_{j,k ≥ 0}`, evaluated at a finitary complex sequence `c`
(a finitely supported function `ℕ →₀ ℂ`). -/
noncomputable def hankelForm (m : ℕ → ℝ) (c : ℕ →₀ ℂ) : ℂ :=
  ∑ j ∈ c.support, ∑ k ∈ c.support, (m (j + k) : ℂ) * c j * starRingEnd ℂ (c k)

open scoped ComplexOrder in
/-- The Hankel kernel `A = (m_{j+k})_{j,k ≥ 0}` is positive definite in the sense of the
source: `∑_{j,k ≥ 0} m_{j+k} c_j \overline{c_k} ≥ 0` for every finitary complex sequence
`(c_j)_{j ≥ 0}`. Here `≥ 0` is the order on `ℂ`, i.e. the sum is a nonnegative real. -/
def HankelPosDef (m : ℕ → ℝ) : Prop :=
  ∀ c : ℕ →₀ ℂ, 0 ≤ hankelForm m c

/-- The `(n + 1) × (n + 1)` Hankel matrix `Δ_n = (m_{i+j})_{0 ≤ i, j ≤ n}`. -/
def hankelMatrix (m : ℕ → ℝ) (n : ℕ) : Matrix (Fin (n + 1)) (Fin (n + 1)) ℝ :=
  Matrix.of fun i j => m (i.val + j.val)

end HamburgerMoment
Source
Wikipedia, "Hamburger moment problem", revision oldid=1356180072, https://en.wikipedia.org/w/index.php?title=Hamburger_moment_problem&oldid=1356180072, lead section and sections "Characterization" and "Uniqueness of solutions" (matrix Δn\Delta_nΔn​)
Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me