Definition
The theorem that any arithmetic progression a, a+d, a+2d, ... with gcd(a,d)=1 contains infinitely many prime numbers; it guarantees at least one prime in infinitely many positions of the progression when the initial term and modulus are coprime.
Principle
Principle
The organizing principle is that nontrivial Dirichlet characters and their L-series distinguish residue classes modulo d, and nonvanishing of L-series at s=1 for principal characters forces infinitely many primes into each reduced residue class modulo d.
Demonstration
Demonstration
Example: for modulus d=4 and residue class a=3 (gcd(3,4)=1), Dirichlet's theorem asserts infinitely many primes congruent to 3 modulo 4; explicit small members are 3, 7, 11, 19, ... and the theorem ensures the list never ends though it does not give an elementary formula for their distribution.
Misapplication
Misapplication
Assuming the theorem applies when gcd(a,d)>1 (in which case the progression may contain no primes beyond the trivial initial term) or expecting an explicit finite bound on the location of the next prime in the progression are misuses; the theorem is nonconstructive about exact gaps.
Consequence
Consequence
Correct application ensures that primes are distributed across reduced residue classes modulo d and undergirds advanced results about equidistribution, analytic techniques in number theory, and constructions in algebraic number theory and cryptography that rely on primes with prescribed congruence properties.
Reversal
Reversal
The inverse situation is when gcd(a,d)>1: the progression a + kd then shares a common factor and typically contains at most one prime (often only when the common factor equals the prime itself); reversing the coprimality condition collapses the theorem's conclusion.
Boundary
Boundary
Scope: requires gcd(a,d)=1 and concerns infinitely many primes but says little about density or effective bounds; stronger quantitative statements (e.g., equidistribution and error terms) require deeper analytic results. The theorem applies to arithmetic progressions of integers, not to arbitrary sequences or to moduli with additional algebraic structure without extension.
Semantic Tension
Semantic Tension
Tension exists between the existential guarantee of infinitude and practical needs for density or effective bounds; another nearby meaning is the generalized statement about primes in progression within number fields, which requires different hypotheses and tools.
Synthesis
Synthesis
Dirichlet's theorem asserts the infinitude of primes in any arithmetic progression with coprime initial term and modulus by exploiting characters and nonvanishing properties of L-series, thereby distributing primes across residue classes and forming a cornerstone of analytic number theory.