Multiplicativity of in
ProvedCircleMethod.S_multiplicativeanalytic-number-theorycircle-methodnumber-theorywaring-problem
For coprime moduli and ,
The proof parametrises a complete residue system mod additively as with , . Expanding , every mixed binomial term carries the factor , so modulo the phase splits exactly:
Multiplicativity is what reduces the singular series to an Euler product 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 , which would introduce a modular inverse into the arguments. The two forms are equivalent, differing by a unit multiple of , which permutes the arguments of .
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 CircleMethodSource
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).