ConceptComplete

Dirichlet Characters

Dirichlet characters are the multiplicative characters of the group (Z/qZ)Γ—(\mathbb{Z}/q\mathbb{Z})^\times, extended to arithmetic functions on Z\mathbb{Z}. They are the key ingredient in Dirichlet L-functions and the study of primes in arithmetic progressions.


Definition and Basic Properties

Definition5.1Dirichlet Character

A Dirichlet character modulo qq is a function Ο‡:Zβ†’C\chi: \mathbb{Z} \to \mathbb{C} satisfying: (1) Ο‡(n+q)=Ο‡(n)\chi(n+q) = \chi(n) (periodicity), (2) Ο‡(mn)=Ο‡(m)Ο‡(n)\chi(mn) = \chi(m)\chi(n) (complete multiplicativity), (3) Ο‡(n)=0\chi(n) = 0 iff gcd⁑(n,q)>1\gcd(n,q) > 1. There are exactly Ο•(q)\phi(q) Dirichlet characters mod qq, forming a group under pointwise multiplication isomorphic to (Z/qZ)Γ—(\mathbb{Z}/q\mathbb{Z})^\times. The principal character Ο‡0\chi_0 satisfies Ο‡0(n)=1\chi_0(n) = 1 for gcd⁑(n,q)=1\gcd(n,q) = 1.

Definition5.2Primitive Characters and Conductor

A character Ο‡\chi mod qq is primitive if it is not induced from a character mod dd for any proper divisor d∣qd | q. The conductor fΟ‡f_\chi is the smallest modulus from which Ο‡\chi can be induced. Every character mod qq is induced from a unique primitive character mod fΟ‡f_\chi: Ο‡(n)=Ο‡βˆ—(n)Ο‡0(n)\chi(n) = \chi^*(n)\chi_0(n) where Ο‡βˆ—\chi^* is primitive mod fΟ‡f_\chi and Ο‡0\chi_0 is principal mod qq.


Orthogonality Relations

ExampleCharacter Orthogonality

The Dirichlet characters satisfy two orthogonality relations:

First: βˆ‘Ο‡β€Šmodβ€ŠqΟ‡(m)Ο‡(n)β€Ύ={Ο•(q)ifΒ m≑n(modq)Β andΒ gcd⁑(m,q)=10otherwise\sum_{\chi \bmod q} \chi(m)\overline{\chi(n)} = \begin{cases} \phi(q) & \text{if } m \equiv n \pmod{q} \text{ and } \gcd(m,q)=1 \\ 0 & \text{otherwise}\end{cases}

Second: βˆ‘n=1qΟ‡(n)ψ(n)β€Ύ={Ο•(q)ifΒ Ο‡=ψ0otherwise\sum_{n=1}^q \chi(n)\overline{\psi(n)} = \begin{cases} \phi(q) & \text{if } \chi = \psi \\ 0 & \text{otherwise}\end{cases}

The first relation extracts arithmetic progressions: 1Ο•(q)βˆ‘Ο‡Ο‡(a)β€ΎΟ‡(n)=1n≑a(modq)\frac{1}{\phi(q)}\sum_\chi \overline{\chi(a)}\chi(n) = \mathbf{1}_{n \equiv a \pmod{q}} for gcd⁑(a,q)=1\gcd(a,q)=1.


Gauss Sums

Definition5.3Gauss Sum

The Gauss sum associated to Ο‡\chi mod qq is Ο„(Ο‡)=βˆ‘n=1qΟ‡(n)e2Ο€in/q\tau(\chi) = \sum_{n=1}^q \chi(n) e^{2\pi i n/q}. For a primitive character Ο‡\chi: βˆ£Ο„(Ο‡)∣=q|\tau(\chi)| = \sqrt{q} and Ο„(Ο‡)Ο„(Ο‡β€Ύ)=Ο‡(βˆ’1)q\tau(\chi)\tau(\overline{\chi}) = \chi(-1)q. Gauss sums play the role of "Fourier transforms" for characters and appear in the functional equation of L(s,Ο‡)L(s, \chi).

RemarkQuadratic Characters and Reciprocity

For the Legendre symbol Ο‡(n)=(np)\chi(n) = \left(\frac{n}{p}\right) (a real primitive character mod pp): Ο„(Ο‡)={pp≑1(mod4)ipp≑3(mod4)\tau(\chi) = \begin{cases}\sqrt{p} & p \equiv 1 \pmod{4} \\ i\sqrt{p} & p \equiv 3 \pmod{4}\end{cases}. This evaluation of the quadratic Gauss sum is closely related to the proof of quadratic reciprocity.