Dirichlet character
Builds on Coprime integersCompletely multiplicative functionIntegers modulo nGroup homomorphism
Definition
Let be an integer. A Dirichlet character modulo is a function such that:
- for all .
- if , and if .
- for all .
The principal character modulo has for coprime to and otherwise.
Remarks
Example: for , let for even , for and for . Clauses 1 and 2 are clear. For clause 3 it suffices to check odd classes: , and match , and . Non-example: for , the function , where is the remainder of modulo , satisfies clauses 1 and 2 but not clause 3, since . Equivalently, a Dirichlet character modulo is a group homomorphism from the unit group of the integers modulo q, extended by on the classes not coprime to . Hence each value with is a -th root of unity, and there are exactly characters modulo , where is Euler's totient function. Each Dirichlet character is a completely multiplicative function. The Legendre symbol is a Dirichlet character modulo an odd prime .
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
- no evidence level
- Completely multiplicative function concept
- Coprime integers concept
- Group homomorphism concept
- Integers modulo n concept
- Dirichlet character definition
Further reading
About this page
| Tag | JR4QSEFXWF |
|---|---|
| URI | m2://JR4QSEFXWF |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11A25, 11M06 |
| Defines | Dirichlet character |
| Uses | Coprime integers, Completely multiplicative function, Integers modulo n, Group homomorphism |
| Changed | 2 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.