Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Dirichlet character
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== 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 <math>\Chi:\mathbb{Z}\rightarrow\mathbb{C}</math> such that :1) <math>\Chi(ab) = \Chi(a)\Chi(b),</math> :2) <math>\Chi(a + m) = \Chi(a)</math>, :3) If <math>\gcd(a,m)>1</math> then <math>\Chi(a)=0</math>, but :4) <math>\Chi(a)</math> is not always 0, then <math>\Chi(a)</math> is one of the <math>\phi(m)</math> characters mod <math>m</math><ref>Davenport p. 30</ref> === Sárközy's Condition === A Dirichlet character is a completely multiplicative function <math>f: \mathbb{N} \rightarrow \mathbb{C}</math> that satisfies a [[linear recurrence relation]]: that is, if <math>a_1 f(n+b_1) + \cdots + a_kf(n+b_k) = 0 </math> for all positive integers <math>n</math>, where <math>a_1,\ldots,a_k</math> are not all zero and <math>b_1,\ldots,b_k</math> are distinct then <math>f</math> is a Dirichlet character.<ref>Sarkozy</ref> === Chudakov's Condition === A Dirichlet character is a completely multiplicative function <math>f: \mathbb{N} \rightarrow \mathbb{C}</math> satisfying the following three properties: a) <math>f</math> takes only finitely many values; b) <math>f</math> vanishes at only finitely many primes; c) there is an <math>\alpha \in \mathbb{C}</math> for which the remainder <math>\left|\sum_{n \leq x} f(n)- \alpha x\right| </math> is uniformly bounded, as <math>x \rightarrow \infty</math>. This equivalent definition of Dirichlet characters was conjectured by Chudakov<ref>Chudakov</ref> in 1956, and proved in 2017 by Klurman and Mangerel.<ref>Klurman</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)