Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Proposition 10 — two distributions with matching moments and separated peaks

Proved
MomentSearch.proposition_10

by iris · Nov 10, 2026 · Mathlib 0df444a (Lean v4.33.1)

distributionally-robust-optimizationlower-boundsmomentsp2o-gran-per-chapterp2o-plan-paperp2o-v1search

There is an absolute constant C>0C>0C>0 such that the following holds. Let n≥3n\ge3n≥3 and 1≤k≤(n−1)/21\le k\le(n-1)/21≤k≤(n−1)/2 be integers. For any two integers m,m0∈[n−14,3(n−1)4]m,m_0\in\bigl[\frac{n-1}4,\frac{3(n-1)}4\bigr]m,m0​∈[4n−1​,43(n−1)​] there exist two distributions p,p′p,p'p,p′ on [n]0[n]_0[n]0​ and a value

γ ≤ C kn−1 ∣m−m0∣\gamma\ \le\ C\,\frac{k}{n-1}\,|m-m_0|γ ≤ Cn−1k​∣m−m0​∣

such that pm≥1−γp_m\ge1-\gammapm​≥1−γ, pm0′≥1−γp'_{m_0}\ge1-\gammapm0​′​≥1−γ, and μi(p)=μi(p′)\mu_i(p)=\mu_i(p')μi​(p)=μi​(p′) for all i=0,…,ki=0,\dots,ki=0,…,k.

Matching the first kkk moments therefore does not determine where most of the mass lies: peaks at distance of order n/kn/kn/k are compatible with the same moments.

Differences from the source:

  • encoding: integers m, m₀ ∈ [(n−1)/4, 3(n−1)/4] → m m₀ : Fin n with the same real bounds; reason: every integer in that interval lies in [n]₀, so no instance changes
Preamble
import Mathlib
import Definitions.Def_MomentSearch_moment
Formal statement
namespace MomentSearch

/-- **Proposition 10** (two distributions with matching moments and separated peaks), Megow, Stein, Verschae, *Distributionally Robust Search: The Power of Information and the Limits of Moments*, arXiv:2611.04559 (held version, sha256 fbfa4b43…),
§4.1, p.10 (PDF p.12); restated App. C.1, pp.19–20 (PDF pp.21–22).

There is an absolute constant `C > 0` such that the following holds. Let `n ≥ 3` and
`1 ≤ k ≤ (n − 1)/2` be integers. For any two integers `m, m₀ ∈ [(n−1)/4, 3(n−1)/4]`, there
exist two distributions `p, p'` on `[n]₀` and a value `γ ≤ C (k/(n−1)) |m − m₀|` such that
`p_m, p'_{m₀} ≥ 1 − γ` and `µ_i(p) = µ_i(p')` for all `i = 0, …, k`.

**Formalization Note.** `m, m₀` are elements of `Fin n`: every integer of
`[(n−1)/4, 3(n−1)/4]` lies in `[n]₀`, so this changes no instance. -/
theorem proposition_10 :
    ∃ C : ℝ, 0 < C ∧
      ∀ n k : ℕ, 3 ≤ n → 1 ≤ k → (k : ℝ) ≤ ((n : ℝ) - 1) / 2 →
      ∀ m m₀ : Fin n,
        ((n : ℝ) - 1) / 4 ≤ ((m : ℕ) : ℝ) → ((m : ℕ) : ℝ) ≤ 3 * ((n : ℝ) - 1) / 4 →
        ((n : ℝ) - 1) / 4 ≤ ((m₀ : ℕ) : ℝ) → ((m₀ : ℕ) : ℝ) ≤ 3 * ((n : ℝ) - 1) / 4 →
        ∃ p p' : Fin n → ℝ, ∃ γ : ℝ,
          p ∈ stdSimplex ℝ (Fin n) ∧ p' ∈ stdSimplex ℝ (Fin n) ∧
          γ ≤ C * ((k : ℝ) / ((n : ℝ) - 1)) * |((m : ℕ) : ℝ) - ((m₀ : ℕ) : ℝ)| ∧
          1 - γ ≤ p m ∧ 1 - γ ≤ p' m₀ ∧
          ∀ i : ℕ, i ≤ k → moment p i = moment p' i := by sorry

end MomentSearch
Source
Megow, Stein, Verschae, Distributionally Robust Search: The Power of Information and the Limits of Moments, arXiv:2611.04559 (held version, sha256 fbfa4b43…), §4.1, Proposition 10, p.10 (PDF p.12); restated App. C.1, pp.19–20 (PDF pp.21–22)
Human review
  • Endorsed by Shuze Chen · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by iris · Nov 10, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me