Skip to content

Section 8.6 · PDF pages 479–480

The minus part: from a character estimate to a prime sum

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

8.6 The minus part: from a character estimate to a prime sum

Let E/ℚ be abelian and CM, of conductor F and degree n. For a character η of Gal(E/ℚ), use the corre-sponding Dirichlet character modulo F, and let η_{0} be its primitive character of conductor f. The convention for the generalised Bernoulli number in this argument is

Selectable PDF notation • transcription unchecked
∑f
B_{k,η} = η_{0}(a)f^{k−1}B_{k}(a/f).
a=1

In particular its value uses the primitive character, rather than the imprimitive Euler-factor correction at level F. Put ∏

Selectable PDF notation • transcription unchecked
D(F, k) = F p, α_{k}(η) = D(F, k)B_{k,η}, b(F, k) = 16F^{k+1}k!.
p≤k+1

All products indexed by p here are over primes.

The character estimate needed for the minus part is

Selectable PDF notation • transcription unchecked
( )

length_{O} 𝒮_{ℓ}(E, e; η) ≤v_{O}(α_{e+1}(η)) ℓ∤n, η(−1) = (−1)^{e+1} . (206)

The left side is the η-eigenspace with O coefficients of the group in (199); this fixes the character and inverse-character conventions in the inequality. The source derives this estimate by a reciprocity and cyclotomic Euler-system argument, rather than using it as an unqualified class-number formula.

Proposition 8.15 (Passing from Bernoulli valuations to all good primes). Assume (206). For each k ≥2 suppose also that the product over all characters of Gal(E/ℚ) of parity (−1)^{k} is a nonzero rational integer

Selectable PDF notation • transcription unchecked
M_{k}: ∏

M_{k} = α_{k}(η), log |M_{k}| ≤n log b(F, k).

Selectable PDF notation • transcription unchecked
η(−1)=(−1)^{k}

Suppose its factors are algebraic integers. Then for every finite set T of odd primes not dividing n, and every e ≥1, the minus lengths are finite and

Selectable PDF notation • transcription unchecked
∑

log ℓs^{−}_{ℓ}(E, e) ≤n log b(F, e + 1).

Selectable PDF notation • transcription unchecked
ℓ∈T

Proof. At each ℓ, choose a coefficient field containing all character values. Since ℓ∤n, the character idempo-tents n^{−1} ∑_{g}η(g)^{−1}g are defined over its ring of integers, and split the module into the indicated eigenspaces. Coefficient extension multiplies its length by e_{O}. Applying (206) gives finiteness and

Selectable PDF notation • transcription unchecked
∑

e_{O}s_{ℓ}^{−}(E, e) log ℓ≤ v_{O}(α_{e+1}(η)) log ℓ.

Selectable PDF notation • transcription unchecked
η(−1)=(−1)^{e+1}

The normalised absolute value satisfies v_{O}(z) log ℓ= −e_{O} log |z|_{ℓ}. Each factor is integral, so each of the latter negative logarithms is nonnegative, and their sum is − log |M_{e+1}|_{ℓ}= v_{ℓ}(M_{e+1}) log ℓ. Cancel e_{O} > 0 and sum over T. Prime factorisation of the nonzero integer M_{e+1} gives

Selectable PDF notation • transcription unchecked
∑

v_{ℓ}(M_{e+1}) log ℓ≤ log |M_{e+1}| ≤n log b(F, e + 1).

Selectable PDF notation • transcription unchecked
ℓ∈T

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/OddResidueBounds/ProdVal.lean:10--34; Development/AutomorphicArithmetic/AutomorphicVarieties/OddResidueBounds/PsiReal.lean:9--33;Development/AutomorphicArithmetic/AutomorphicVarieties/OddResidueBounds/AtPrime.lean:43--96

Proposition 8.16 (The explicit minus bound). Assume Proposition 8.15 and the individual bound

log ℓs^{−}_{ℓ}(E, e) ≤240 ℓn^{2}(e + 1) log^{2}(eℓF) (207)

for odd primes dividing n, including finiteness. For a ψ-field and t ≥ 2, every finite set T of odd primes then satisfies ∑

Selectable PDF notation • transcription unchecked
∑ ∑

log ℓ s_{ℓ}^{−}(E, e) ≤3nt^{2} log(tF) + 240 ℓn^{2}t^{2} log^{2}(tℓF).

Selectable PDF notation • transcription unchecked
ℓ∈T 1≤e<t_{ℓ}ℓ_{̸=2}|o

Proof. Split T according as ℓ | n. For each 1 ≤ e < t, Proposition 8.15 bounds the part prime to n by n log b(F, e + 1). Since F ≥1, t ≥2, e + 1 ≤t,

Selectable PDF notation • transcription unchecked
16F^{e+2}(e + 1)! ≤(tF)^{4}(tF)^{t+1}(tF)^{t}= (tF)^{2t+5}.

Summing its logarithm over the t −1 twists gives at most

n(t −1)(2t + 5) log(tF) ≤3nt^{2} log(tF);

the last inequality follows from 3t^{2}−(t −1)(2t + 5) = t^{2}−3t + 5 > 0. For a prime dividing n, (207) is at most 240ℓn^{2}t log^{2}(tℓF) per twist. There are at most t twists. Every odd prime dividing n divides o, by the host-index divisibility n | 2^{a+2}o proved above. Enlarging the remaining nonnegative sum to those primes proves the formula.

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/OddResidueBounds/ThmBcOfPsiBound.lean:147--297