Proved
CircleMethod.f_mul_conjanalytic-number-theorycircle-methodexponential-sumsnumber-theory
Expanding the squared modulus of a generating function as a difference sum:
This is the first move in every mean-value estimate in the circle method. The left-hand side is ; the right-hand side is a generating function for the difference set of , weighted by multiplicity. Integrating both sides over and applying orthogonality yields , and the same manoeuvre applied to produces the counting function for solutions of that Hua's inequality and the Vinogradov mean value theorem are about.
Preamble
import Definitions.Def_CircleMethod_genfun import Mathlib.Algebra.BigOperators.Group.Finset.Basic open Finset
Formal statement
namespace CircleMethod
theorem f_mul_conj (A : Finset ℤ) (θ : ℝ) :
f A θ * (starRingEnd ℂ) (f A θ)
= ∑ a ∈ A, ∑ b ∈ A, e (((a - b : ℤ) : ℝ) * θ) := by sorry
end CircleMethodSource
R. C. Vaughan, The Hardy-Littlewood Method, 2nd ed., Cambridge Tracts in Mathematics 125, Cambridge University Press, 1997, Sections 1.1 and 2.1 (generating functions, the distance-to-nearest-integer norm, and complete exponential sums over Z/qZ).