Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Uniqueness under the growth bound ∣mn∣≤CDnn!|m_n|\le CD^nn!∣mn​∣≤CDnn!

Proved
HamburgerMoment.unique_of_abs_le_factorial

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

hankel-matrixmoment-problem

Let m=(mn)n≥0m=(m_n)_{n\ge0}m=(mn​)n≥0​ be a real sequence and suppose there are constants C,DC,DC,D such that

∣mn∣ ≤ C Dn n!for all n≥0.|m_n|\ \le\ C\,D^n\,n!\qquad\text{for all }n\ge0.∣mn​∣ ≤ CDnn!for all n≥0.

Then the Hamburger moment problem for mmm has at most one solution: if μ\muμ and ν\nuν are positive Borel measures on R\mathbb RR with xnx^nxn integrable and ∫xn dμ=∫xn dν=mn\int x^n\,d\mu=\int x^n\,d\nu=m_n∫xndμ=∫xndν=mn​ for all nnn, then μ=ν\mu=\nuμ=ν.

This growth condition is a special case of Carleman's condition.

Preamble
import Mathlib
import Definitions.Def_HamburgerMoment_Defs

open MeasureTheory
Formal statement
namespace HamburgerMoment

theorem unique_of_abs_le_factorial (m : ℕ → ℝ) (C D : ℝ)
    (hCD : ∀ n : ℕ, |m n| ≤ C * D ^ n * (n.factorial : ℝ))
    (μ ν : Measure ℝ) (hμ : IsMomentMeasure m μ) (hν : IsMomentMeasure m ν) :
    μ = ν := by sorry

end HamburgerMoment
Source
Wikipedia, "Hamburger moment problem", revision oldid=1356180072, https://en.wikipedia.org/w/index.php?title=Hamburger_moment_problem&oldid=1356180072, section "Uniqueness of solutions", sentence "More generally, the solution is unique if there are constants C and D such that, for all n, |mn| ≤ CD^n n! (Reed & Simon 1975, p. 205)"
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