Section 4.2 · PDF pages 67–68
Changing coefficients in the remaining counts
The notation transcription is provisional. Check it against the printed mathematics when citing or reusing a formula.
4.2 Changing coefficients in the remaining counts
Let 𝒪 ⊂ ℚ_{ℓ} be one of the coefficient rings: a discrete valuation ring finite over ℤ_{ℓ}. Write E_{𝒪} = length_{𝒪}(𝒪/ℓ). For a discrete Galois module with coefficients Frac(𝒪)/𝒪, normalize its cohomology length by dividing by E_{𝒪}. This is the normalization of v_{ℓ} used above.
Lemma 4.7 (Coefficient independence of the normalized lengths). Suppose two finite coefficient rings 𝒪, 𝒪^{′} and their characters have the same values in ℚ_{ℓ}. The corresponding strict cohomology kernels have finite length simultaneously, and their normalized lengths are equal.
Proof. First suppose 𝒪 ⊆𝒪^{′}. The second ring is finite and torsion free over the first, and hence finite free, because the first is a discrete valuation ring. Its positive rank makes the extension faithfully flat. Write d for the relative ramification index. Tensoring the coefficient exact sequence with 𝒪^{′} identifies
Selectable PDF notation • transcription unchecked
( )
𝒪^{′}⊗_{𝒪} Frac(𝒪)/𝒪 ≃ Frac(𝒪^{′})/𝒪^{′}.
This is compatible with the Galois action: both characters have the same values under the inclusion, and so do their inverse and cyclotomic twists.
Choose a finite free basis of 𝒪^{′} over 𝒪. Continuous cochains with the extended discrete coefficients are then finite direct sums of the original cochains. This identification commutes with the coboundary operators and all local restriction maps. The same finite direct sum commutes with the product of the local terms. Flatness preserves kernels and images, so it identifies the strict cohomology kernel M^{′} over 𝒪^{′} with 𝒪^{′}⊗_{𝒪}M. The strict local conditions are therefore preserved, rather than replaced by unrestricted cohomology.
If M has a composition series, each simple factor is the residue field 𝒪/ϖ. Its tensor extension is 𝒪^{′}/ϖ𝒪^{′}, of length d over 𝒪^{′}, since ϖ is a unit times the dth power of a uniformizer of 𝒪^{′}. Exactness along the series gives
length_{𝒪}′ M^{′}= d length_{𝒪} M.
Finiteness is also reflected. Tensoring any strictly increasing finite chain of submodules with a faithfully flat module keeps its successive quotients nonzero. Thus arbitrarily long strict chains in M give such chains in M^{′}. A module of finite length cannot have them. This proves the equivalence of finite length, including the case in which the allowed extended length is infinite.
The same uniformizer computation applied to ℓ gives E_{𝒪}′ = dE_{𝒪}. Dividing the two length identities proves equality of normalized lengths when they are finite. If they are infinite they are infinite on both sides; the source’s separate conversion to a real value agrees as well because it uses the same convention on both infinite lengths.
For arbitrary 𝒪, 𝒪^{′}, take the ring of integers in the compositum of their fraction fields inside ℚ_{ℓ}. This is again a finite coefficient ring and contains both rings. Extend the two characters to it; they agree because their values in the ambient field agree. Apply the inclusion case to each and combine the two equalities.
[Lean: coefIndep, Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/CoefIndep.lean, 8–94, via the coefficient extension of the strict local kernel in Development/AutomorphicArithmetic/AutomorphicVarieties/GaloisLibrary/SelmerTransport/QoExt.lean.]
Lemma 4.8 (The host conditions survive coefficient extension). An inclusion of finite coefficient rings pre-serves the conductor, order and parity of a Dirichlet character, membership in a host character set, its case-II or case-III condition, and the two integers n_{II}, n_{III} used in the symplectic count.
Proof. The extended character is the composite with an injective ring map, which maps 0, 1, −1 to the same elements. An element is in its unit-character kernel exactly when it was in the original kernel. The equality ψ^{j} = 1 is also unchanged for every j, proving order preservation. Factoring through a smaller modulus means that this same unit character kills the kernel of reduction to that modulus; hence the possible
conductors, and their minimum, are unchanged. The equality ψ(−1) = (−1)^{e} is reflected by injectivity, giving parity preservation.
The host character set is specified by that parity and triviality on the host subgroup. Both have just been preserved. Projection to the ℓ-primary component of the domain and taking powers, products or inverses all commute with the inclusion. Consequently the source’s decomposed characters, including ψ^{(ℓ)}, have the same orders and conductors after extension. Case II requires e ≥ 2, even order of ψ^{(ℓ)}, and either ℓ exceptional or ℓ−1 | 2e. Case III requires ℓ nonexceptional, ℓ−1 | 2e, odd order of ψ and ψ ̸= 1. These are therefore all preserved.
Finally put c_{2} = ord_{2} cond ψ_{2} and let n_{0} be the source’s 2-adic order of ℓ^{f0}−1, where f_{0} is the order of ℓ modulo the least common multiple of 4 and the order of the indicated prime-to-ℓ character part. All these quantities are unchanged by what was proved. Thus so are
Selectable PDF notation • transcription unchecked
⌈ ⌉
n_{II} = log_{2} max{ℓN4^{n0}, 2^{c2+6}oℓ^{3}m^{2}} ,
Selectable PDF notation • transcription unchecked
⌈ ⌉
n_{III} = log_{2} max{ℓmp_{1}4^{n0}, 8ℓ^{2}} .
The ceiling logarithm here means the least natural b with the positive integer inside at most 2^{b}, which is the source’s clog definition.
[Lean: The injective coefficient checks and their use are in Development/AutomorphicArithmetic/AutomorphicVarieties/SymplecticGSp4/ConductorAtMapInjectiveCoeff.lean, 6–90, 159–186; the case and exponent definitions are Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/DirichletPrimeToLPartMulLPowerPart.lean, 206–225.]
Proposition 4.9 (Descending the case-II and case-III bound). Suppose that for each χ a single exponent C bounds v_{ℓ}(e, ψ) log ℓ by (ℓNe)^{C} in cases II and III, for every host and all the stated parameters, whenever the coefficient ring contains all 2^{nII}th and 2^{nIII}th roots of unity. Then the same exponent gives the bound and finite length over every coefficient ring. In particular this implication supplies both CountII and CountIII from that enlarged-coefficient estimate.
Proof. Fix a host, coefficient prime, coefficient ring and character in either case. In a finite extension of the coefficient fraction field adjoin all 2^{nII+nIII}th roots of unity. Its ring of integers, taken inside ℚ_{ℓ}, is a finite coefficient ring containing the original one and the two smaller root groups. Lemma 4.8 shows that the character still lies in the same host set and case, and that the required two exponents have not changed. The assumed estimate therefore applies over this enlarged ring. Lemma 4.7 transports both its finite-length assertion and its normalized length back to the original ring. The right side (ℓNe)^{C} is unchanged. This proves the common bound in the disjunction of the two cases; restricting it to either disjunct gives the two assertions separately. The exponent was chosen before the host and coefficient extension, so its required uniformity is preserved.
[Lean: GradeZeroInterpolatingElement.main, Development/AutomorphicArithmetic/AutomorphicVarieties/SymplecticGSp4/ConductorAtMapInjectiveCoeff.lean, 152–192. Its enlarged-coefficient estimate main_big (91–150) and dense-threshold realization sp4Main_alt / countII_and_countIII_of_printsH_of_sp4In are proved in Subsection 4.13 (Propositions 4.64–4.68 and Theorem 4.69).]