Skip to content

Section 4.5 · PDF pages 80–82

The numerical bounds in cases II, III and V

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

4.5 The numerical bounds in cases II, III and V

The uniformity in the preceding symplectic estimate also has a purely numerical part. We give its actual power bound, since allowing a coefficient-dependent exponent at this point would not suffice.

Proposition 4.19 (Absorbing the symplectic level factors). Fix χ, put o = ord χ, m = cond χ, P = p_{1}(χ), and f = φ(4o). For any natural constants C, A there is C^{′}, depending only on these fixed data, such that for a host character, ℓ odd, e ≥2, and either (n^{′}, p_{1}) = (n_{II}, 1) or (n_{III}, P),

Selectable PDF notation • transcription unchecked
′ ( ′

2C(ℓ−1)2^{n}(2o) ℓ2^{n}Np_{1}(e + 1))^{A} log p_{0}(ℓNp_{1})

Selectable PDF notation • transcription unchecked
≤(ℓNe)^{C′}. (84)

Here p_{0}(u) is the least prime at least five not dividing u.

Proof. Set X = ℓNe ≥ 16. The host subgroup conditions give o ≤ m ≤ N, and 2^{c2} ≤ N, since that dyadic conductor divides N. They also give

Selectable PDF notation • transcription unchecked
2^{n0}< ℓ^{f}. (85)

To check this last assertion, let b be the order of the character part called th1, obtained after removing the ℓ-power-order part and the dyadic domain component. On the conductor component its order divides o; on either extra host-prime component it divides two. Thus b | 2o and ℓ∤b. Put M = lcm(4, b). Then M | 4o and ℓ is a unit modulo M. Its order f_{0} is positive and divides φ(M), by Euler’s theorem. The elementary prime-power formula for the totient gives φ(M) | φ(4o) when M | 4o. Consequently f_{0} ≤f. By definition,

2^{n0} is the largest power of two dividing ℓ^{f0}−1. This positive integer is strictly smaller than ℓ^{f0}, proving (85).

For every positive integer u, minimality of b = ⌈log_{2} u⌉ gives 2^{b}≤2u: if u = 1 this is immediate, and otherwise 2^{b−1}< u. Using (85), the two arguments of the maximum defining n_{II} are bounded respectively by X^{2+2f} and 64X^{7}. After the ceiling factor two these are at most X^{2f+10}, since 2 ≤X and 128 ≤X^{2}. Similarly the arguments for n_{III} are at most X^{1+m+P+2f} and X^{5}: here we used m ≤X^{m} and P ≤X^{P}, valid for X ≥2. Thus, for

Selectable PDF notation • transcription unchecked
a = (2f + 10) +(1 + (10 + m + P + 2f)), B = 1 + P,

both cases give 2^{n′}≤X^{a} and p_{1} ≤B ≤X^{B}. All these exponents depend only on χ.

Now bound the four factors on the left of (84) separately:

Selectable PDF notation • transcription unchecked
2C ≤X^{2C},
(ℓ−1)2^{n′}(2o) ≤X^{1+a+2o},
ℓ2^{n′}Np_{1}(e + 1) ≤X^{1+a+1+B+2}.

For the third inequality e + 1 ≤X^{2}, and the fixed factor 2o in the second is bounded by X^{2o}. Bertrand’s postulate gives p_{0}(u) ≤2u + 10: for u ≥4 choose a prime between u and 2u, and for u = 1, 2, 3 use five. With u = ℓNp_{1} ≤X^{1+1+B} and log y ≤y,

log p_{0}(u) ≤X^{2+(1+1+B)+10+1}.

Indeed 2X^{1+1+B}+ 10 ≤16X^{1+1+B} and 16 ≤X^{4}; the displayed exponent is larger than 4 + (1 + 1 + B). Multiplying the nonnegative bounds proves the assertion with exactly the source’s permissible exponent

Selectable PDF notation • transcription unchecked
C^{′}= 2C + (1 + a + 2o) + (1 + a + 1 + B + 2)A +(2 + (1 + 1 + B) + 10 + 1).

[Lean: GradeZeroInterpolatingElement.arith, Development/AutomorphicArithmetic/AutomorphicVarieties/SymplecticGSp4/TwoPowClogLe.lean, 10–218; the dyadic-order bound is Development/AutomorphicArithmetic/AutomorphicVarieties/HeightAndVanishing/CmDatumCharTwoAdicOrderBounds.lean, 7–86.]

Lemma 4.20 (The final case-V normalization). Let a, V, E be nonnegative integers, s, L real numbers, and X ≥2. Suppose a ≤V , V ≤2Es, L ≥0 and sL ≤X^{C}. Then, with the source’s convention a/0 = 0,

Selectable PDF notation • transcription unchecked
_{E }^{a}L ≤X^{C+1}.

Proof. If E = 0, the left side is zero and the conclusion follows from X^{C+1} ≥ 0. If E > 0, divide a ≤V ≤2Es by E and multiply by L ≥0. The result is at most 2sL, then 2X^{C}, then X X^{C} = X^{C+1}, using X ≥2.

In the actual application a is the strict cohomology length, E = E_{𝒪}, V is the finite length bound furnished by the graded deformation argument, and

Selectable PDF notation • transcription unchecked
∑ ( )

s = v_{ℓ} tr r_{i}(ϕ) − tr r_{0}(ϕ) , L = log ℓ, X = ℓNe.

Selectable PDF notation • transcription unchecked
i

The deformation comparison supplies a ≤V ≤2Es for a finite list of pairwise nonisomorphic representations; the congruence-number estimate supplies s log ℓ≤X^{C} for that same list and separating element ϕ. The lemma proves the complete numerical last step of CountV. The existence, pairwise

nonisomorphism, rigidity, length comparison, and separating-Frobenius congruence-number bound for that common finite list are proved in Subsection 4.14 (Propositions 4.71–4.74 and Theorem 4.75), closing CountV and completing the F8 window stream into VWin. [Lean: countV_of_finiteness_duality_euler_host, Development/AutomorphicArithmetic/AutomorphicVarieties/ModularityArgument/ThresholdArguments/DenseThresholdCases/CountVOf.lean, 11–60; the finite-list deformation comparison is Development/AutomorphicArithmetic/AutomorphicVarieties/UnitaryThreeDeformations/AbstractCount.lean, 25–36, 141–164.]