Dirichlet's Theorem on Primes in Arithmetic Progressions

Dirichlet's theorem on primes in arithmetic progressions states that for any two coprime positive integers a and q, there are infinitely many prime numbers p such that p ≡ a (mod q). Proved by Johann Peter Gustav Lejeune Dirichlet in 1837, it was the first deep theorem about the distribution of primes in residue classes and the founding result of analytic number theory.

The proof introduces Dirichlet characters to separate primes by residue class and proves that the associated Dirichlet L-functions do not vanish at s = 1. This nonvanishing is the analytic heart of the theorem: it ensures that no single residue class monopolizes the primes. The theorem was later strengthened by the Prime Number Theorem for Arithmetic Progressions, which gives an asymptotic formula for the count of such primes, and by the Bombieri–Vinogradov theorem, which controls the error term on average over moduli.

Dirichlet's theorem is often taught as a triumph of analysis over arithmetic, but this misreads the ontology. The theorem works not because analysis is more powerful than congruence manipulations, but because the primes are already structured by symmetry — and characters are the harmonics of that symmetry. The analytic proof does not conquer the arithmetic; it listens to it.