Home › Mathematics › Number Theory › Dirichlet's Theorem on Arithmetic Progressions

Dirichlet's Theorem on Arithmetic Progressions

📅 Updated: November 12, 2025 👤 Authored by: Dr. Elena Vasquez ⏱️ Read time: ~12 min
Number Theory Analytic Methods Prime Numbers L-Functions

Introduction

Dirichlet's theorem on arithmetic progressions, proven by Peter Gustav Lejeune Dirichlet in 1837, is a landmark result in analytic number theory. It states that any arithmetic progression contains infinitely many prime numbers, provided the first term and the common difference are coprime.

Before Dirichlet, mathematicians knew of specific cases (e.g., Euclid's proof for primes of the form $4k+1$ and $4k+3$), but no general method existed. Dirichlet's proof introduced revolutionary tools—most notably Dirichlet characters and L-functions—which fundamentally reshaped the field and remain central to modern number theory.

Formal Statement

Let $a$ and $d$ be positive integers such that $\gcd(a, d) = 1$. Then the arithmetic progression

a, a + d, a + 2d, a + 3d, \dots

contains infinitely many prime numbers.

In congruence notation, the theorem asserts that the set of primes $\{ p \text{ prime} \mid p \equiv a \pmod d \}$ is infinite whenever $\gcd(a,d)=1$. If $\gcd(a,d) = g > 1$, then every term in the progression is divisible by $g$, so at most one prime can appear (if $a = g$).

Historical Context

Dirichlet published this theorem in the Journal für die reine und angewandte Mathematik (Crelle's Journal) in 1837. The proof was groundbreaking because it applied calculus and complex analysis to a purely discrete problem.

Key milestones surrounding the theorem:

💡 Historical Note Dirichlet's introduction of $L(s,\chi)$ was the first instance of what would later be recognized as a family of automorphic L-functions, a cornerstone of the modern Langlands program.

Proof Strategy & Key Concepts

The proof does not construct primes explicitly. Instead, it uses analytic methods to show that a certain weighted sum of reciprocals of primes in the progression diverges.

1. Dirichlet Characters

A Dirichlet character modulo $d$ is a completely multiplicative function $\chi: \mathbb{Z} \to \mathbb{C}$ that is periodic with period $d$ and vanishes on integers not coprime to $d$. There are exactly $\phi(d)$ such characters, forming an orthonormal group under convolution.

2. Dirichlet L-Functions

For each character $\chi$, Dirichlet defines:

L(s, \chi) = \sum_{n=1}^{\infty} \frac{\chi(n)}{n^s} = \prod_{p} \left(1 - \frac{\chi(p)}{p^s}\right)^{-1}
This converges absolutely for $\Re(s) > 1$ and admits analytic continuation to $\mathbb{C}$ (except possibly a simple pole at $s=1$ for the principal character $\chi_0$).

3. Orthogonality & Prime Counting

Using the orthogonality relation of characters:

\frac{1}{\phi(d)} \sum_{\chi \pmod d} \chi(n)\overline{\chi(a)} = \begin{cases} 1 & \text{if } n \equiv a \pmod d \\ 0 & \text{otherwise} \end{cases}
Dirichlet derives an expression for the sum over primes in the progression:
\sum_{p \equiv a \pmod d} \frac{1}{p^s} = \frac{1}{\phi(d)} \sum_{\chi \pmod d} \overline{\chi(a)} \sum_p \frac{\chi(p)}{p^s}

4. Non-Vanishing at $s=1$

The crux of the proof is showing $L(1, \chi) \neq 0$ for all non-principal characters. If $L(1,\chi)=0$ for some real character, a clever combination of $L$-values yields a contradiction via the behavior of $\prod L(s,\chi)^{\dots}$ as $s \to 1^+$. This divergence forces the prime sum to diverge, proving infinitely many such primes exist.

Significance & Generalizations

Dirichlet's theorem opened the door to analytic number theory. Its modern implications and extensions include:

The theorem also underpins cryptographic protocols relying on the distribution of primes in structured sequences, and remains a standard topic in advanced undergraduate and graduate number theory curricula.

References & Further Reading