Section 3.9 · PDF pages 25–27
Reading the host characters and the level weights
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
3.9 Reading the host characters and the level weights
The following description states exactly the host information used by the analytic argument. Let r : (ℤ/Nℤ)^{×} ↠Γ be surjective. For ψ ∈Γ̂, let χ_{ψ} be the character modulo N whose value at a unit is ψ(r(u)), and let p_{ψ} be its inducing primitive character. Different ψ’s give different p_{ψ}’s: equality of their primitive characters gives equality after induction to N, then equality on the image of r, which is all of Γ. In particular p_{ψ} = 1 if and only if ψ = 1.
For a prime p, write N = p^{k}N_{p}^{′} with p ∤N_{p}^{′}. Take the local units U_{p} to be the kernel of reduction of (ℤ/Nℤ)^{×} to (ℤ/N_{p}^{′}ℤ)^{×}. The Chinese remainder theorem gives a unit fr_{p} that is 1 modulo p^{k} and p modulo N_{p}^{′}. Define I_{p}= r(U_{p}) and F_{p}= r(fr_{p}). Then
Selectable PDF notation • transcription unchecked
b_{ψ}(m) = p_{ψ}(m) (m ≥1). (30)To prove this it suffices to consider m = p^{j}. The character ψ is trivial on I_{p} exactly when χ_{ψ} factors through N_{p}^{′}, or equivalently when p does not divide its conductor. This last conductor criterion follows directly from the Chinese remainder decomposition of the unit group into its prime-power factors: for each factor choose the least exponent through which its character factors. Their product is the conductor, and a divisor of N is an inducing modulus exactly when each of its exponents is at least the corresponding least exponent. If the restriction is trivial, the inertia average equals ψ(F_{p})^{j}= p_{ψ}(p)^{j}, by the defining congruence of fr_{p} modulo the conductor. If the restriction is nontrivial, translation by an inertia element on which it is nontrivial makes the average zero, and p_{ψ}(p) = 0 because p divides its conductor. This proves (30).
For ψ ̸= 1, choose ℓ(ψ) = L^{′}(1, p_{ψ})/L(1, p_{ψ}). The value ℓ(1) can be set to zero: it is not used in the definition of G_{D}(1; y) = G(y), and no principal logarithmic derivative at the pole is needed. Equation (30) then gives G_{D}(ψ; y) = 𝒢_{pψ}(y) for every ψ.
The required inertia pattern follows from the usual concrete host conditions as well. Namely let N = Qqd, where q, d are distinct odd primes, d ≡7 (mod 8), 4 | Q, and gcd(Q, qd) = 1. Suppose
Selectable PDF notation • transcription unchecked
(u)
χ_{C}(r(u)) = , r{u : u ≡1 (mod Qq)} ⊆{0, s_{0}},
Selectable PDF notation • transcription unchecked
d
and assume (−d/p) = 1 for every odd p | Qq. Set S = {q} ∪{p : p | Q}. For p /∈S ∪{d}, U_{p} = 1, so I_{p} = 0. For p ∈S, a local unit is 1 modulo d; its image has color 1, that is, belongs to Φ. Also fr_{p} ≡p (mod d). For odd p ∈S, quadratic reciprocity with d ≡3 (mod 4) gives (p/d) = (−d/p) = 1; for p = 2, use d ≡7 (mod 8). Thus F_{p} ∈Φ. At d, the indicated image containment gives I_{d} ⊆{0, s_{0}}. Choose by the Chinese remainder theorem a unit that is 1 modulo Qq and −1 modulo d. Its image has color (−1/d) = −1, so it is s_{0}. This proves equality I_{d} = {0, s_{0}}, and verifies every arithmetic assumption of Lemma 3.5.
For a level ℒ with kept set K, put
Selectable PDF notation • transcription unchecked
K^{′}= {ψ : p_{ψ} ∈K}, o = [H : A_{0}], c = (3o + 1)^{−1}, χ_{P} ((e_{1}, e_{2}), h) = (−1)^{e2}.Define X^{±}= {ψ ∈Ψ(A_{0}) : ψ(s_{0}) = ±1}. The explicit-formula conditions at x, ϵ, with a fixed constant C_{E}, are: every member of K is p_{ψ} for a ψ ∈X^{+}; the level’s optional exceptional character is p_{χP} when present, and p_{χP} /∈K when it is absent; the integer o agrees with the level’s integer; and
Selectable PDF notation • transcription unchecked
|||| |{t ∈T : t −γ ∈A_{0}}| −^{3 +}_{3o}^{ 1}_{ + 1}^{γ∈A0}|T||||| ≤x^{−1+ϵ}|T| (γ ∈H). (31)Finally require, for every ψ ∈(X^{+}\ K^{′}) ∪X^{−},
|𝒢_{pψ}(x)| ≤x^{1/2+ϵ}, |L^{′}(1, p_{ψ})/L(1, p_{ψ})| ≤C_{E} log x. (32)
None of these bounded characters is principal.
Lemma 3.11 (Transfer to the finite core). Under these explicit-formula conditions,
Selectable PDF notation • transcription unchecked
G_{K}(y) = G_{ℒ}(y), Σ(x) ≤4o x^{1/2+ϵ},and (23) holds with ∑
Selectable PDF notation • transcription unchecked
M = 4o, K_{o} = |L^{′}(1, χ)/L(1, χ)|.
χ∈K\{1}Proof. The map ψ →→ p_{ψ} bijects K^{′} with K, by the assumed coverage and its already proved injectivity. Thus 1 ∈K^{′}, K^{′}⊆X^{+}, and every member of K^{′} is trivial at s_{0}. A character trivial on H and at s_{0} is either 1 or χ_{P} , because only its value on the other order-two factor remains, and that value is 1 or −1. It follows that its weight w_{c} is 1 exactly for the principal character or the designated exceptional character. All other kept weights are c. Reindexing the sum by p_{ψ}, and using (30), proves G_{K} = G_{ℒ}.
The characters in Ψ(A_{0}) are exactly the characters of (ℤ/2ℤ)^{2}×(H/A_{0}), so there are 4o of them. Each has value 1 or −1 at s_{0}. Thus every omitted member belongs to (X^{+}\ K^{′}) ∪X^{−}. The first estimate of (32), summed over at most 4o omitted characters, proves the bound for Σ. The second gives the omit-ted logarithmic-derivative bound, and the fixed finite sum K_{o} bounds every nonprincipal kept logarithmic derivative.
It remains to check the character sums on T. Let θ(t) = ψ(0, t) be nontrivial on H and trivial on A_{0}. Put n_{γ} = |{t ∈T : t −γ ∈A_{0}}|. Double counting the coset relation gives
Selectable PDF notation • transcription unchecked
∑θ(γ)n_{γ} = |A_{0}|∑θ(t).
γ∈H t∈TWrite
Selectable PDF notation • transcription unchecked
n_{γ} =_{3}^{3}_{o}^{|}_{ + 1 }^{T|} +_{3o}^{|}_{ + 1}^{T|} 1_{γ∈A0} + e_{γ}, |e_{γ}| ≤x^{−1+ϵ}|T|.The nontrivial character sum over H vanishes, whereas its sum over A_{0} is |A_{0}|. Substitution in the preceding identity therefore gives |||||
Selectable PDF notation • transcription unchecked
∑θ(t) −c|T|||||| ≤|^{H|}x^{−1+ϵ}|T| = o x^{−1+ϵ}|T|.
t∈T^{|A0|}This is stronger than the required bound with M = 4o. All clauses of (23) are proved.
Proposition 3.12 (Uniform estimate for a level). Fix ℒ, e_{D}, e_{L}, K, c_{HH}, e_{K}, C_{E}, and ϵ > 0. There is x_{1}, depending only on these fixed quantities, such that for every x ≥x_{1}, every host and node set satisfying the explicit-formula conditions above and the following quantitative requirements obey
Selectable PDF notation • transcription unchecked
_{Gℒ(x) ≤x}1/2+(e_{D}+e_{L}+7)ϵ_{.}The quantitative requirements are the node, thin, cost, and size conditions of Proposition 3.7, and slope data satisfying Lemmas 3.8 and 3.9 and Proposition 3.10, with
Selectable PDF notation • transcription unchecked
e_{Div} ≤e_{D}, e_{Loss} ≤e_{L}, c^{datum}_{HH} ≤c_{HH}.The constants c_{∗} are bounded by the fixed K, and the same e_{K} bounds k.
Proof. Use Proposition 3.7 with C = max(e_{D} + e_{L}, 0) + 3, c = (3o + 1)^{−1}, M = 4o, and the fixed K_{o} of
Lemma 3.11. Here |c| ≤1. Enlarge its threshold so that log x ≤x^{ϵ}, 200(1 + K)^{2}(1 + c_{HH})(1 + e_{K}) ≤x^{ϵ},
and 1 + 4o ≤x^{ϵ}. The data’s exponents and constants are nonnegative, so in any instance of the hypotheses e_{D} + e_{L} ≥0, and C = e_{D} + e_{L} + 3. The slope-to-gap estimate supplies
gap(u) ≤x^{(eDiv+eLoss+3)ϵ}ℰ ≤x^{Cϵ}ℰ.
datum Monotonicity in c_{HH} verifies the data’s required error-budget threshold as well. The core inequality and host transfer now give
Selectable PDF notation • transcription unchecked
G_{ℒ}(x) ≤x^{1/2+(eD+eL+6)ϵ}+ 4o x^{1/2+ϵ}.The second power is no larger than the first. Absorb the factor 1 + 4o into x^{ϵ} using the enlarged threshold. This proves the stated estimate, uniformly over every host and every varying quantitative package satisfying its hypotheses.