Plancherel's identity for a finite Fourier polynomial on the circle
ProvedTaoFivePrimes.parseval_fourierPolynomialanalytic-number-theoryexponential-sumsgoldbachnumber-theory
Let and let be complex numbers. For the trigonometric polynomial
one has
This is the Plancherel identity for finite Fourier polynomials on the circle. It is the step by which the norm of a prime exponential sum is converted into a sum of squares of its coefficients, and in that form it is the starting point of Lemma 4.5 and of Proposition 4.10.
Formalization Note The circle is the additive circle with its Haar probability measure, so no normalising factor appears.
Preamble
import Mathlib import Definitions.Def_TaoFivePrimes_FourierRepresentation open MeasureTheory
Formal statement
theorem TaoFivePrimes.parseval_fourierPolynomial (N : ℕ) (a : ℕ → ℂ) :
(∫ alpha : AddCircle (1 : ℝ),
‖TaoFourierIdentity.fourierPolynomial (Finset.range N) a (fun n => (n : ℤ)) alpha‖ ^ 2
∂AddCircle.haarAddCircle)
= ∑ n ∈ Finset.range N, ‖a n‖ ^ 2 := by sorrySource
Terence Tao, "Every odd number greater than 1 is the sum of at most five primes", Mathematics of Computation 83 (2014), 997-1038; arXiv:1201.6656, https://arxiv.org/abs/1201.6656, Section 4, the Plancherel identity used in the proof of Lemma 4.5 (Global L^2 estimate)