Skip to content

Section 3.4 · PDF pages 14–15

Levels and the order of the uniform choices

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

3.4 Levels and the order of the uniform choices

A level ℒ consists of a finite set K of primitive Dirichlet characters, containing the conductor 1 character and closed under complex conjugation, an integer o ≥0, and optionally a distinguished real odd character χ_{∗}∈K. For the nontrivial members put

Selectable PDF notation • transcription unchecked
{

1, χ = χ_{∗} when this choice is present,

Selectable PDF notation • transcription unchecked
w_{ℒ}(χ) =

(3o + 1)^{−1}, otherwise,

Selectable PDF notation • transcription unchecked
G_{ℒ}(y) = G(y) + ∑ w_{ℒ}(χ)ℜ𝒢_{χ}(y),
χ∈K\{1}

where G(y) = R_{1}(y) −y log y + (1 + γ)y. All the weights are strictly positive. A primitive principal character has conductor 1; therefore ℒ, with weight 1 on that character, is an admissible family in the sense above. It follows from Corollary 3.3 that, for every λ > 1 and 0 < θ < 1,

Selectable PDF notation • transcription unchecked
∀Y_{0} ∃Y ≥Y_{0} ∀y ∈[Y, Y^{λ}], G_{ℒ}(y) ≤y^{θ}_{(17)}
=⇒∀χ ∈K ∀s, ℜs > θ =⇒ L(s, χ) ̸= 0.

This is the analytic principle needed by the subsequent construction. The special values of the weights have played no role in its proof; their positivity is what makes (11) nonzero.

Proposition 3.4 (Uniform small-scale reduction). Fix a level ℒ and λ > 1. Suppose there are fixed real numbers e_{D}, e_{L} and ϵ_{1} > 0 with the following property. For every 0 < ϵ < ϵ_{1} there is a set W_{ϵ} ⊆ ℝ containing windows [Y, Y^{λ}] arbitrarily far to the right, and a threshold x_{ϵ}, such that

Selectable PDF notation • transcription unchecked
G_{ℒ}(x) ≤x^{1/2+(eD+eL+7)ϵ} (x ∈W_{ϵ}, x ≥x_{ϵ}).

Then every character in K has no zero in ℜs > 1/2.

Proof. Given s with ℜs > 1/2, put

m = min(ℜs −1/2, 1/2) > 0, θ = 1/2 + m/2.

Then 0 < θ < 1 and θ < ℜs. Choose 0 < ϵ < ϵ_{1} so that (e_{D} + e_{L} + 7)ϵ ≤m/2; for example any positive ϵ no greater than min(ϵ_{1}/2, m/(2(|e_{D} + e_{L} + 7| + 1))) works. For x ≥ max(x_{ϵ}, 1) in W_{ϵ}, monotonicity of x^{t} in t gives G_{ℒ}(x) ≤x^{θ}. Discarding a bounded initial part of W_{ϵ} preserves its arbitrarily distant windows: when requesting a window initially, require its left endpoint to exceed that bound. Apply (17) to exclude a zero at s.

The placement of the quantifiers in this proposition is essential. The exponents e_{D}, e_{L} are chosen before ϵ, while the family, the admissible set, and its threshold may depend on ϵ. At a fixed ϵ, the constants controlling its family must work at every sufficiently large admissible x, and not be chosen again after x is specified. No uniformity over all primitive characters is asserted: the level, its conductor data, and all fixed constants may depend on the primitive character under consideration.

For completeness, every primitive character ψ belongs to a level of the kind used here. Take the finite cyclic subgroup generated by ψ in the character group of its conductor, replace each member by its inducing primitive character, take no exceptional character, and put o equal to the size of that cyclic group. The trivial member induces the conductor 1 character. Taking the inducing primitive character commutes with inversion: the conductor of an inverse equals the original conductor, because induction commutes with inversion in both directions, and injectivity of induction identifies the two primitive characters. Thus the resulting finite set is conjugation-stable. The primitive character inducing ψ is ψ itself, so it is indeed contained in this cyclic level. Consequently proving the small-scale hypothesis for these cyclic levels suffices for the primitive-character conclusion used in the reduction 2.4.