Skip to content

Section 3.3 · PDF pages 13–14

From power windows to zero-freeness

The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.

3.3 From power windows to zero-freeness

Corollary 3.3. Let F be any admissible finite positive character family. Fix 0 < θ < 1, λ > 1, and C ∈ℝ. If for every Y_{0} there is Y ≥Y_{0} such that

Selectable PDF notation • transcription unchecked
G_{F} (y) ≤Cy^{θ} (Y ≤y ≤Y^{λ}),

then every member L(s, χ_{i}) is zero-free for ℜs > θ.

Proof. Set δ = λ −1 > 0. Given η > 0, require Y ≥1 so large that |C|δ log Y ≤Y^{η}. On the window take R(y) = |C|y^{θ}; then

Selectable PDF notation • transcription unchecked
∫_{ Y} 1+δ

R(y)y^{−θ−1}dy = |C|δ log Y ≤Y^{η}.

Selectable PDF notation • transcription unchecked
Y

This integrand is continuous on a compact positive interval, hence integrable. With U = log Y , the substi-tution y = e^{u} turns this identity into the required 𝒲(g_{F} ; θ, δ) estimate, using majorant R(e^{u}). The lower bound U ≥ U_{0} is obtained by initially requiring Y ≥ e^{U0}. Proposition 3.1 and Theorem 3.2 now give ℜρ ≤θ for every zero in Z_{F} . A zero of a member with ℜs > θ > 0 away from the simple pole s = 1 of ζ belongs to Z_{F} , which is a contradiction; for the stronger total-function statement ZF (7) at s = 1, Mathlib’s assigned value ζ(1) is nonzero by riemannZeta_ne_zero_of_one_le_re, exactly as in TotientGaloisClasses/Landau.lean:508--516.