Section 8.9 · PDF pages 484–485
The numerical closure of the cohomology bound
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
8.9 The numerical closure of the cohomology bound
For E, n, D ≥1, set ( )
K_{C}(E, n, D) = exp (2En)^{C} log(2D) .
The uniform statement called Lemma K is that some absolute C_{K} makes
Selectable PDF notation • transcription unchecked
|| ||
H_{cts}^{2} (G_{L,Sℓ}, ℤ_{ℓ}(E + 1)) finite, log H_{cts}^{2} (G_{L,Sℓ}, ℤ_{ℓ}(E + 1)) ≤K_{CK}(E, [L : ℚ], |∆_{L}|) (210)
for every totally complex L, E ≥1, and every ℓ such that µ_{ℓ}⊂L, with µ_{4} ⊂L required when ℓ= 2.
The source’s final use of duality has a particularly concrete form. Write s = s_{ℓ}(L, E). The finite-level Poitou–Tate and local Tate-duality calculations give
Selectable PDF notation • transcription unchecked
∑
length H^{2}(G_{L,Sℓ}, ℤ_{ℓ}(E + 1)) + length H^{0}(G_{L,Sℓ}, ℚ_{ℓ}/ℤ_{ℓ}(−E)) = s + length H^{0}(G_{Lv}, ℚ_{ℓ}/ℤ_{ℓ}(−E)).
Selectable PDF notation • transcription unchecked
v|ℓ (211)
The local sum is at most n(2 + ⌊log_{ℓ}n⌋+ E), where n = [L : ℚ]. Thus a uniform bound for s log ℓ gives one for the logarithmic order of H^{2}, with a polynomial extra term. The absence of real places is used in this duality step.
Proposition 8.21 (What the tower and torsion estimates imply). Suppose the following arithmetic assertions have been proved. For every L, ℓ, E as above there is a totally complex cyclotomic extension L^{′}/L, with n^{′}= [L^{′}: ℚ], D^{′}= |∆_{L}′|, d = [L^{′}: L], and largest root level c, such that
Selectable PDF notation • transcription unchecked
2E + 1 < ℓ^{c}, 2E + 1 < r_{2}(L^{′}), d ≤(n + 1)(4E + 4), ℓ^{c}≤2n^{′}, D^{′}≤D^{d}(ℓ^{c})^{n′},and s_{ℓ}(L, E) ≤s_{ℓ}(L^{′}, E). Suppose the class-counting argument gives finiteness and
Selectable PDF notation • transcription unchecked
ℓ^{sℓ(L′,E)}≤T_{2E+1}(L^{′}, 4E + 6) T_{2E}(L^{′}, 4E + 6) ℓ^{X},where
b = 2E + (2E + 1)(c + 2E + 1), f = v_{ℓ}(E), X = (b + f)g + c + f, g = 2n^{′}+ ⌊log_{2} h_{L}′⌋+ 2.
Suppose further that, for an absolute C_{0},
log T_{m}(L^{′}, 4E + 6) ≤K_{C0}(E, n^{′}, D^{′}) (m ≤2E + 1), g ≤2n^{′}+ 4n^{′} log(2D^{′}) + 2.
Then s_{ℓ}(L, E) is finite and
Selectable PDF notation • transcription unchecked
( )
s_{ℓ}(L, E) log ℓ≤K_{C}(E, n, D), C = 5 max(C_{0}, 9) + 2 + 11.
Together with (211) and its stated local bound, this implies (210) after increasing the absolute exponent.
Proof. Set u = 2En^{′}≥2, Y = log(2D^{′}) > 1/2. The root bound implies c, ℓ≤2n^{′}≤u; also f < E ≤u, log ℓ≤u, b ≤u + 2u^{2}, and g ≤u + 2uY + 2. In particular
Selectable PDF notation • transcription unchecked
b + f ≤3u^{2}, g ≤6uY, c + f ≤4uY.It follows that
X log ℓ≤19u^{4}Y ≤u^{9}Y.
Taking logarithms of the class-counting bound gives
s_{ℓ}(L^{′}, E) log ℓ≤2e^{uC0Y} + u^{9}Y ≤e^{umax(C0,9)+2Y}.
For the last inequality put A = u^{max(C0,9)}Y ≥ 1. Then 2e^{A}+ A ≤ e^{4A}, using e^{3A} ≥ 3A + 1, and
Selectable PDF notation • transcription unchecked
_{4A ≤u}max(C_{0},9)+2_{Y .}It remains to descend this bound to L. Put x = 2En ≥2, Y_{0} = log(2D) > 1/2. The degree assumptions give
Selectable PDF notation • transcription unchecked
d ≤8x, n^{′}≤4x^{2}, 2En^{′}≤x^{5}.Writing w = ℓ^{c}≤2n^{′}≤8x^{2}, the discriminant bound gives
log(2D^{′}) ≤ log 2 + d log D + n^{′} log w ≤Y_{0} + 8xY_{0} + 32x^{4}≤73x^{4}Y_{0} ≤x^{11}Y_{0}.
Thus for every A ≥0,
Selectable PDF notation • transcription unchecked
K_{A}(E, n^{′}, D^{′}) ≤K_{5A+11}(E, n, D).Use A = max(C_{0}, 9) + 2 and the assumed monotonicity of s.
Finally let k be the H^{2}-length in (211). Its right side is finite, so H^{2} has finite length, hence finite order ℓ^{k}. Since ℓ≤n + 1 and ⌊log_{ℓ}n⌋ log ℓ≤ log(n + 1),
log |H^{2}| = k log ℓ≤s log ℓ+ n(E + 3) log(n + 1).
The extra term is bounded by K_{C}′(E, n, D)−K_{C}(E, n, D) for some absolute increase C^{′}−C. For an explicit choice, put A = max(C, 0); the extra term is at most 4x^{3}, while K_{A} = e^{xAY0} and e^{xA+9Y0} ≥e^{xAY0}+ 4x^{3} for x ≥2, Y_{0} ≥1/2, by e^{z}≥1 + z and (x^{9}−1)Y_{0} ≥4x^{3}. Thus C^{′}= A + 9 suffices.
Source: Development/AutomorphicArithmetic/AutomorphicVarieties/ModularityArgument/ClassCounting/NumThree.lean:211--378; Development/AutomorphicArithmetic/AutomorphicVarieties/ModularityArgument/ClassCounting/SFinal.lean:100--163
The remaining parts of this section establish the inputs of Proposition 8.21: the integral homology bound, the arithmetic cycles and class-character count, and the finite-level and duality passages. Their final assembly is Theorem 8.56.