Large sieve inequalities for special characters to prime square moduli (Q1769813)

Let \(G^{(1)}_q\) denote the set of the \(\varphi(q)\) multiplicative characters \(\xi\) modulo~\(q^2\) that associates\break \(e((x-1)/q)\) to every \(x\equiv 1[q]\). Such characters are defined modulo \(q^2\) but differ one from another by a multiplicative character of modulus \(q\). Let \((a_n)_{1\leq n\leq N}\) be a sequence of complex numbers and denote by \(S(\xi)\) the sum \(\sum_na_n\xi(n)\). The author proves that \[ \sum_{q\leq Q}q/\varphi(q)\sum_{\xi\in G^{(1)}_q}| S(\xi)| ^2 \ll Q^{\varepsilon} (N Q^{1/2}+N^{1/4}Q^2+N^{3/4}Q^{11/8}) \sum_n | a_n| ^2. \] Using only orthogonality modulo \(q^2\) and summing up would provides us with an upper bound in \((Q^2+QN)\sum_n | a_n| ^2\). This inequality above improves on this as soon as \(N\) is larger than \(Q^{3/2+\varepsilon}\). The proof uses Weil's bound for Kloosterman sums. This way of taking advantage of non squarefree divisors of the modulus to handle characters sums comes from \textit{A. G.~Postnikov} [Izv. Akad. Nauk SSSR, Ser. Mat. 19, No. 1, 11--16 (1955; Zbl 0068.04003)] and has been extended to composite moduli by \textit{H.~Iwaniec} [Invent. Math. 23, 97--104 (1974; Zbl 0275.10024)].