Skip to content

Section 8.7 · PDF pages 481–482

The strict descent in the Euler-system estimate

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

8.7 The strict descent in the Euler-system estimate

Here is the algebraic step that turns the cyclotomic construction into (206). We state its arithmetic pre-requisites precisely so that the construction of the auxiliary classes cannot be replaced by the name of an Euler-system theorem. Let ℓ be odd, α : G_{ℚ} →O^{×}, and α^{∗} = χ_{ℓ}α^{−1}. Choose F = N_{0}ℓ^{m}, (N_{0}, ℓ) = 1, m ≥1, so that α ≡1 (mod ℓ^{m}) on the subgroup U fixing µ_{F} , and α ≡−1 (mod ℓ^{m}) on complex con-jugation. Suppose some α(g) −χ_{ℓ}(g) is a unit. Choose δ with α(δ) −1 a unit. Normalising a cocycle by c(δ) = 0 is then unique in its cohomology class.

For a_{0} ̸= 0, let 𝒞(n) consist of these normalised α-cocycles with a_{0}c = 0, unramified outside F, locally a coboundary of an a_{0}-torsion element at primes dividing F, and zero on decomposition groups at primes dividing n. Thus 𝒞(1) imposes no additional splitting primes. An admissible prime is q ≡ 1 (mod F), q ̸= r, with ℓ∤ ord_{q}(r). An admissible list has distinct such primes.

The source’s cyclotomic construction must supply maps ν_{L} on U, indexed by admissible lists, with the following properties. They are continuous homomorphisms killed by ℓ^{m}, equivariant under α^{∗}, and unramified outside Fr∏L. At a new prime q, their finite/singular relation is

ν_{qL}(τ_{q}) = u ν_{L}(Frob_{q}), u ∈O^{×}.

At the initial prime, ν_{∅}(τ_{r}) = u_{0}zw, where ann(w) = (ℓ^{m}) and z ̸= 0. The auxiliary-prime assertion must allow, for every nonzero c ∈𝒞(r∏L), a new q with

c(Frob_{q}) ̸= 0, ν_{L}(U) ⊆O ν_{L}(Frob_{q}).

The reciprocity assertion must give the following local consequence: if (a^{′}) = ann(ν_{qL}(U)), (a) = ann(ν_{qL}(τ_{q})), and a^{′}= ae, then

Selectable PDF notation • transcription unchecked
∏

e c(Frob_{q}) = 0 (c ∈𝒞(r L)).

These three assertions are the actual construction, choice, and reciprocity inputs used by the following argument.

Proposition 8.17 (The bounded increasing descent). Assume these assertions and a_{0}z | ℓ^{m}. Then

length_{O} 𝒞(1) ≤v_{O}(z).

Proof. For an admissible L, let (a_{L}) = ann(ν_{L}(U)) and put j(L) = v_{O}(a_{L}). Since ℓ^{m}ν_{L} = 0, a_{L} | ℓ^{m}, so j(L) ≤J := v_{O}(ℓ^{m}). Suppose a_{0} | a_{L} and 𝒞(r∏L) ̸= 0. Select a nonzero cocycle and the new prime in the choice assertion. The finite/singular relation and the generator condition make the annihilator of ν_{qL}(τ_{q}) equal to (a_{L}). Write a_{qL} = a_{L}e. Reciprocity annihilates every value c(Frob_{q}) by e. The evaluation map

Selectable PDF notation • transcription unchecked
∏

𝒞(r L) −→D_{O}, c −−→c(Frob_{q})

has image in D_{O}[e], of length v_{O}(e). Its kernel is 𝒞(rq∏L), because a cocycle unramified at q vanishes on the whole decomposition group if it vanishes at Frobenius. Hence

Selectable PDF notation • transcription unchecked
∏ ∏

length 𝒞(r L) ≤ length 𝒞(rq L) + v_{O}(e).

For the selected nonzero Frobenius value, e cannot be a unit. Thus j(qL) = j(L) + v_{O}(e) > j(L), and

Selectable PDF notation • transcription unchecked
∏ ∏

length 𝒞(r L) + j(L) ≤ length 𝒞(rq L) + j(qL).

Induction on the nonnegative integer J −j(L) proves that the left side is at most J: if the module is zero this is immediate; otherwise the strict increase permits the induction.

Write ℓ^{m} = zk. The initial value u_{0}zw has annihilator (k); hence a_{∅} = ke_{0} for some e_{0}. The same reciprocity/evaluation argument at r gives

length 𝒞(1) ≤ length 𝒞(r) + v_{O}(e_{0}).

Since a_{0}z | zk, a_{0} | k | a_{∅}; the induction applies to the empty list. It yields

length 𝒞(r) + v_{O}(k) + v_{O}(e_{0}) ≤v_{O}(ℓ^{m}) = v_{O}(z) + v_{O}(k).

Cancel the finite integer v_{O}(k), and combine with the preceding inequality.

Source: Development/AutomorphicArithmetic/AutomorphicVarieties/PrimitiveFrobeniusFixed/FrobFix.lean:68--305

The construction, reciprocity, and auxiliary-prime assertions are proved below in Proposition 8.73,

Proposition 8.75, and Lemma 8.74. The Bernoulli evaluation and residual case culminate in Theorem 8.78, which proves (206). The degree-divisible estimate is proved in Proposition 8.67, and the integral nonzero Bernoulli product and its size bound in Proposition 8.64.