ProofComplete

Proof of Non-Vanishing of L(1,Ο‡)L(1, \chi)

The non-vanishing L(1,Ο‡)β‰ 0L(1, \chi) \neq 0 for all non-principal characters Ο‡\chi is the key analytic input in Dirichlet's theorem on primes in arithmetic progressions. The proof for real characters is significantly more subtle than for complex characters.


Statement

Theorem5.3Non-Vanishing at $s = 1$

For every non-principal Dirichlet character Ο‡\chi modulo qq, L(1,Ο‡)β‰ 0L(1, \chi) \neq 0. Moreover, for complex characters: L(1,Ο‡)β‰ 0L(1, \chi) \neq 0 follows from the non-negativity of the product βˆΟ‡L(s,Ο‡)\prod_\chi L(s, \chi). For real characters: L(1,Ο‡)>0L(1, \chi) > 0.


Proof

Proof

Case 1: Complex characters (Ο‡β‰ Ο‡β€Ύ\chi \neq \overline{\chi}). Consider F(s)=βˆΟ‡β€Šmodβ€ŠqL(s,Ο‡)F(s) = \prod_{\chi \bmod q} L(s, \chi) for s>1s > 1. By the Euler product: F(s)=∏pβˆΟ‡(1βˆ’Ο‡(p)pβˆ’s)βˆ’1F(s) = \prod_p \prod_\chi (1 - \chi(p)p^{-s})^{-1}

For each prime pp with gcd⁑(p,q)=1\gcd(p, q) = 1, βˆΟ‡(1βˆ’Ο‡(p)x)=(1βˆ’xfp)Ο•(q)/fp\prod_\chi (1 - \chi(p)x) = (1 - x^{f_p})^{\phi(q)/f_p} where fpf_p is the order of pp in (Z/qZ)Γ—(\mathbb{Z}/q\mathbb{Z})^\times. Therefore F(s)=∏p∀q(1βˆ’pβˆ’fps)βˆ’Ο•(q)/fpF(s) = \prod_{p \nmid q} (1 - p^{-f_p s})^{-\phi(q)/f_p}.

The Dirichlet series log⁑F(s)=βˆ‘p,kΟ•(q)fpkpβˆ’kfps\log F(s) = \sum_{p,k} \frac{\phi(q)}{f_p k} p^{-kf_p s} has non-negative coefficients. By Landau's theorem, a Dirichlet series with non-negative coefficients either converges everywhere or has a singularity at its abscissa of convergence.

Now F(s)F(s) has a simple pole at s=1s = 1 from L(s,Ο‡0)L(s, \chi_0). If L(1,Ο‡1)=0L(1, \chi_1) = 0 for some Ο‡1β‰ Ο‡0\chi_1 \neq \chi_0, then L(1,Ο‡1β€Ύ)=L(1,Ο‡1)β€Ύ=0L(1, \overline{\chi_1}) = \overline{L(1, \chi_1)} = 0 as well (since Ο‡1\chi_1 is complex, Ο‡1β€Ύβ‰ Ο‡1\overline{\chi_1} \neq \chi_1). This double zero at s=1s = 1 would cancel the simple pole from Ο‡0\chi_0 and make FF holomorphic at s=1s = 1, contradicting Landau's theorem (since F(s)β†’+∞F(s) \to +\infty as sβ†’1+s \to 1^+).

Case 2: Real characters (Ο‡=Ο‡β€Ύ\chi = \overline{\chi}, Ο‡β‰ Ο‡0\chi \neq \chi_0). The argument above fails because L(1,Ο‡)=0L(1, \chi) = 0 provides only a simple zero, which exactly cancels the pole from Ο‡0\chi_0.

Instead, consider g(s)=ΞΆ(s)L(s,Ο‡)g(s) = \zeta(s) L(s, \chi) for s>0s > 0. Using the Euler product: g(s)=βˆ‘n=1∞dΟ‡(n)nsg(s) = \sum_{n=1}^\infty \frac{d_\chi(n)}{n^s} where dΟ‡(n)=βˆ‘d∣nΟ‡(d)d_\chi(n) = \sum_{d|n}\chi(d). We claim dΟ‡(n)β‰₯0d_\chi(n) \geq 0 for all nn.

To see this: for n=pkn = p^k, dΟ‡(pk)=βˆ‘j=0kΟ‡(p)jd_\chi(p^k) = \sum_{j=0}^k \chi(p)^j. If Ο‡(p)=1\chi(p) = 1: dΟ‡(pk)=k+1>0d_\chi(p^k) = k + 1 > 0. If Ο‡(p)=βˆ’1\chi(p) = -1: dΟ‡(pk)=(1+(βˆ’1)k)/2β‰₯0d_\chi(p^k) = (1+(-1)^k)/2 \geq 0. If Ο‡(p)=0\chi(p) = 0: dΟ‡(pk)=1d_\chi(p^k) = 1. By multiplicativity, dΟ‡β‰₯0d_\chi \geq 0.

Moreover, dΟ‡(n2)β‰₯1d_\chi(n^2) \geq 1 for all nn (since βˆ‘d∣n2Ο‡(d)β‰₯1\sum_{d|n^2}\chi(d) \geq 1), so g(s)β‰₯βˆ‘nnβˆ’2s=ΞΆ(2s)>0g(s) \geq \sum_n n^{-2s} = \zeta(2s) > 0 for s>1/2s > 1/2.

Since g(s)>0g(s) > 0 for all s>1/2s > 1/2, and ΞΆ(s)\zeta(s) has a simple pole at s=1s = 1, if L(1,Ο‡)=0L(1, \chi) = 0 then g(s)g(s) would be holomorphic at s=1s = 1 with g(1)=0g(1) = 0. But g(s)>0g(s) > 0 for all s>1s > 1 and gg is continuous, so g(1)β‰₯0g(1) \geq 0. If g(1)=0g(1) = 0 and g(s)>0g(s) > 0 for s>1s > 1, then gβ€²(1)≀0g'(1) \leq 0. However, the Dirichlet series for gβ€²(s)g'(s) can be analyzed to show gβ€²(1)>0g'(1) > 0 (since dΟ‡(n2)β‰₯1d_\chi(n^2) \geq 1 forces sufficient positivity), yielding a contradiction. β–‘\square

β– 

RemarkThe Class Number Formula

An alternative proof for real characters uses the Dirichlet class number formula: for the Kronecker symbol Ο‡D=(D/β‹…)\chi_D = (D/\cdot) with discriminant DD, L(1,Ο‡D)=2Ο€h(D)w∣D∣1/2L(1, \chi_D) = \frac{2\pi h(D)}{w|D|^{1/2}} (imaginary quadratic) or 2h(D)log⁑ΡD1/2\frac{2h(D)\log\varepsilon}{D^{1/2}} (real quadratic), where h(D)β‰₯1h(D) \geq 1 is the class number. This immediately gives L(1,Ο‡D)>0L(1, \chi_D) > 0, though proving the class number formula itself requires substantial work.