Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Multiplicativity of S(q,a)S(q,a)S(q,a) in qqq

Proved
CircleMethod.S_multiplicative

by tabbott · Sep 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

analytic-number-theorycircle-methodnumber-theorywaring-problem

For coprime moduli q1,q2q_1,q_2q1​,q2​ and k≥1k\ge1k≥1,

S(q1q2, a)  =  S ⁣(q1, a q2 k−1) S ⁣(q2, a q1 k−1).S(q_1q_2,\,a)\;=\;S\!\left(q_1,\,a\,q_2^{\,k-1}\right)\,S\!\left(q_2,\,a\,q_1^{\,k-1}\right).S(q1​q2​,a)=S(q1​,aq2k−1​)S(q2​,aq1k−1​).

The proof parametrises a complete residue system mod q1q2q_1q_2q1​q2​ additively as x=q2u+q1vx=q_2u+q_1vx=q2​u+q1​v with u<q1u<q_1u<q1​, v<q2v<q_2v<q2​. Expanding (q2u+q1v)k(q_2u+q_1v)^{k}(q2​u+q1​v)k, every mixed binomial term carries the factor q1q2q_1q_2q1​q2​, so modulo 111 the phase splits exactly:

a(q2u+q1v)kq1q2  ≡  a q2 k−1ukq1+a q1 k−1vkq2(mod1).\frac{a(q_2u+q_1v)^{k}}{q_1q_2}\;\equiv\;\frac{a\,q_2^{\,k-1}u^{k}}{q_1}+\frac{a\,q_1^{\,k-1}v^{k}}{q_2}\pmod 1.q1​q2​a(q2​u+q1​v)k​≡q1​aq2k−1​uk​+q2​aq1k−1​vk​(mod1).

Multiplicativity is what reduces the singular series to an Euler product S(n)=∏pσp(n)\mathfrak{S}(n)=\prod_p\sigma_p(n)S(n)=∏p​σp​(n) over local densities at each prime — the local-global structure of the method. Without it, the arithmetic factor could not be analysed prime by prime.

Formalization Note. The additive parametrisation is used rather than the Chinese remainder isomorphism Z/q1q2≅Z/q1×Z/q2\mathbb{Z}/q_1q_2\cong\mathbb{Z}/q_1\times\mathbb{Z}/q_2Z/q1​q2​≅Z/q1​×Z/q2​, which would introduce a modular inverse into the arguments. The two forms are equivalent, differing by a unit multiple of aaa, which permutes the arguments of SSS.

Preamble
import Definitions.Def_CircleMethod_waring
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Analysis.SpecialFunctions.Integrals.Basic
import Mathlib.MeasureTheory.Integral.DominatedConvergence
import Mathlib.Algebra.BigOperators.Group.Finset.Basic
open Finset
Formal statement
namespace CircleMethod

theorem S_multiplicative (k q₁ q₂ : ℕ) (a : ℤ) (hk : 1 ≤ k) (hco : Nat.Coprime q₁ q₂) :
    S k (q₁ * q₂) a
      = S k q₁ (a * (q₂ : ℤ) ^ (k - 1)) * S k q₂ (a * (q₁ : ℤ) ^ (k - 1)) := by sorry

end CircleMethod
Source
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Section 2.6, Lemma 2.10 (multiplicativity of complete exponential sums).

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