Skip to content

Section 8.4 · PDF pages 473–475

Restriction estimates used in the plus part

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

8.4 Restriction estimates used in the plus part

Fix an odd prime ℓ. Let O be the ring of integers of a finite extension of ℚ_{ℓ}, put D_{O} = O ⊗_{ℤℓ}(ℚ_{ℓ}/ℤ_{ℓ}), and set e_{O} = length_{O}(O/ℓO). For a finite-order character ϕ_{G} : G_{ℚ} → O^{×}, put M_{e,ϕ} = D_{O}(ϕ^{−}_{G}^{1}χ^{−}_{ℓ}^{e}). Let 𝒮_{n}(M) be the subgroup of H^{1}(G_{ℚ}, M) consisting of classes that vanish on every inertia group and on decomposition groups above primes dividing n. For a Dirichlet character ϕ modulo N, write

_{vℓ(e, ϕ) =} length_{O} 𝒮_{ℓN}(M_{e,ϕ})

Selectable PDF notation • transcription unchecked
e_{O}^{.}

We use this real number only after proving its numerator finite. The normalisation is by e_{O}, rather than by the degree of the coefficient field.

Lemma 8.7 (A scalar restriction kernel). Let R be a discrete valuation ring and M an R-module all of whose cyclic submodules have finite length. Suppose G acts continuously on the discrete module M by scalars, U ⊴G, G/U is abelian, and a finite set T ⊂G generates a dense subgroup modulo U. Then

length_{R} ker[H^{1}(G, M) →H^{1}(U, M)] ≤|T| length_{R} M^{G}.

Proof. Write gm = c(g)m, and let a generate the ideal generated by all c(g) −1. Let Z be the module of continuous cocycles vanishing on U. Subtracting a coboundary shows that Z surjects onto the kernel in the statement. Evaluation Z →M^{T} is injective: the zero set of a cocycle vanishing on U ∪T is a closed subgroup containing a dense subgroup of G. Thus all cyclic submodules of Z have finite length. Comparing z(gh) and z(hg) gives

Selectable PDF notation • transcription unchecked
(c(g) −1)z(h) = (c(h) −1)z(g),

since the commutator belongs to U, where z vanishes. Hence (c(g)−1)z is a coboundary, and the restriction kernel is a quotient of Z/aZ.

For such a module Z, length(Z/aZ) ≤ length Z[a]. Indeed a finite-length submodule F has length(F/aF) = length F[a], so its image in Z/aZ has length at most length Z[a]. If this bound is finite, say b, but the quotient had length greater than b, successively adjoining representatives outside the preceding image would give a finitely generated, finite-length submodule whose image has length at least b + 1, a contradiction. The inequality is automatic for an infinite bound. Finally evaluation embeds Z[a] into M[a]^{T}, and M[a] = M^{G} by the definition of a.

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/GaloisLibrary/SelmerTransport/KerResAb.lean:6--151; Development/AutomorphicArithmetic/AutomorphicVarieties/GaloisLibrary/SelmerTransport/LenCokerLe.lean:5--96

For e ≥1, put

Selectable PDF notation • transcription unchecked
{

max(v_{ℓ}(N), 1) + v_{ℓ}(e), ℓ| N or ℓ−1 | e,

Selectable PDF notation • transcription unchecked
ν_{ℓ}(N, e) =

0, otherwise.

Lemma 8.8 (The invariant term). If ϕ_{G} factors through the cyclotomic character modulo N, then

length_{O} M_{e,ϕ}^{Gℚ}≤e_{O}ν_{ℓ}(N, e).

For N ≥2, also ν_{ℓ}(N, e) ≤2Ne.

Proof. Inertia at ℓ maps onto ℤ^{×}_{ℓ} under χ_{ℓ}. At finite level this follows because Φ_{ℓ}r(X +1) is Eisenstein at ℓ, giving a totally ramified extension of degree φ(ℓ^{r}). At the inverse limit, the successive congruence-preimage sets for a prescribed unit are nested nonempty closed subsets of compact inertia. Inertia fixes roots of unity of order prime to ℓ: their reductions are distinct, since X^{b}−1 has nonzero derivative at each root when (b, ℓ) = 1. Write N = ℓ^{v}b, (b, ℓ) = 1. For each u ≡1 (mod ℓ^{v}), choose an inertia element with cyclotomic character u. It fixes both the ℓ^{v}-th and the b-th roots of unity. Thus

χ_{ℓ}(I_{ℓ}∩ ker cls_{N}) ⊇1 + ℓ^{v}ℤ_{ℓ},

with the right side interpreted as all units when v = 0. The finite character is trivial on this subgroup, so every global invariant is killed by its u^{e}−1.

If v > 0, take u = 1 + ℓ^{v}; if v = 0 and ℓ−1 | e, take u = 1 + ℓ. For odd ℓ, lifting the exponent gives v_{ℓ}(u^{e}−1) = max(v, 1) + v_{ℓ}(e). This follows by the binomial expansion first for exponents prime to ℓ, and then by v_{ℓ}(w^{ℓ}−1) = v_{ℓ}(w −1) + 1; the linear term has uniquely least valuation in each required expansion. If v = 0 and ℓ−1 ∤e, a lift of a generator of 𝔽^{×}_{ℓ} has u^{e} −1 a unit. The invariants are therefore contained in D_{O}[ℓ^{ν}], of length e_{O}ν. Finally ν ≤N +1+e ≤2Ne, because 2Ne−N −e−1 = (N −1)(e−1)+Ne−2 ≥

Selectable PDF notation • transcription unchecked
0.

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/CharacterLevelBounds/H0LocalCardBoundedOfClsKerLeKer.lean:10--23; Development/AutomorphicArithmetic/AutomorphicVarieties/GaloisLibrary/GaloisCohomologyLength/NuLeBound.lean:16--81

Proposition 8.9 (Descent from a cyclotomic layer). Let a host h = (ψ, a, q, d) have level N = N(a, q, d), with q, d > 2t + 1, m. Let ℓ< q, d be an odd prime and j ≥0. Assume every cyclotomic layer L_{1}/ℚ(µ_{ℓm}) of degree ℓ^{j} satisfies ∑

Selectable PDF notation • transcription unchecked
s_{ℓ}(L_{1}, e) ≤B < ∞.
1≤e<t

Let ϕ be a character modulo N trivial on the host subgroup. Remove from its prime-to-ℓ part the component supported on the ℓ-primary factor of (ℤ/N)^{×}. If the resulting character has odd order, then

Selectable PDF notation • transcription unchecked
∑ v_{ℓ}(e, ϕ) ≤B + (Nt)^{ℓmℓj+3},
1≤e<t

and every length on the left is finite.

Proof. First cond ϕ | m. The 2-component of its ℓ-power-order part is trivial, since it has both 2-power and ℓ-power order. Thus the 2-component of the character in the hypothesis is that of ϕ; having odd and 2-power order, it is trivial. At q, d, the host condition makes the component of ϕ have order dividing 2. Its ℓ-part is trivial and removing the component at ℓ does not change it. It also has odd order, and is trivial. At every remaining prime the prime-power part of N is that of m. The Chinese remainder decomposition of characters proves the conductor assertion.

Choose a cyclotomic layer L_{1}/ℚ(µ_{ℓm}) of degree ℓ^{j}. Such layers exist because a number field contains only finitely many roots of unity and, after its largest contained ℓ-power root, adjoining the next root has degree ℓ. Successive steps give any prescribed height. Thus [L_{1} : ℚ] ≤ℓmℓ^{j} =: n_{1}, and ϕ_{G} is trivial on G_{L1}. Restriction maps the Selmer group defining v_{ℓ} into the unramified, split-above-ℓ group over L_{1}. There the finite character has become trivial. Coefficient extension multiplies lengths by e_{O}: tensor a composition series over ℤ_{ℓ} with the finite free module O, and use length_{O}(O/ℓO) = e_{O}. It commutes with continuous cocycles and the local kernels, since finite free coefficient extension is exact. Lemma 8.7, with the whole finite abelian group Gal(L_{1}/ℚ) as a generating set, and Lemma 8.8 give

Selectable PDF notation • transcription unchecked
v_{ℓ}(e, ϕ) ≤s_{ℓ}(L_{1}, e) + n_{1}ν_{ℓ}(N, e).

In particular the left side is finite. Summing the last term,

Selectable PDF notation • transcription unchecked
∑ n_{1}ν_{ℓ}(N, e) ≤2n_{1}Nt^{2}≤(Nt)^{n1+3}.
1≤e<t

Here Nt ≥2, 2n_{1} ≤2^{n1+1}≤(Nt)^{n1+1}, and Nt^{2}≤(Nt)^{2}.

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/HostOdd.lean:12--111; Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/IvField.lean:12--82; Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/CountIV.lean:39--89