Math 2.0

Number theory Definition

Dirichlet character

Builds on Coprime integersCompletely multiplicative functionIntegers modulo nGroup homomorphism

Definition

Let q≥1q \ge 1 be an integer. A Dirichlet character modulo qq is a function χ ⁣:ℤ→ℂ\chi \colon \Z \to \C such that:

  1. χ(n+q)=χ(n)\chi(n + q) = \chi(n) for all n∈ℤn \in \Z.
  2. χ(n)=0\chi(n) = 0 if gcd⁡(n,q)>1\gcd(n, q) > 1, and χ(n)≠0\chi(n) \ne 0 if gcd⁡(n,q)=1\gcd(n, q) = 1.
  3. χ(mn)=χ(m)χ(n)\chi(mn) = \chi(m)\chi(n) for all m,n∈ℤm, n \in \Z.

The principal character χ0\chi_0 modulo qq has χ0(n)=1\chi_0(n) = 1 for nn coprime to qq and χ0(n)=0\chi_0(n) = 0 otherwise.

Remarks

Example: for q=4q = 4, let χ(n)=0\chi(n) = 0 for even nn, χ(n)=1\chi(n) = 1 for n≡1n \equiv 1 and χ(n)=−1\chi(n) = -1 for n≡3(mod4)n \equiv 3 \pmod 4. Clauses 1 and 2 are clear. For clause 3 it suffices to check odd classes: 1⋅1≡11 \cdot 1 \equiv 1, 1⋅3≡31 \cdot 3 \equiv 3 and 3⋅3≡1(mod4)3 \cdot 3 \equiv 1 \pmod 4 match 1⋅1=11 \cdot 1 = 1, 1⋅(−1)=−11 \cdot (-1) = -1 and (−1)(−1)=1(-1)(-1) = 1. Non-example: for q=3q = 3, the function f(n)=rf(n) = r, where r∈{0,1,2}r \in \set{0, 1, 2} is the remainder of nn modulo 33, satisfies clauses 1 and 2 but not clause 3, since f(2⋅2)=f(4)=1≠4=f(2)f(2)f(2 \cdot 2) = f(4) = 1 \ne 4 = f(2) f(2). Equivalently, a Dirichlet character modulo qq is a group homomorphism (ℤ/qℤ)×→ℂ×(\Z/q\Z)^\times \to \C^\times from the unit group of the integers modulo q, extended by 00 on the classes not coprime to qq. Hence each value χ(n)\chi(n) with gcd⁡(n,q)=1\gcd(n, q) = 1 is a φ(q)\varphi(q)-th root of unity, and there are exactly φ(q)\varphi(q) characters modulo qq, where φ\varphi is Euler's totient function. Each Dirichlet character is a completely multiplicative function. The Legendre symbol n↦(n/p)n \mapsto (n/p) is a Dirichlet character modulo an odd prime pp.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Completely multiplicative function concept
  2. Coprime integers concept
  3. Group homomorphism concept
  4. Integers modulo n concept
  5. Dirichlet character definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Dirichlet_character
About this page
TagJR4QSEFXWF
URIm2://JR4QSEFXWF
Kinddefinition
WritingW0 stub
MSC11A25, 11M06
DefinesDirichlet character
UsesCoprime integers, Completely multiplicative function, Integers modulo n, Group homomorphism
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.