Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.3, Eqs. (8)–(9) — Hermite power series P_k(ρ) = Σ_m c_{k,m} ρ^m with c_{k,m} = k W_m(f_1) ≥ 0

Proved
HermiteLaptop.MaxAgree.eq_8_9

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

frieze-jerrum-roundinghermite-expansionp2o-gran-per-chapterp2o-plan-paperp2o-v1

Fix k≥1k\ge1k≥1. For every ρ∈[−1,1]\rho\in[-1,1]ρ∈[−1,1] the collision probability of the kkk-spokes rounding has the Hermite power-series expansion

Pk(ρ)=∑p=1k∑m=0∞ρmWm(fp)=∑m=0∞ck,mρm,P_k(\rho)=\sum_{p=1}^{k}\sum_{m=0}^{\infty}\rho^mW_m(f_p)=\sum_{m=0}^{\infty}c_{k,m}\rho^m,Pk​(ρ)=p=1∑k​m=0∑∞​ρmWm​(fp​)=m=0∑∞​ck,m​ρm,

each inner series converging, and for every m∈N0m\in\mathbb N_0m∈N0​

ck,m=∑p=1kWm(fp)=kWm(f1)=k∑∣α∣=mf^1(α)2≥0.c_{k,m}=\sum_{p=1}^kW_m(f_p)=kW_m(f_1)=k\sum_{|\alpha|=m}\hat f_1(\alpha)^2\ge0.ck,m​=p=1∑k​Wm​(fp​)=kWm​(f1​)=k∣α∣=m∑​f^​1​(α)2≥0.

Here fpf_pfp​ is the indicator of the argmax region ApA_pAp​ and WmW_mWm​ the level-mmm Hermite weight. This expansion is the basis of the whole certification framework: monotonicity (Lemma 2.1) and the truncated bounds (Proposition 2.4) are read off from it.

Formalization Note. The series are stated with Summable/tsum (inner series) and HasSum (the expansion of collisionProb k ρ), so convergence is part of the claim. f1f_1f1​ is argmaxRegion ⟨0, hk⟩.

Differences from the source:

  • encoding: the infinite series in (8) → Summable plus tsum for the inner series, HasSum for Σ_m c_{k,m}ρ^m; reason: genuine convergence is asserted, not a junk tsum value
  • encoding: c_{k,m} defined by (9), W_m(f) by (4) → coeffC k m := Σ_p levelWeight p m with levelWeight p m := Σ_{|α|=m} f̂_p(α)², f_1 = coordinate 0; reason: the defining expressions of (4) and (9); the other equalities of (9) are stated
Preamble
import Mathlib
import Definitions.Def_HermiteLaptop_MaxAgree_Hermite
Formal statement
namespace HermiteLaptop.MaxAgree

/-- §2.3, Eqs. (8)–(9): for `k ≥ 1` and `ρ ∈ [−1, 1]`,
`P_k(ρ) = Σ_p Σ_m ρᵐ W_m(f_p) = Σ_m c_{k,m} ρᵐ`, and `c_{k,m} = k W_m(f_1) ≥ 0`. -/
theorem eq_8_9 (k : ℕ) (hk : 1 ≤ k) :
    (∀ ρ ∈ Set.Icc (-1 : ℝ) 1,
      (∀ p : Fin k, Summable (fun m : ℕ => ρ ^ m * levelWeight p m)) ∧
      collisionProb k ρ = ∑ p : Fin k, ∑' m : ℕ, ρ ^ m * levelWeight p m ∧
      HasSum (fun m : ℕ => coeffC k m * ρ ^ m) (collisionProb k ρ)) ∧
    ∀ m : ℕ, coeffC k m = (k : ℝ) * levelWeight (⟨0, hk⟩ : Fin k) m ∧ 0 ≤ coeffC k m := by sorry

end HermiteLaptop.MaxAgree
Source
García-Soriano, Miyauchi, Hermite Brings a Laptop, arXiv:2609.35453 (held version, sha256 97504f90…), p. 14 (PDF 17), §2.3, Eqs. (8)–(9)
Human review
  • Endorsed by Community (Bot) · Nov 10, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Shuze Chen · 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