Primes in Arithmetic Progressions

Arithmetic Progressions

An arithmetic progression is a sequence of the form

a,\ a+q,\ a+2q,\ a+3q,\ \ldots,

where $a$ and $q$ are fixed integers with

q>0.

A fundamental question in number theory asks:

Are there infinitely many primes in a given arithmetic progression?

For example:

primes congruent to $1\pmod4$ ,
primes congruent to $3\pmod4$ ,
primes congruent to $1\pmod3$ .

Some progressions obviously contain only finitely many primes. For instance,

2,4,6,8,\ldots

contains only one prime because every later term is even.

The correct condition is

(a,q)=1.

If $a$ and $q$ are coprime, then no fixed prime divides every term of the progression.

Dirichlet’s Theorem

The central result is Dirichlet’s theorem on arithmetic progressions.

Let

(a,q)=1.

Then the progression

a,\ a+q,\ a+2q,\ \ldots

contains infinitely many primes.

This theorem was proved by entity[“people”,“Peter Gustav Lejeune Dirichlet”,“German mathematician”] in 1837.

It was the first major theorem establishing infinite prime families beyond Euclid’s theorem.

Examples

Dirichlet’s theorem implies:

infinitely many primes congruent to $1\pmod4$ ,
infinitely many primes congruent to $3\pmod4$ ,
infinitely many primes congruent to $1\pmod3$ ,
infinitely many primes congruent to $2\pmod5$ .

Thus primes distribute across all admissible residue classes.

Role of Characters

The proof uses Dirichlet characters modulo $q$ .

Orthogonality relations allow one to isolate primes in a particular residue class:

1_{n\equiv a\pmod q} = \frac1{\varphi(q)} \sum_{\chi\bmod q} \overline{\chi(a)}\chi(n).

Applying this identity to prime sums transforms congruence conditions into sums involving characters.

The analytic study of these sums leads to Dirichlet $L$ -functions.

Logarithmic Prime Sums

A key object is

\sum_p \frac{\chi(p)}{p^s}.

For the principal character $\chi_0$ , this behaves similarly to

\log\zeta(s),

which diverges as

s\to1^+.

For nonprincipal characters, the associated $L$ -functions remain finite at $s=1$ .

This contrast isolates the contribution of primes in the chosen residue class.

Nonvanishing of $L(1,\chi)$

The crucial analytic theorem is:

If $\chi\neq\chi_0$ , then

L(1,\chi)\neq0.

This prevents cancellation from destroying the prime contribution in the target progression.

The entire proof of Dirichlet’s theorem ultimately depends on this nonvanishing result.

Prime Number Theorem for Progressions

Dirichlet’s theorem proves infinitude, but one may ask how primes distribute quantitatively among residue classes.

Define

\pi(x;q,a) = \#\{p\leq x : p\equiv a\pmod q\}.

The Prime Number Theorem for arithmetic progressions states:

(a,q)=1,

then

\pi(x;q,a) \sim \frac1{\varphi(q)} \frac{x}{\log x}.

Thus primes distribute asymptotically equally among all admissible residue classes modulo $q$ .

For example, modulo $4$ , primes are asymptotically split evenly between:

1\pmod4 \quad\text{and}\quad 3\pmod4.

Generalized Riemann Hypothesis

Error terms in arithmetic progressions depend on zeros of Dirichlet $L$ -functions.

The Generalized Riemann Hypothesis predicts strong bounds such as

\pi(x;q,a) = \frac{\operatorname{li}(x)}{\varphi(q)} + O(\sqrt{x}\log x).

These estimates become especially important in computational number theory and cryptography.

Exceptional Zeros

Some Dirichlet $L$ -functions may possess zeros very close to

s=1.

Such zeros are called Siegel zeros or exceptional zeros.

Although their existence remains uncertain, they strongly influence error terms in arithmetic progression estimates.

Exceptional zeros illustrate the deep relationship between zero locations and prime distribution.

Chebotarev Perspective

Dirichlet’s theorem later became part of a broader framework.

The Chebotarev Density Theorem generalizes prime distribution from congruence classes to splitting behavior in number fields.

In this viewpoint:

congruence conditions correspond to Galois-theoretic conditions,
Dirichlet characters become one-dimensional representations,
Dirichlet $L$ -functions become Artin $L$ -functions.

Thus arithmetic progressions represent the first step toward modern algebraic number theory.

Importance

Dirichlet’s theorem marks the birth of analytic number theory.

It introduced:

Dirichlet characters,
$L$ -functions,
analytic methods for primes,
harmonic analysis on arithmetic groups.

The theorem demonstrates that primes are not confined to special residue classes but instead spread systematically across all admissible arithmetic progressions.

Much of modern number theory extends the ideas introduced in this proof.