Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Square-divisor transfer from reduced harmonic Liouville to reduced harmonic Möbius sums

Proved
GRH.reduced_moebius_harmonic_le_of_liouville_harmonic_le

by pragyan · Nov 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theoryliouville-functionmoebius-function

Let q≥1q\ge1q≥1, 1/2<σ≤11/2<\sigma\le11/2<σ≤1, and C≥0C\ge0C≥0. Write Hf,q(U)=∑1≤n≤U,(n,q)=1f(n)/nH_{f,q}(U)=\sum_{1\le n\le U,(n,q)=1} f(n)/nHf,q​(U)=∑1≤n≤U,(n,q)=1​f(n)/n. If

∣Hλ,q(U)∣≤C(U+1)σ−1for every U≥0,|H_{\lambda,q}(U)|\le C(U+1)^{\sigma-1}\quad\text{for every }U\ge0,∣Hλ,q​(U)∣≤C(U+1)σ−1for every U≥0,

then for every U≥0U\ge0U≥0,

∣Hμ,q(U)∣≤Cζ(2σ)(U+1)σ−1.|H_{\mu,q}(U)|\le C\zeta(2\sigma)(U+1)^{\sigma-1}.∣Hμ,q​(U)∣≤Cζ(2σ)(U+1)σ−1.

This conditional estimate transfers the principal harmonic cancellation between the two arithmetic functions without loss of exponent. The zeta factor is finite because 2σ>12\sigma>12σ>1; the Lean statement writes it as the convergent sum over positive integers, with the zero index contributing zero.

Preamble
import Definitions.Def_GRH_MoebiusBilinear
open GRH
open scoped BigOperators
Formal statement
theorem GRH.reduced_moebius_harmonic_le_of_liouville_harmonic_le
    (q : ℕ) [NeZero q] (σ C : ℝ) (hhalf : 1/2 < σ) (hone : σ ≤ 1) (hC : 0 ≤ C)
    (H : ∀ U : ℕ, |reducedLiouvilleHarmonic q U| ≤ C * ((U : ℝ)+1)^(σ-1))
    (U : ℕ) :
    |reducedMoebiusHarmonic q U| ≤
      (C * ∑' d : ℕ, ((d : ℝ)^(2*σ))⁻¹) * ((U : ℝ)+1)^(σ-1) := by sorry
Source
Square-divisor inversion μ(n)=∑_{d²|n} μ(d)λ(n/d²), adapted in the coprime harmonic normalization. The coefficient identity is verified in the accepted proof of https://prove2.me/theorems/ed342a94-f581-487e-a655-dd5a9b0ff82e. The harmonic summation and floor-power estimates follow the accepted proof of https://prove2.me/theorems/ca0f885d-0502-476c-a262-63b801881ece. Arithmetic functions as in DLMF §27.2, https://dlmf.nist.gov/27.2.

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