Dirichlet's Theorem on Arithmetic Sequences/Lemma 2

Lemma for Dirichlet's Theorem on Arithmetic Sequences
Let $a, q$ be coprime integers.

Let $\PP_{a, q}$ be the set of primes $p$ such that $p \equiv a \pmod q$.

Define:


 * $\eta_{a, q} : n \mapsto \begin{cases}

1 & : n \equiv a \pmod q\\ 0 & : \text{otherwise} \end{cases}$

Let $G = \paren {\Z / q \Z}^\times$.

Let $G^*$ be the dual group of characters on $G$.

Then for all $n \in \N$:


 * $\displaystyle \map {\eta_{a, q} } n = \sum_{\chi \mathop \in G^*} \frac {\map {\overline \chi} a} {\map \phi q} \, \map \chi n$

Proof
There is only one $x \in G$ such that $\map \eta x \ne 0$, and this equals $\map \eta a = 1$.

So:


 * $\displaystyle \sum_{x \mathop \in G} \map {\eta_{a, q} } x \, \map {\overline \chi} x = \map {\overline \chi} a$

Therefore, by Discrete Fourier Transform on Abelian Group we have for all $x \in G$:


 * $\displaystyle \map \eta x = \frac 1 {\map \phi q} \sum_{\chi \mathop \in G^*} \map {\overline \chi} a \, \map \chi x$

as required.