Dirichlet's Theorem on Primes in Arithmetic Progressions
Theorem5.1Dirichlet's Theorem
For any integers a and q with gcd(a,q)=1, there are infinitely many primes pβ‘a(modq). Equivalently, βpβ‘amodqββp1β=β.
Proof
Proof
The proof uses the non-vanishing of L(1,Ο) for Οξ =Ο0β.
Step 1: Character decomposition. By orthogonality: βpβ€xpβ‘amodqββp1β=Ο(q)1ββΟmodqβΟ(a)ββpβ€xβpΟ(p)β.
Step 2: Connection to logL(s,Ο). Taking logarithms of the Euler product: logL(s,Ο)=βpβpsΟ(p)β+O(1) for s>1, where the O(1) accounts for prime powers.
Step 3: Principal character contribution. For Ο=Ο0β: L(s,Ο0β)=ΞΆ(s)βpβ£qβ(1βpβs), so logL(s,Ο0β)ββ as sβ1+. This gives βpβΟ0β(p)/psββ.
Step 4: Non-principal characters are bounded. For Οξ =Ο0β, if L(1,Ο)ξ =0, then logL(s,Ο) remains bounded as sβ1+, so βpβΟ(p)/ps=O(1).
Step 5: Non-vanishing of L(1,Ο). This is the crux. For complex Ο (i.e., Οξ =Οβ): consider F(s)=βΟβL(s,Ο)=βnβanβ/ns where anββ₯0 (since F(s)=βΟββpβ(1βΟ(p)pβs)β1=βpββΟβ(1βΟ(p)pβs)β1, and βΟβ(1βΟ(p)x)=(1βxfpβ)Ο(q)/fpβ where fpβ is the order of p in (Z/qZ)Γ). Since the Dirichlet series has non-negative coefficients and a pole at s=1 (from Ο0β), it cannot have a zero at s=1 from another factor, as this would make F(s) analytic at s=1 with non-negative coefficients and a singularity at its abscissa of convergence -- a contradiction by Landau's theorem.
For real Ο: a more delicate argument using the class number formula L(1,Ο)=wβ£Dβ£β2ΟhKββ (for the associated quadratic field) or the product ΞΆ(s)L(s,Ο)β₯1 (both approaches) shows L(1,Ο)>0.
Step 6: Conclusion. Combining: βpβ€xpβ‘amodqββp1β=Ο(q)1βloglogx+O(1), proving infinitely many primes in the progression. β‘
β
RemarkEffective vs. Ineffective Bounds
Dirichlet's original proof is effective for complex characters but ineffective for real characters (the class number argument gives no explicit lower bound for L(1,Ο)). Effective bounds require either assuming GRH or using Siegel's theorem L(1,Ο)β«qβΞ΅ with an ineffective constant.