Dirichlet character explained

\chi: Z → C is a Dirichlet character of modulus m (where m is a positive integer) if for all integers a and b :^[1] \chi(ab) = \chi(a)\chi(b); that is, \chi is completely multiplicative.\chi(a) \begin{cases} =0 & if \gcd(a,m)> 1 \\ \ne 0 & if \gcd(a,m) =1 . \end{cases} (gcd is the greatest common divisor)\chi(a + m) = \chi(a) ; that is, \chi is periodic with period m .The simplest possible character, called the principal character, usually denoted \chi _{0} , (see Notation below) exists for all moduli:^[2] \chi _{0(a)= \begin{cases} 0} & if \gcd(a,m)> 1 \\ 1 & if \gcd(a,m) =1 . \end{cases} The German mathematician Peter Gustav Lejeune Dirichlet—for whom the character is named—introduced these functions in his 1837 paper on primes in arithmetic progressions.^{[3] [4]}

Notation

\phi(n) is Euler's totient function.\zeta _{n} is a complex primitive n-th root of unity:\zeta ^{n =1 ,} _{n} but \zeta _{n\ne} 1 , \zeta ^{2 \ne} _{n} 1 , ... \zeta ^{n -1} _{n} \ne 1 . ( Z /m Z ) ^{x} is the group of units mod m . It has order \phi(m). \widehat{( Z /m Z ) ^{x }} is the group of Dirichlet characters mod m .p, p _{k,} etc. are prime numbers.(m,n) is a standard^[5] abbreviation^[6] for \gcd(m,n) \chi(a), \chi'(a), \chi _{r(a),} etc. are Dirichlet characters. (the lowercase Greek letter chi for "character")

There is no standard notation for Dirichlet characters that includes the modulus. In many contexts (such as in the proof of Dirichlet's theorem) the modulus is fixed. In other contexts, such as this article, characters of different moduli appear. Where appropriate this article employs a variation of Conrey labeling (introduced by Brian Conrey and used by the LMFDB).

In this labeling characters for modulus

m are denoted \chi _{m,} (a) where the index t is described in the section the group of characters below. In this labeling, \chi _{m,\} (a) denotes an unspecified character and\chi _{m,1} (a) denotes the principal character mod m .

Relation to group characters

The word "character" is used several ways in mathematics. In this section it refers to a homomorphism from a group

G (written multiplicatively) to the multiplicative group of the field of complex numbers:η : G → C ^{x , η(gh)=η(g)η(h), η(g} ^{-1} ) =η (g) ^{-1} .

The set of characters is denoted

\widehat{G}. If the product of two characters is defined by pointwise multiplication η \theta(a) =η (a)\theta(a), the identity by the trivial character η _{0(a)=1} and the inverse by complex inversion η ^{-1} (a) =η (a) ^{-1} then \widehat{G} becomes an abelian group.^[7]

If

A is a finite abelian group then^[8] there is an isomorphism A\cong\widehat{A} , and the orthogonality relations:^[9] \sum _{a\in} η (a) = \begin{cases} |A|& if η=η _{0\\ 0&if} η \ne η _{0 \end{cases}}     and     \sum _{η\in\widehat{A} }\eta(a)=\begin|A|&\text a=1\\0&\text a\ne 1.\end

The elements of the finite abelian group

( Z /m Z ) ^{x} are the residue classes [a] = \{x:x\equiv a\pmod m\} where (a,m) =1 .

A group character

\rho:( Z /m Z ) ^{x →} C ^{x} can be extended to a Dirichlet character \chi: Z → C by defining\chi(a) = \begin{cases} 0 & if [a]\not\in( Z /m Z ) ^{x &i.e.(a,m)>} 1 \\ \rho([a])& if [a]\in( Z /m Z ) ^{x &i.e.(a,m)=} 1 , \end{cases}

and conversely, a Dirichlet character mod

m defines a group character on ( Z /m Z ) ^{x .}

Paraphrasing Davenport^[10] Dirichlet characters can be regarded as a particular case of Abelian group characters. But this article follows Dirichlet in giving a direct and constructive account of them. This is partly for historical reasons, in that Dirichlet's work preceded by several decades the development of group theory, and partly for a mathematical reason, namely that the group in question has a simple and interesting structure which is obscured if one treats it as one treats the general Abelian group.

Elementary facts

4) Since

\gcd( 1 ,m) =1 , property 2) says \chi( 1 )\ne 0 so it can be canceled from both sides of \chi( 1 )\chi( 1 ) = \chi( 1 x 1 ) = \chi( 1 ) :\chi( 1 ) =1 . ^[11]

5) Property 3) is equivalent to

if

a \equiv b \pmod{m}   then \chi(a) = \chi(b).

6) Property 1) implies that, for any positive integer

n \chi(a ^{n)=\chi(a)} ^{n.}

7) Euler's theorem states that if

(a,m) =1 then a ^{\phi(m)} \equiv 1 \pmod{m}. Therefore,\chi(a) ^{\phi(m)} = \chi(a ^{\phi(m)} ) = \chi( 1 ) =1 .

That is, the nonzero values of

\chi(a) are \phi(m) -th roots of unity:\chi(a) = \begin{cases} 0 & if \gcd(a,m)> 1 \\ \zeta ^{r& if} _{\phi(m)} \gcd(a,m) =1 \end{cases}

for some integer

r which depends on \chi, \zeta, and a . This implies there are only a finite number of characters for a given modulus.

8) If

\chi and \chi' are two characters for the same modulus so is their product \chi\chi', defined by pointwise multiplication:\chi\chi'(a) = \chi(a)\chi'(a)   (\chi\chi' obviously satisfies 1-3).^[12]

The principal character is an identity:

\chi\chi _{0(a)=\chi(a)\chi} _{0(a)= \begin{cases} 0} x 0 & = \chi(a)& if \gcd(a,m)> 1 \\ \chi(a) x 1 & = \chi(a) & if \gcd(a,m) =1 . \end{cases}

9) Let

a ^{-1} denote the inverse of a in ( Z /m Z ) ^{x} .Then\chi(a)\chi(a ^{-1} ) = \chi(aa ^{-1} ) = \chi( 1 ) =1 , so \chi(a ^{-1} ) = \chi(a) ^{-1} , which extends 6) to all integers.

The complex conjugate of a root of unity is also its inverse (see here for details), so for

(a,m) =1 \overline{\chi}(a) = \chi(a) ^{-1} = \chi(a ^{-1} ).   (\overline\chi also obviously satisfies 1-3).

Thus for all integers

a \chi(a)\overline{\chi}(a) = \begin{cases} 0 & if \gcd(a,m)> 1 \\ 1 & if \gcd(a,m) =1 \end{cases};   in other words \chi\overline{\chi} = \chi _{0} . 

10) The multiplication and identity defined in 8) and the inversion defined in 9) turn the set of Dirichlet characters for a given modulus into a finite abelian group.

The group of characters

There are three different cases because the groups

( Z /m Z ) ^{x} have different structures depending on whether m is a power of 2, a power of an odd prime, or the product of prime powers.^[13]

Powers of odd primes

If

q = p ^{k} is an odd number ( Z /q Z ) ^{x} is cyclic of order \phi(q) ; a generator is called a primitive root mod q .^[14] Let g _{q} be a primitive root and for (a,q) =1 define the function \nu _{q(a)} (the index of a ) bya\equiv g ^{\nu _{q(a)}} _{q} \pmod {q}, 0 \le\nu _{q<\phi(q).} For (ab,q) =1 , a \equiv b\pmod{q} if and only if \nu _{q(a)=\nu} _{q(b).} Since\chi(a) = \chi(g ^{\nu _{q(a)}} _{q} ) = \chi(g ^{\nu _{q(a)}} _{q)} ,   \chi is determined by its value at g _{q.}

Let

\omega _{q=} \zeta _{\phi(q)} be a primitive \phi(q) -th root of unity. From property 7) above the possible values of \chi(g _{q)} are\omega _{q,} \omega ^{2 ,} _{q} ... \omega ^{\phi(q)} _{q} =1 . These distinct values give rise to \phi(q) Dirichlet characters mod q. For (r,q) =1 define \chi _{q,r} (a) as\chi _{q,r} (a) = \begin{cases} 0 & if \gcd(a,q)> 1 \\ \omega ^{\nu _{q(r)\nu} _{q(a)}} _{q} & if \gcd(a,q) =1 . \end{cases}

Then for

(rs,q) =1 and all a and b \chi _{q,r} (a)\chi _{q,r} (b) = \chi _{q,r} (ab), showing that \chi _{q,r} is a character and\chi _{q,r} (a)\chi _{q,s} (a) = \chi _{q,rs} (a), which gives an explicit isomorphism \widehat{( Z /p ^{kZ)} ^{x }\cong(Z/p} ^{kZ)} ^{x .}

Examples m = 3, 5, 7, 9

2 is a primitive root mod 3.   (

\phi( 3 ) =2 )2 ^{1\equiv} 2 , 2 ^{2\equiv2} ^{0\equiv} 1 \pmod{ 3 }, so the values of \nu _{3} are\begin{array}{|c|c|c|c|c|c|c|} a & 1 & 2 \\ \hline \nu _{3(a)} & 0 & 1 \\ \end{array} .The nonzero values of the characters mod 3 are\begin{array}{|c|c|c|c|c|c|c|} & 1 & 2 \\ \hline \chi _{3,1} & 1 & 1 \\ \chi _{3,2} & 1 & -1 \\ \end{array}

2 is a primitive root mod 5.   (

\phi( 5 ) =4 )2 ^{1\equiv} 2 , 2 ^{2\equiv} 4 , 2 ^{3\equiv} 3 , 2 ^{4\equiv2} ^{0\equiv} 1 \pmod{ 5 }, so the values of \nu _{5} are\begin{array}{|c|c|c|c|c|c|c|} a & 1 & 2 & 3 & 4 \\ \hline \nu _{5(a)} & 0 & 1 & 3 & 2 \\ \end{array} .The nonzero values of the characters mod 5 are\begin{array}{|c|c|c|c|c|c|c|} & 1 & 2 & 3 & 4 \\ \hline \chi _{5,1} & 1 & 1 & 1 & 1 \\ \chi _{5,2} & 1 & i & - i & -1 \\ \chi _{5,3} & 1 & - i & i & -1 \\ \chi _{5,4} & 1 & -1 & -1 & 1 \\ \end{array}

3 is a primitive root mod 7.   (

\phi( 7 ) =6 )3 ^{1\equiv} 3 , 3 ^{2\equiv} 2 , 3 ^{3\equiv} 6 , 3 ^{4\equiv} 4 , 3 ^{5\equiv} 5 , 3 ^{6\equiv3} ^{0\equiv} 1 \pmod{ 7 }, so the values of \nu _{7} are\begin{array}{|c|c|c|c|c|c|c|} a & 1 & 2 & 3 & 4 & 5 & 6 \\ \hline \nu _{7(a)} & 0 & 2 & 1 & 4 & 5 & 3 \\ \end{array} .The nonzero values of the characters mod 7 are (\omega = \zeta _{6,} \omega ^{3=-1} )\begin{array}{|c|c|c|c|c|c|c|} & 1 & 2 & 3 & 4 & 5 & 6 \\ \hline \chi _{7,1} & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{7,2} & 1 & - \omega & \omega ^{2} & \omega ^{2} & - \omega & 1 \\ \chi _{7,3} & 1 & \omega ^{2} & \omega & - \omega & - \omega ^{2} & -1 \\ \chi _{7,4} & 1 & \omega ^{2} & - \omega & - \omega & \omega ^{2} & 1 \\ \chi _{7,5} & 1 & - \omega & - \omega ^{2} & \omega ^{2} & \omega & -1 \\ \chi _{7,6} & 1 & 1 & -1 & 1 & -1 & -1 \\ \end{array} .

2 is a primitive root mod 9.   (

\phi( 9 ) =6 )2 ^{1\equiv} 2 , 2 ^{2\equiv} 4 , 2 ^{3\equiv} 8 , 2 ^{4\equiv} 7 , 2 ^{5\equiv} 5 , 2 ^{6\equiv2} ^{0\equiv} 1 \pmod{ 9 }, so the values of \nu _{9} are\begin{array}{|c|c|c|c|c|c|c|} a & 1 & 2 & 4 & 5 & 7 & 8 \\ \hline \nu _{9(a)} & 0 & 1 & 2 & 5 & 4 & 3 \\ \end{array} .The nonzero values of the characters mod 9 are (\omega = \zeta _{6,} \omega ^{3=-1} )\begin{array}{|c|c|c|c|c|c|c|} & 1 & 2 & 4 & 5 & 7 & 8 \\ \hline \chi _{9,1} & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{9,2} & 1 & \omega & \omega ^{2} & - \omega ^{2} & - \omega & -1 \\ \chi _{9,4} & 1 & \omega ^{2} & - \omega & - \omega & \omega ^{2} & 1 \\ \chi _{9,5} & 1 & - \omega ^{2} & - \omega & \omega & \omega ^{2} & -1 \\ \chi _{9,7} & 1 & - \omega & \omega ^{2} & \omega ^{2} & - \omega & 1 \\ \chi _{9,8} & 1 & -1 & 1 & -1 & 1 & -1 \\ \end{array} .

Powers of 2

( Z / 2 Z ) ^{x} is the trivial group with one element. ( Z / 4 Z ) ^{x} is cyclic of order 2. For 8, 16, and higher powers of 2, there is no primitive root; the powers of 5 are the units \equiv 1 \pmod{ 4 } and their negatives are the units \equiv 3 \pmod{ 4 }. ^[15] For example5 ^{1\equiv} 5 , 5 ^{2\equiv5} ^{0\equiv} 1 \pmod{ 8 } 5 ^{1\equiv} 5 , 5 ^{2\equiv} 9 , 5 ^{3\equiv} 13 , 5 ^{4\equiv5} ^{0\equiv} 1 \pmod{ 16 } 5 ^{1\equiv} 5 , 5 ^{2\equiv} 25 , 5 ^{3\equiv} 29 , 5 ^{4\equiv} 17 , 5 ^{5\equiv} 21 , 5 ^{6\equiv} 9 , 5 ^{7\equiv} 13 , 5 ^{8\equiv5} ^{0\equiv} 1 \pmod{ 32 }. Let q =2 ^{k,} k\ge 3 ; then ( Z /q Z ) ^{x} is the direct product of a cyclic group of order 2 (generated by −1) and a cyclic group of order (\phi(q))/(2) (generated by 5).For odd numbers a define the functions \nu _{0} and \nu _{q} bya\equiv( -1 ) ^{\nu _{0(a)}} 5 ^{\nu _{q(a)}} \pmod{q}, 0 \le\nu _{0<2, 0\le\nu} ^{q< (\phi(q))/(2)} . For odd a and b, a\equiv b\pmod{q} if and only if \nu _{0(a)=\nu} _{0(b)} and \nu _{q(a)=\nu} _{q(b).} For odd a the value of \chi(a) is determined by the values of \chi( -1 ) and \chi( 5 ).

Let

\omega _{q} = \zeta _{(\phi(q))/(2)} be a primitive (\phi(q))/(2) -th root of unity. The possible values of \chi(( -1 ) ^{\nu _{0(a)}} 5 ^{\nu _{q(a)}} ) are\pm\omega _{q,} \pm\omega ^{2 ,} _{q} ... \pm\omega ^{(\phi(q))/(2)} _{q} = \pm 1 . These distinct values give rise to \phi(q) Dirichlet characters mod q. For odd r define \chi _{q,r} (a) by\chi _{q,r} (a) = \begin{cases} 0 & if a iseven \\ ( -1 ) ^{\nu _{0(r)\nu} _{0(a)}} \omega ^{\nu _{q(r)\nu} _{q(a)}} _{q} & if a isodd . \end{cases} Then for odd r and s and all a and b \chi _{q,r} (a)\chi _{q,r} (b) = \chi _{q,r} (ab) showing that \chi _{q,r} is a character and\chi _{q,r} (a)\chi _{q,s} (a) = \chi _{q,rs} (a) showing that \widehat{( Z / 2 ^{k} Z ) ^{x }\cong} ( Z / 2 ^{k} Z ) ^{x .}

Examples m = 2, 4, 8, 16

The only character mod 2 is the principal character

\chi _{2,1} .

−1 is a primitive root mod 4 (

\phi( 4 ) =2 )\begin{array}{|||} a & 1 & 3 \\ \hline \nu _{0(a)} & 0 & 1 \\ \end{array}

The nonzero values of the characters mod 4 are

\begin{array}{|c|c|c|c|c|c|c|} & 1 & 3 \\ \hline \chi _{4,1} & 1 & 1 \\ \chi _{4,3} & 1 & -1 \\ \end{array}

−1 is and 5 generate the units mod 8 (

\phi( 8 ) =4 )\begin{array}{|||} a & 1 & 3 & 5 & 7 \\ \hline \nu _{0(a)} & 0 & 1 & 0 & 1 \\ \nu _{8(a)} & 0 & 1 & 1 & 0 \\ \end{array} .

The nonzero values of the characters mod 8 are

\begin{array}{|c|c|c|c|c|c|c|} & 1 & 3 & 5 & 7 \\ \hline \chi _{8,1} & 1 & 1 & 1 & 1 \\ \chi _{8,3} & 1 & 1 & -1 & -1 \\ \chi _{8,5} & 1 & -1 & -1 & 1 \\ \chi _{8,7} & 1 & -1 & 1 & -1 \\ \end{array}

−1 and 5 generate the units mod 16 (

\phi( 16 ) =8 )\begin{array}{|||} a & 1 & 3 & 5 & 7 & 9 & 11 & 13 & 15 \\ \hline \nu _{0(a)} & 0 & 1 & 0 & 1 & 0 & 1 & 0 & 1 \\ \nu _{16} (a) & 0 & 3 & 1 & 2 & 2 & 1 & 3 & 0 \\ \end{array} .

The nonzero values of the characters mod 16 are

\begin{array}{|||} & 1 & 3 & 5 & 7 & 9 & 11 & 13 & 15 \\ \hline \chi _{16,1} & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{16,3} & 1 & - i & - i & 1 & -1 & i & i & -1 \\ \chi _{16,5} & 1 & - i & i & -1 & -1 & i & - i & 1 \\ \chi _{16,7} & 1 & 1 & -1 & -1 & 1 & 1 & -1 & -1 \\ \chi _{16,9} & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 \\ \chi _{16,11} & 1 & i & i & 1 & -1 & - i & - i & -1 \\ \chi _{16,13} & 1 & i & - i & -1 & -1 & - i & i & 1 \\ \chi _{16,15} & 1 & -1 & 1 & -1 & 1 & -1 & 1 & -1 \\ \end{array} .

Products of prime powers

Let

m = p ^{m _{1}} _{1} p ^{m _{2}} _{2} … p ^{m _{k}} _{k} = q _{1q} _{2} … q _{k} where p _{1<p} _{2<} ... < p _{k} be the factorization of m into prime powers. The group of units mod m is isomorphic to the direct product of the groups mod the q _{i} :^[16] ( Z /m Z ) ^{x} \cong( Z /q ^{x} _{1 Z )} x ( Z /q ^{x} _{2 Z )} x ... x ( Z /q ^{x} _{k Z )} . This means that 1) there is a one-to-one correspondence between a\in ( Z /m Z ) ^{x} and k -tuples (a _{1,} a _{2,...,} a _{k)} where a _{i\in(Z/q} ^{x} ^{i Z )} and 2) multiplication mod m corresponds to coordinate-wise multiplication of k -tuples: ab\equiv c\pmod{m} corresponds to (a _{1,a} _{2,...,a} _{k) x (b} _{1,b} _{2,...,b} _{k)=(c} _{1,c} _{2,...,c} _{k)} where c _{i\equiv} a _{ib} _{i\pmod{q} _{i}.}

The Chinese remainder theorem (CRT) implies that the

a _{i} are simply a _{i\equiv} a\pmod{q _{i}.}

There are subgroups

G ^{x} _{i<( Z /m Z )} such that ^[17] G _{i\cong(Z/q} ^{x} ^{i Z )} andG _{i\equiv \begin{cases} (Z/q} ^{x} ^{i Z )} &\mod q _{i\\ \{1\}&\mod} q _{j,} j\ne i. \end{cases}

Then

( Z /m Z ) ^{x} \cong G _{1 x} G _{2 x ... x} G _{k} and every a\in ( Z /m Z ) ^{x} corresponds to a k -tuple (a _{1,} a _{2,...a} _{k)} where a _{i\in} G _{i} and a _{i\equiv} a\pmod{q _{i}.} Every a\in ( Z /m Z ) ^{x} can be uniquely factored as a = a _{1a} _{2...a} _{k.} ^{[18] [19]}

If

\chi _{m,\} is a character mod m, on the subgroup G _{i} it must be identical to some \chi _{q _{i,\}} mod q _{i} Then\chi _{m,\} (a) = \chi _{m,\} (a _{1a} _{2...)=\chi} ^{m,\} (a _{1)\chi} ^{m,\} (a _{2)...=\chi} ^{q _{1,\}} (a _{1)\chi} ^{a _{2,\}} (a _{2)...,} showing that every character mod m is the product of characters mod the q _{i} .

For

(t,m) =1 define^[20] \chi _{m,t} = \chi _{q _{1,t}} \chi _{q _{2,t}} ... Then for (rs,m) =1 and all a and b ^[21] \chi _{m,r} (a)\chi _{m,r} (b) = \chi _{m,r} (ab), showing that \chi _{m,r} is a character and\chi _{m,r} (a)\chi _{m,s} (a) = \chi _{m,rs} (a), showing an isomorphism \widehat{( Z /m Z ) ^{x }\cong(Z/mZ)} ^{x .}

Examples m = 15, 24, 40

( Z / 15 Z ) ^{x \cong(Z/3Z)} ^{x x (Z/5Z)} ^{x .}

The factorization of the characters mod 15 is

\begin{array}{|c|c|c|c|c|c|c|} & \chi _{5,1} & \chi _{5,2} & \chi _{5,3} & \chi _{5,4} \\ \hline \chi _{3,1} & \chi _{15,1} & \chi _{15,7} & \chi _{15,13} & \chi _{15,4} \\ \chi _{3,2} & \chi _{15,11} & \chi _{15,2} & \chi _{15,8} & \chi _{15,14} \\ \end{array} The nonzero values of the characters mod 15 are\begin{array}{|||} & 1 & 2 & 4 & 7 & 8 & 11 & 13 & 14 \\ \hline \chi _{15,1} & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{15,2} & 1 & - i & -1 & i & i & -1 & - i & 1 \\ \chi _{15,4} & 1 & -1 & 1 & -1 & -1 & 1 & -1 & 1 \\ \chi _{15,7} & 1 & i & -1 & i & - i & 1 & - i & -1 \\ \chi _{15,8} & 1 & i & -1 & - i & - i & -1 & i & 1 \\ \chi _{15,11} & 1 & -1 & 1 & 1 & -1 & -1 & 1 & -1 \\ \chi _{15,13} & 1 & - i & -1 & - i & i & 1 & i & -1 \\ \chi _{15,14} & 1 & 1 & 1 & -1 & 1 & -1 & -1 & -1 \\ \end{array} .( Z / 24 Z ) ^{x \cong(Z/8Z)} ^{x x (Z/3Z)} ^{x .} The factorization of the characters mod 24 is\begin{array}{|c|c|c|c|c|c|c|} & \chi _{8,1} & \chi _{8,3} & \chi _{8,5} & \chi _{8,7} \\ \hline \chi _{3,1} & \chi _{24,1} & \chi _{24,19} & \chi _{24,13} & \chi _{24,7} \\ \chi _{3,2} & \chi _{24,17} & \chi _{24,11} & \chi _{24,5} & \chi _{24,23} \\ \end{array}

The nonzero values of the characters mod 24 are

\begin{array}{|||} & 1 & 5 & 7 & 11 & 13 & 17 & 19 & 23 \\ \hline \chi _{24,1} & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{24,5} & 1 & 1 & 1 & 1 & -1 & -1 & -1 & -1 \\ \chi _{24,7} & 1 & 1 & -1 & -1 & 1 & 1 & -1 & -1 \\ \chi _{24,11} & 1 & 1 & -1 & -1 & -1 & -1 & 1 & 1 \\ \chi _{24,13} & 1 & -1 & 1 & -1 & -1 & 1 & -1 & 1 \\ \chi _{24,17} & 1 & -1 & 1 & -1 & 1 & -1 & 1 & -1 \\ \chi _{24,19} & 1 & -1 & -1 & 1 & -1 & 1 & 1 & -1 \\ \chi _{24,23} & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 \\ \end{array} .( Z / 40 Z ) ^{x \cong(Z/8Z)} ^{x x (Z/5Z)} ^{x .} The factorization of the characters mod 40 is\begin{array}{|c|c|c|c|c|c|c|} & \chi _{8,1} & \chi _{8,3} & \chi _{8,5} & \chi _{8,7} \\ \hline \chi _{5,1} & \chi _{40,1} & \chi _{40,11} & \chi _{40,21} & \chi _{40,31} \\ \chi _{5,2} & \chi _{40,17} & \chi _{40,27} & \chi _{40,37} & \chi _{40,7} \\ \chi _{5,3} & \chi _{40,33} & \chi _{40,3} & \chi _{40,13} & \chi _{40,23} \\ \chi _{5,4} & \chi _{40,9} & \chi _{40,19} & \chi _{40,29} & \chi _{40,39} \\ \end{array}

The nonzero values of the characters mod 40 are

\begin{array}{|||} & 1 & 3 & 7 & 9 & 11 & 13 & 17 & 19 & 21 & 23 & 27 & 29 & 31 & 33 & 37 & 39 \\ \hline \chi _{40,1} & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 & 1 \\ \chi _{40,3} & 1 & i & i & -1 & 1 & - i & - i & -1 & -1 & - i & - i & 1 & -1 & i & i & 1 \\ \chi _{40,7} & 1 & i & - i & -1 & -1 & - i & i & 1 & 1 & i & - i & -1 & -1 & - i & i & 1 \\ \chi _{40,9} & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 \\ \chi _{40,11} & 1 & 1 & -1 & 1 & 1 & -1 & 1 & 1 & -1 & -1 & 1 & -1 & -1 & 1 & -1 & -1 \\ \chi _{40,13} & 1 & - i & - i & -1 & -1 & - i & - i & 1 & -1 & i & i & 1 & 1 & i & i & -1 \\ \chi _{40,17} & 1 & - i & i & -1 & 1 & - i & i & -1 & 1 & - i & i & -1 & 1 & - i & i & -1 \\ \chi _{40,19} & 1 & -1 & 1 & 1 & 1 & 1 & -1 & 1 & -1 & 1 & -1 & -1 & -1 & -1 & 1 & -1 \\ \chi _{40,21} & 1 & -1 & 1 & 1 & -1 & -1 & 1 & -1 & -1 & 1 & -1 & -1 & 1 & 1 & -1 & 1 \\ \chi _{40,23} & 1 & - i & i & -1 & -1 & i & - i & 1 & 1 & - i & i & -1 & -1 & i & - i & 1 \\ \chi _{40,27} & 1 & - i & - i & -1 & 1 & i & i & -1 & -1 & i & i & 1 & -1 & - i & - i & 1 \\ \chi _{40,29} & 1 & 1 & -1 & 1 & -1 & 1 & -1 & -1 & -1 & -1 & 1 & -1 & 1 & -1 & 1 & 1 \\ \chi _{40,31} & 1 & -1 & -1 & 1 & -1 & 1 & 1 & -1 & 1 & -1 & -1 & 1 & -1 & 1 & 1 & -1 \\ \chi _{40,33} & 1 & i & - i & -1 & 1 & i & - i & -1 & 1 & i & - i & -1 & 1 & i & - i & -1 \\ \chi _{40,37} & 1 & i & i & -1 & -1 & i & i & 1 & -1 & - i & - i & 1 & 1 & - i & - i & -1 \\ \chi _{40,39} & 1 & 1 & 1 & 1 & -1 & -1 & -1 & -1 & 1 & 1 & 1 & 1 & -1 & -1 & -1 & -1 \\ \end{array} .

Summary

Let

m = p ^{k _{1}} _{1} p ^{k _{2}} _{2} … = q _{1q} _{2} … , p _{1<p} _{2<} ... be the factorization of m and assume (rs,m) =1 .

There are

\phi(m) Dirichlet characters mod m. They are denoted by \chi _{m,r} , where \chi _{m,r} = \chi _{m,s} is equivalent to r\equiv s\pmod{m}. The identity \chi _{m,r} (a)\chi _{m,s} (a) = \chi _{m,rs} (a) is an isomorphism \widehat{( Z /m Z ) ^{x }\cong(Z/mZ)} ^{x .} ^[22]

Each character mod

m has a unique factorization as the product of characters mod the prime powers dividing m :\chi _{m,r} = \chi _{q _{1,r}} \chi _{q _{2,r}} ...

If

m = m _{1m} _{2,} (m _{1,m} _{2)=1} the product \chi _{m _{1,r}} \chi _{m _{2,s}} is a character \chi _{m,t} where t is given by t\equiv r\pmod{m _{1}} and t\equiv s\pmod{m _{2}.}

Also,^{[23] [24]}

\chi _{m,r} (s) = \chi _{m,s} (r)

Orthogonality

The two orthogonality relations are^[25]

\sum _{a\in( Z /m Z ) ^{x}} \chi(a) = \begin{cases} \phi(m)& if \chi = \chi _{0\\ 0&if \chi\ne\chi} _{0 \end{cases}}     and     \sum _{\chi\in\widehat{( Z /m Z ) ^{x}} }\chi(a)=\begin\phi(m)&\text\;a\equiv 1\pmod\\0&\text\;a\not\equiv 1\pmod.\end

The relations can be written in the symmetric form

\sum _{a\in( Z /m Z ) ^{x}} \chi _{m,r} (a) = \begin{cases} \phi(m)& if r\equiv 1 \\ 0 & if r\not\equiv 1 \end{cases}     and     \sum _{r\in( Z /m Z ) ^{x}} \chi _{m,r} (a) = \begin{cases} \phi(m)& if a\equiv 1 \\ 0 & if a\not\equiv 1 . \end{cases}

The first relation is easy to prove: If

\chi = \chi _{0} there are \phi(m) non-zero summands each equal to 1. If \chi\ne\chi _{0} there is^[26] some a ^{*,} (a ^{*,m)=1, \chi(a} ^{*)\ne1.}  Then\chi(a ^{*)\sum} _{a\in( Z /m Z ) ^{x}} \chi(a) = \sum _{a} \chi(a ^{*)} \chi(a) = \sum _{a} \chi(a ^{*a) = \sum} _{a} \chi(a), ^[27]   implying(\chi(a ^{*) -1 )\sum} _{a} \chi(a) =0 .   Dividing by the first factor gives \sum _{a} \chi(a) =0 , QED. The identity \chi _{m,r} (s) = \chi _{m,s} (r) for (rs,m) =1 shows that the relations are equivalent to each other.

The second relation can be proven directly in the same way, but requires a lemma^[28]

Given

a \not\equiv 1 \pmod{m}, (a,m) =1 , there is a \chi ^{*,} \chi ^{*(a)\ne1.}

The second relation has an important corollary: if

(a,m) =1 , define the functionf _{a(n) = (1)/(\phi(m))} \sum _{\chi} \bar{\chi}(a) \chi(n).   Thenf _{a(n) =} (1)/(\phi(m)) \sum _{\chi} \chi(a ^{-1} ) \chi(n) = (1)/(\phi(m)) \sum _{\chi} \chi(a ^{-1} n) = \begin{cases} 1 , & n \equiv a \pmod{m} \ 0 , & n\not\equiv a\pmod{m},\end{cases} That is f _{a=1} _{[a]} the indicator function of the residue class [a] = \{ x: x\equiv a \pmod{m}\} . It is basic in the proof of Dirichlet's theorem.^{[29] [30]}

Classification of characters

Conductor; Primitive and induced characters

Any character mod a prime power is also a character mod every larger power. For example, mod 16^[31]

\begin{array}{|||} & 1 & 3 & 5 & 7 & 9 & 11 & 13 & 15 \\ \hline \chi _{16,3} & 1 & - i & - i & 1 & -1 & i & i & -1 \\ \chi _{16,9} & 1 & -1 & -1 & 1 & 1 & -1 & -1 & 1 \\ \chi _{16,15} & 1 & -1 & 1 & -1 & 1 & -1 & 1 & -1 \\ \end{array} \chi _{16,3} has period 16, but \chi _{16,9} has period 8 and \chi _{16,15} has period 4:   \chi _{16,9} = \chi _{8,5} and  \chi _{16,15} = \chi _{8,7} = \chi _{4,3} .

We say that a character

\chi of modulus q has a quasiperiod of d if \chi(m) = \chi(n) for all m , n coprime to q satisfying m\equiv n mod d .^[32] For example, \chi _{2,1} , the only Dirichlet character of modulus 2 , has a quasiperiod of 1 , but not a period of 1 (it has a period of 2 , though). The smallest positive integer for which \chi is quasiperiodic is the conductor of \chi .^[33] So, for instance, \chi _{2,1} has a conductor of 1 .

The conductor of

\chi _{16,3} is 16, the conductor of \chi _{16,9} is 8 and that of \chi _{16,15} and \chi _{8,7} is 4. If the modulus and conductor are equal the character is primitive, otherwise imprimitive. An imprimitive character is induced by the character for the smallest modulus: \chi _{16,9} is induced from \chi _{8,5} and \chi _{16,15} and \chi _{8,7} are induced from \chi _{4,3} .

A related phenomenon can happen with a character mod the product of primes; its nonzero values may be periodic with a smaller period.

For example, mod 15,

\begin{array}{|||} & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 \\ \hline \chi _{15,8} & 1 & i & 0 & -1 & 0 & 0 & - i & - i & 0 & 0 & -1 & 0 & i & 1 & 0 \\ \chi _{15,11} & 1 & -1 & 0 & 1 & 0 & 0 & 1 & -1 & 0 & 0 & -1 & 0 & 1 & -1 & 0 \\ \chi _{15,13} & 1 & - i & 0 & -1 & 0 & 0 & - i & i & 0 & 0 & 1 & 0 & i & -1 & 0 \\ \end{array} .

The nonzero values of

\chi _{15,8} have period 15, but those of \chi _{15,11} have period 3 and those of \chi _{15,13} have period 5. This is easier to see by juxtaposing them with characters mod 3 and 5:\begin{array}{|||} & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & 9 & 10 & 11 & 12 & 13 & 14 & 15 \\ \hline \chi _{15,11} & 1 & -1 & 0 & 1 & 0 & 0 & 1 & -1 & 0 & 0 & -1 & 0 & 1 & -1 & 0 \\ \chi _{3,2} & 1 & -1 & 0 & 1 & -1 & 0 & 1 & -1 & 0 & 1 & -1 & 0 & 1 & -1 & 0 \\ \hline \chi _{15,13} & 1 & - i & 0 & -1 & 0 & 0 & - i & i & 0 & 0 & 1 & 0 & i & -1 & 0 \\ \chi _{5,3} & 1 & - i & i & -1 & 0 & 1 & - i & i & -1 & 0 & 1 & - i & i & -1 & 0 \\ \end{array} .

If a character mod

m = qr, (q,r) =1 , q> 1 , r> 1 is defined as\chi _{m,\} (a) = \begin{cases} 0 & if \gcd(a,m)> 1 \\ \chi _{q,\} (a)& if \gcd(a,m) =1 \end{cases} ,   or equivalently as \chi _{m,\} = \chi _{q,\} \chi _{r,1} , its nonzero values are determined by the character mod q and have period q .

The smallest period of the nonzero values is the conductor of the character. For example, the conductor of

\chi _{15,8} is 15, the conductor of \chi _{15,11} is 3, and that of \chi _{15,13} is 5.

As in the prime-power case, if the conductor equals the modulus the character is primitive, otherwise imprimitive. If imprimitive it is induced from the character with the smaller modulus. For example,

\chi _{15,11} is induced from \chi _{3,2} and \chi _{15,13} is induced from \chi _{5,3}

The principal character is not primitive.^[34]

The character

\chi _{m,r} = \chi _{q _{1,r}} \chi _{q _{2,r}} ... is primitive if and only if each of the factors is primitive.^[35]

Primitive characters often simplify (or make possible) formulas in the theories of L-functions^[36] and modular forms.

Parity

\chi(a) is even if \chi( -1 ) =1 and is odd if \chi( -1 ) =-1 .

This distinction appears in the functional equation of the Dirichlet L-function.

Order

\widehat{( Z /m Z ) ^{x }} , i.e. the smallest positive integer n such that \chi ^{n=} \chi _{0.} Because of the isomorphism \widehat{( Z /m Z ) ^{x }\cong(Z/mZ)} ^{x} the order of \chi _{m,r} is the same as the order of r in ( Z /m Z ) ^{x .} The principal character has order 1; other real characters have order 2, and imaginary characters have order 3 or greater. By Lagrange's theorem the order of a character divides the order of \widehat{( Z /m Z ) ^{x }} which is \phi(m)

Real characters

\chi(a) is real or quadratic if all of its values are real (they must be 0 , \pm 1 ); otherwise it is complex or imaginary.\chi is real if and only if \chi ^{2= \chi} _{0} ; \chi _{m,k} is real if and only if k ^{2\equiv1\pmod{m}} ; in particular, \chi _{m,-1} is real and non-principal.^[37]

Dirichlet's original proof that

L( 1 ,\chi)\ne 0 (which was only valid for prime moduli) took two different forms depending on whether \chi was real or not. His later proof, valid for all moduli, was based on his class number formula.^{[38] [39]}

Real characters are Kronecker symbols;^[40] for example, the principal character can be written^[41]

\chi _{m,1} = \left( (m ^{2})/(\bullet) \right) .

The real characters in the examples are:

Principal

If

m = p ^{k _{1}} _{1} p ^{k _{2}} _{2} ..., p _{1<p} _{2< ...} the principal character is^[42] \chi _{m,1} = \left( (p ^{2 ...} _{2})/(\bullet) \right). \chi _{16,1} = \chi _{8,1} = \chi _{4,1} = \chi _{2,1} = \left( (4)/(\bullet) \right)  \chi _{9,1} = \chi _{3,1} = \left( (9)/(\bullet) \right)  \chi _{5,1} = \left( (25)/(\bullet) \right)  \chi _{7,1} = \left( (49)/(\bullet) \right)  \chi _{15,1} = \left( (225)/(\bullet) \right)  \chi _{24,1} = \left( (36)/(\bullet) \right)  \chi _{40,1} = \left( (100)/(\bullet) \right)  

Primitive

If the modulus is the absolute value of a fundamental discriminant there is a real primitive character (there are two if the modulus is a multiple of 8); otherwise if there are any primitive characters they are imaginary.^[43]

\chi _{3,2} = \left( (-3)/(\bullet) \right)  \chi _{4,3} = \left( (-4)/(\bullet) \right)  \chi _{5,4} = \left( (5)/(\bullet) \right)  \chi _{7,6} = \left( (-7)/(\bullet) \right)  \chi _{8,3} = \left( (-8)/(\bullet) \right)  \chi _{8,5} = \left( (8)/(\bullet) \right)  \chi _{15,14} = \left( (-15)/(\bullet) \right)  \chi _{24,5} = \left( (-24)/(\bullet) \right)  \chi _{24,11} = \left( (24)/(\bullet) \right)  \chi _{40,19} = \left( (-40)/(\bullet) \right)  \chi _{40,29} = \left( (40)/(\bullet) \right)

Imprimitive

\chi _{8,7} = \chi _{4,3} = \left( (-4)/(\bullet) \right)  \chi _{9,8} = \chi _{3,2} = \left( (-3)/(\bullet) \right)  \chi _{15,4} = \chi _{5,4} \chi _{3,1} = \left( (45)/(\bullet) \right)  \chi _{15,11} = \chi _{3,2} \chi _{5,1} = \left( (-75)/(\bullet) \right)  \chi _{16,7} = \chi _{8,3} = \left( (-8)/(\bullet) \right)  \chi _{16,9} = \chi _{8,5} = \left( (8)/(\bullet) \right)  \chi _{16,15} = \chi _{4,3} = \left( (-4)/(\bullet) \right)  \chi _{24,7} = \chi _{8,7} \chi _{3,1} = \chi _{4,3} \chi _{3,1} = \left( (-36)/(\bullet) \right)  \chi _{24,13} = \chi _{8,5} \chi _{3,1} = \left( (72)/(\bullet) \right)  \chi _{24,17} = \chi _{3,2} \chi _{8,1} = \left( (-12)/(\bullet) \right)  \chi _{24,19} = \chi _{8,3} \chi _{3,1} = \left( (-72)/(\bullet) \right)  \chi _{24,23} = \chi _{8,7} \chi _{3,2} = \chi _{4,3} \chi _{3,2} = \left( (12)/(\bullet) \right)  \chi _{40,9} = \chi _{5,4} \chi _{8,1} = \left( (20)/(\bullet) \right)  \chi _{40,11} = \chi _{8,3} \chi _{5,1} = \left( (-200)/(\bullet) \right)  \chi _{40,21} = \chi _{8,5} \chi _{5,1} = \left( (200)/(\bullet) \right)  \chi _{40,31} = \chi _{8,7} \chi _{5,1} = \chi _{4,3} \chi _{5,1} = \left( (-100)/(\bullet) \right)  \chi _{40,39} = \chi _{8,7} \chi _{5,4} = \chi _{4,3} \chi _{5,4} = \left( (-20)/(\bullet) \right)  

Applications

L-functions

See main article: Dirichlet L-function.

The Dirichlet L-series for a character

\chi isL(s,\chi) = \sum ^{inf ty} _{n =1} (\chi(n))/(n ^{s}) .

This series only converges for

ak{R}s > 1 ; it can be analytically continued to a meromorphic function

Dirichlet introduced the

L -function along with the characters in his 1837 paper.

Modular forms and functions

See main article: Modular form. Dirichlet characters appear several places in the theory of modular forms and functions. A typical example is^[44]

Let

\chi\in\widehat{( Z /M Z ) ^{x }} and let \chi ^{x }} _{1 \in\widehat{( Z /N Z )} be primitive.

If

f(z) = \sum a ^{n\in} _{nq} M _{k(M,\chi)} ^[45] definef _{\chi _{1}} (z) = \sum\chi _{1(n)a} ^{n} ^{nz} ,^[46]  Thenf _{\chi _{1}} (z)\in M ^{2 )} _{1} . If f is a cusp form so is f _{\chi _{1}} . See theta series of a Dirichlet character for another example.

Gauss sum

See main article: Gauss sum.

The Gauss sum of a Dirichlet character modulo is

G(\chi) = \sum ^{N\chi(a)e} _{a =1} ^{(2 \pi ia)/(N)} . It appears in the functional equation of the Dirichlet L-function.

Jacobi sum

See main article: Jacobi sum.

If

\chi and \psi are Dirichlet characters mod a prime p their Jacobi sum isJ(\chi,\psi) = \sum ^{p -1} _{a =2} \chi(a) \psi( 1 - a). Jacobi sums can be factored into products of Gauss sums.

Kloosterman sum

See main article: Kloosterman sum.

If

\chi is a Dirichlet character mod q and \zeta = e ^{(2 \pi i)/(q)} the Kloosterman sum K(a,b,\chi) is defined as^[47] K(a,b,\chi) = \sum _{r\in ( Z /q Z ) ^{x}} \chi(r)\zeta ^{ar + (b)/(r)} .

If

b =0 it is a Gauss sum.

Sufficient conditions

It is not necessary to establish the defining properties 1) – 3) to show that a function is a Dirichlet character.

From Davenport's book

If

\Chi: Z → C such that

1)  

\Chi(ab) = \Chi(a)\Chi(b),

2)  

\Chi(a + m) = \Chi(a) ,

3)   If

\gcd(a,m)> 1 then \Chi(a) =0 , but

4)  

\Chi(a) is not always 0,then \Chi(a) is one of the \phi(m) characters mod m ^[48]

Sárközy's Condition

A Dirichlet character is a completely multiplicative function

f: N → C that satisfies a linear recurrence relation: that is, if a _{1} f(n + b _{1)} + … + a _{kf(n+b} _{k)} = 0

for all positive integer

n , where a _{1,\ldots,a} _{k} are not all zero and b _{1,\ldots,b} _{k} are distinct then f is a Dirichlet character.^[49]

Chudakov's Condition

A Dirichlet character is a completely multiplicative function

f: N → C satisfying the following three properties: a) f takes only finitely many values; b) f vanishes at only finitely many primes; c) there is an \alpha \in C for which the remainder\left|\sum _{n} f(n) - \alpha x\right|

is uniformly bounded, as

x → inf ty . This equivalent definition of Dirichlet characters was conjectured by Chudakov^[50] in 1956, and proved in 2017 by Klurman and Mangerel.^[51]

See also

• Character sum
• Multiplicative group of integers modulo n
• Primitive root modulo n
• Multiplicative character

References

• Chudakov. N.G.. Theory of the characters of number semigroups. J. Indian Math. Soc.. 20. 11–15.
• Book: Davenport, Harold . Harold Davenport. Multiplicative number theory . Markham . Lectures in advanced mathematics . 1 . Chicago . 1967 . 0159.06303 .
  • Klurman. Oleksiy. Mangerel. Alexander P.. Rigidity Theorems for Multiplicative Functions. Math. Ann.. 372. 1. 651–697. 10.1007/s00208-018-1724-6. 2017arXiv170707817K. 2017. 1707.07817. 119597384.
• Book: Koblitz , Neal . Neal Koblitz. Introduction to Elliptic Curves and Modular Forms. 2nd revised. Graduate Texts in Mathematics. 97. Springer-Verlag. 1993. 0-387-97966-2.
  • Sarkozy. Andras. On multiplicative arithmetic functions satisfying a linear recursion. Studia Sci. Math. Hung.. 13. 1–2. 79–104.

External links

• English translation of Dirichlet's 1837 paper on primes in arithmetic progressions
• LMFDB Lists 30,397,486 Dirichlet characters of modulus up to 10,000 and their L-functions

Notes and References

1. This is the standard definition; e.g. Davenport p.27; Landau p. 109; Ireland and Rosen p. 253
2. Note the special case of modulus 1: the unique character mod 1 is the constant 1; all other characters are 0 at 0
3. Davenport p. 1
4. An English translation is in External Links
5. Used in Davenport, Landau, Ireland and Rosen
6. (rs,m) =1 is equivalent to \gcd(r,m) = \gcd(s,m) =1
7. See Multiplicative character
8. Ireland and Rosen p. 253-254
9. See Character group#Orthogonality of characters
10. Davenport p. 27
11. These properties are derived in all introductions to the subject, e.g. Davenport p. 27, Landau p. 109.
12. In general, the product of a character mod m and a character mod n is a character mod \operatorname{lcm}(m,n)
13. Except for the use of the modified Conrie labeling, this section follows Davenport pp. 1-3, 27-30
14. There is a primitive root mod p which is a primitive root mod p ^{2} and all higher powers of p . See, e.g., Landau p. 106
15. Landau pp. 107-108
16. See group of units for details
17. To construct the G _{i,} for each a\in ( Z /q ^{x} _{i Z )} use the CRT to find a _{i\in} ( Z /m Z ) ^{x} wherea _{i\equiv} \begin{cases} a &\mod q _{i\\ 1&\mod} q _{j,} j\ne i. \end{cases}
18. Assume a corresponds to (a _{1,a} _{2,} ...) . By construction a _{1} corresponds to (a _{1,1,1,...)} , a _{2} to ( 1 ,a _{2,1,...)} etc. whose coordinate-wise product is (a _{1,a} _{2,} ...).
19. For example let m =40 , q _{1=8,} q _{2=5.} Then G _{1=\{1,11,21,31\}} and G _{2=\{1,9,17,33\}.} The factorization of the elements of ( Z / 40 Z ) ^{x} is \begin{array}{|c|c|c|c|c|c|c|} & 1 & 9 & 17 & 33 \\ \hline 1 & 1 & 9 & 17 & 33 \\ 11 & 11 & 19 & 27 & 3 \\ 21 & 21 & 29 & 37 & 13 \\ 31 & 31 & 39 & 7 & 23 \\ \end{array}
20. See Conrey labeling.
21. Because these formulas are true for each factor.
22. This is true for all finite abelian groups: A\cong\hat{A} ; See Ireland & Rosen pp. 253-254
23. because the formulas for \chi mod prime powers are symmetric in r and s and the formula for products preserves this symmetry. See Davenport, p. 29.
24. This is the same thing as saying that the n-th column and the n-th row in the tables of nonzero values are the same.
25. See
    1. Relation to group characters
    above.
26. by the definition of \chi _{0}
27. because multiplying every element in a group by a constant element merely permutes the elements. See Group (mathematics)
28. Davenport p. 30 (paraphrase) To prove [the second relation] one has to use ideas that we have used in the construction [as in this article or Landau pp. 109-114], or appeal to the basis theorem for abelian groups [as in Ireland & Rosen pp. 253-254]
29. Davenport chs. 1, 4; Landau p. 114
30. Note that if g:( Z /m Z ) ^{x → C} is any functiong(n) = \sum _{a\in( Z /m Z ) ^{x}} g(a)f _{a(n)}

    see Fourier transform on finite groups#Fourier transform for finite abelian groups

31. This section follows Davenport pp. 35-36,
32. Web site: Platt . Dave . Dirichlet characters Def. 11.10. . April 5, 2024.
33. Web site: Conductor of a Dirichlet character (reviewed) . LMFDB . April 5, 2024.
34. Davenport classifies it as neither primitive nor imprimitive; the LMFDB induces it from \chi _{1,1} .
35. Note that if m is two times an odd number, m =2 r , all characters mod m are imprimitive because \chi _{m,\} = \chi _{r,\} \chi _{2,1}
36. For example the functional equation of L(s,\chi) is only valid for primitive \chi . See Davenport, p. 85
37. In fact, for prime modulus p \chi _{p,-1} is the Legendre symbol: \chi _{p,-1} (a) = \left( (a)/(p) \right). Sketch of proof: \nu _{p( -1 ) = (p -1)/(2)} , \omega ^{\nu _{p(-1)}} =-1 , \nu _{p(a)} is even (odd) if a is a quadratic residue (nonresidue)
38. Davenport, chs. 1, 4.
39. Ireland and Rosen's proof, valid for all moduli, also has these two cases. pp. 259 ff
40. Davenport p. 40
41. The notation \chi _{m,1} = \left( (m ^{2})/(\bullet) \right) is a shorter way of writing \chi _{m,1} (a) = \left( (m ^{2})/(a) \right)
42. The product of primes ensures it is zero if \gcd(m,\bullet) > 1 ; the squares ensure its only nonzero value is 1.
43. Davenport pp. 38-40
44. Koblittz, prop. 17b p. 127
45. f(z)\in M _{k(M,\chi)} means

    1)

    f( (az + b)/(cz + d) )(cz + d) ^{-k} = f(z) where ad - bc =1 anda\equiv d\equiv 1 , c\equiv 0 \pmod{M}. and 2) f( (az + b)/(cz + d) )(cz + d) ^{-k} = \chi(d)f(z) where ad - bc =1 and c\equiv 0 \pmod{M}. See Koblitz Ch. III.
46. the twist of f by \chi _{1}
47. https://www.lmfdb.org/knowledge/show/character.dirichlet.kloosterman_sum LMFDB definition of Kloosterman sum
48. Davenport p. 30
49. Sarkozy
50. Chudakov
51. Klurman