Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Parseval identity for the prime sum

Proved
LL_Decomp1535a.parseval_of_orth

by sthubbar · Oct 30, 2026 · Mathlib 0df444a (Lean v4.33.1)

number-theory

Assume that for every integer kkk, ∫01e2πiαk dα\int_0^1 e^{2\pi i \alpha k}\,d\alpha∫01​e2πiαkdα equals 111 if k=0k=0k=0 and 000 otherwise. Then for every natural number NNN, ∫01∣SN(α)∣2 dα=∑p≤N, p prime(log⁡p)2\int_0^1 |S_N(\alpha)|^2\,d\alpha=\sum_{p\le N,\ p\text{ prime}} (\log p)^2∫01​∣SN​(α)∣2dα=∑p≤N, p prime​(logp)2.

Preamble
import Mathlib
import Definitions.Def_LL_Decomp1535a_S

open MeasureTheory
Formal statement
namespace LL_Decomp1535a
theorem parseval_of_orth
    (horth : ∀ k : ℤ, ∫ α in (0 : ℝ)..1, Complex.exp (2 * Real.pi * Complex.I * α * k) =
      if k = 0 then 1 else 0) (N : ℕ) :
    ∫ α in (0 : ℝ)..1, ‖S N α‖ ^ 2 =
      ∑ p ∈ (Finset.range (N + 1)).filter Nat.Prime, Real.log p ^ 2 := by sorry
end LL_Decomp1535a
Source
Liu and Wang 2002, p. 174, proof of Theorem 1
Read-back

What the Lean code literally says, in plain math · claude-haiku

LL_Decomp1535a.parseval_of_orth

For a natural number NNN, the declaration assumes the hypothesis horth: for every integer kkk,

∫01e2πiαk dα={1if k=0,0if k≠0,\int_0^1 e^{2\pi i \alpha k}\,d\alpha = \begin{cases} 1 & \text{if } k = 0, \\ 0 & \text{if } k \neq 0, \end{cases}∫01​e2πiαkdα={10​if k=0,if k=0,​

where iii is the imaginary unit and π\piπ is the circle constant. Horth is a true identity for every integer kkk, so it is satisfiable and does not make the statement vacuous.

Under this hypothesis, the declaration concludes

∫01∥SN(α)∥2 dα=∑p≤Np prime(log⁡p)2,\int_0^1 \|S_N(\alpha)\|^2\,d\alpha = \sum_{\substack{p \le N \\ p \text{ prime}}} (\log p)^2,∫01​∥SN​(α)∥2dα=p≤Np prime​∑​(logp)2,

where log⁡\loglog is the natural logarithm, ∥⋅∥\|\cdot\|∥⋅∥ is the complex modulus, and SN(α)S_N(\alpha)SN​(α) is a complex-valued function of the real variable α\alphaα. The definition of SNS_NSN​ lives in an imported module that this read-back does not expand, so the left side is only as explicit as that definition.

The right side sums over the primes ppp with p≤Np \le Np≤N, so p=Np = Np=N is included when NNN is prime. For N=0N = 0N=0 or N=1N = 1N=1 there are no such primes and the right side is 000.

Human review
  • Endorsed by Shuze Chen · Oct 30, 2026

    Confirmed by the moderator at approval.

  • Endorsed by sthubbar · Oct 30, 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