OAI/NumberTheory/Ostmann/Characters/RatioParseval.lean
5 declarations, 0 contain sorry, 0 declared as axioms
Parseval in the ratio of two nonzero arguments with fixed difference
- def
OAI.Ostmann.ratioTestline 14 - def
OAI.Ostmann.ratioDifferenceTransformline 18 - theorem
OAI.Ostmann.ratioTest_sumline 22 - theorem
OAI.Ostmann.ratioDifferenceTransform_eq_mellinline 41 - theorem
OAI.Ostmann.ratioDifferenceTransform_parsevalline 76Source documentation
The sum over all quotient characters costs no small-correlation hypothesis.
theorem ratioDifferenceTransform_parseval {p : ℕ} [Fact p.Prime] (F : ZMod p → ℂ) (y : (ZMod p)ˣ) (h0 : F 0 = 0) (hy : F y = 0) : (∑ ν : MulChar (ZMod p) ℂ, ‖ratioDifferenceTransform F y ν‖ ^ 2) = (Fintype.card (ZMod p)ˣ : ℝ) / (p : ℝ) ^ 2 * ∑ d : ZMod p, ‖F d‖ ^ 2 := by …Mentions: OAI.Ostmann.ratioDifferenceTransform