What does Dirichlet's theorem actually say?

It says that if a and q share no common factor, the arithmetic progression a, a plus q, a plus 2q, and so on contains infinitely many prime numbers.

Why are characters needed at all?

Characters provide a Fourier-analytic way to pick out a single residue class modulo q, converting a question about one progression into a manageable sum over all L-functions of that modulus.

Dirichlet Characters and L-Functions

Dirichlet characters are periodic, multiplicative functions on the integers that, packaged into L-functions, let analytic methods reach the primes inside arithmetic progressions.

Definition

A Dirichlet character modulo q is a completely multiplicative function on the integers that is periodic with period q and vanishes on integers not coprime to q. Its Dirichlet L-function is the Dirichlet series formed from the character's values.

Scope

This topic covers Dirichlet characters modulo q and the orthogonality relations on the group of characters, primitive and induced characters and conductors, Dirichlet L-functions and their Euler products, analytic continuation and functional equations, the crucial nonvanishing of L-functions at the point one, and Dirichlet's theorem that any arithmetic progression with coprime first term and common difference contains infinitely many primes.

Core questions

How do the characters modulo q form a group, and how do their orthogonality relations isolate a single residue class?
How do L-functions inherit Euler products, analytic continuation, and functional equations from this character structure?
Why is the nonvanishing of each L-function at the point one the decisive step in Dirichlet's theorem?
How do L-functions refine prime counting to count primes in a fixed progression?

Key theories

Dirichlet characters and orthogonality: The characters modulo q are the homomorphisms from the unit group to the complex unit circle; their orthogonality relations act as a discrete Fourier transform that extracts a chosen residue class.
Dirichlet's theorem on arithmetic progressions: For coprime a and q there are infinitely many primes congruent to a modulo q; the proof combines the Euler products of all L-functions modulo q with the nonvanishing of each at the point one.
Nonvanishing of L-functions and the GRH: Nonvanishing at the point one drives the qualitative theorem; controlling zeros of L-functions in the critical strip governs uniformity in q, and the Generalized Riemann Hypothesis predicts the optimal control.

Clinical relevance

Bounds on primes in arithmetic progressions, conditional on the Generalized Riemann Hypothesis, justify deterministic primality tests and underpin assumptions used in the analysis of cryptographic protocols and pseudorandom generators.

History

Dirichlet introduced characters and L-functions in 1837 expressly to prove his theorem on primes in arithmetic progressions, the founding application of analysis to number theory. De la Vallee Poussin later derived the corresponding prime number theorem for progressions, and L-functions became the prototype for the L-functions of modern arithmetic.

Key figures

Peter Gustav Lejeune Dirichlet
Bernhard Riemann
Charles-Jean de la Vallee Poussin

Seminal works

davenport2000

Frequently asked questions

What does Dirichlet's theorem actually say?: It says that if a and q share no common factor, the arithmetic progression a, a plus q, a plus 2q, and so on contains infinitely many prime numbers.
Why are characters needed at all?: Characters provide a Fourier-analytic way to pick out a single residue class modulo q, converting a question about one progression into a manageable sum over all L-functions of that modulus.