The fundamental counting identity of the circle method
ProvedCircleMethod.circle_method_countThe identity on which the entire Hardy--Littlewood circle method rests.
Let be a finite set of integers and let
be its exponential generating function. Then for every and every ,
The proof is a single expansion followed by orthogonality: , and is when and otherwise, so every tuple whose sum differs from is annihilated.
The significance is that an arithmetic quantity — a count of representations — has been written as an analytic one, an integral over the circle. The method then estimates that integral by splitting the circle into major arcs, where is large and computable, and minor arcs, where is small. Nothing in the method is possible before this identity is available.
Formalization Note. Tuples are functions , so they are ordered and repetitions are allowed. No hypotheses are placed on , or : the degenerate cases and are included, and for both sides reduce to .
import Definitions.Def_CircleMethod_genfun import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Integrals.Basic import Mathlib.NumberTheory.Divisors import Mathlib.Data.Fintype.Pi open Finset
namespace CircleMethod
theorem circle_method_count (A : Finset ℤ) (s : ℕ) (n : ℤ) :
(∫ θ in (0:ℝ)..1, (f A θ) ^ s * e (-(n : ℝ) * θ))
= ((((Fintype.piFinset (fun _ : Fin s => A)).filter
(fun v => ∑ i, v i = n)).card : ℕ) : ℂ) := by sorry
end CircleMethod