Skip to content

Section 7.10 · PDF pages 423–424

Congruences, trace limits and the final row

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

7.10 Congruences, trace limits and the final row

The notion of approximation used here is stronger than ordinary pointwise approximation of Hecke eigen-values. If θ : J →ℚ_{ℓ} and η_{i} : J →ℚ_{ℓ}, the source’s condition is

∀ε > 0 ∃F ⊂I finite, (c_{i})_{i∈F} , ∀P ∈ℤ[X_{j} : j ∈J],

Selectable PDF notation • transcription unchecked
|||||P(θ) −∑c_{i}P(η_{i})||||| ≤ε.^{(195)}
i∈F_{ℓ}

One finite combination must work for every integer polynomial. The same definition applies to a specified subfamily by requiring F to lie in that subfamily.

Source: AbelianVarietyTheory/Definitions/GaloisGeometry/ PolyApproxZeroPadic.lean:10--19.

Lemma 7.88 (Combining congruences while keeping genericity). Write θ ∈𝒫(S) for (195) using eigen-characters from S. This operation is transitive. Moreover, if η ∈𝒫(T) and an integer polynomial Q satisfies Q(η) ̸= 0, then

Selectable PDF notation • transcription unchecked
η ∈𝒫{ν ∈T : Q(ν) ̸= 0}.

Consequently, if θ ∈𝒫(S) and every η ∈S has Q(η) ̸= 0 and lies in 𝒫(T), then θ is approximated using only the ν ∈T for which Q(ν) ̸= 0.

Proof. For the nonvanishing restriction, approximate η to error ε|Q(η)|_{ℓ}. Replace each coefficient c_{ν} by c_{ν}Q(ν)/Q(η), discarding terms with Q(ν) = 0. Apply the original inequality to PQ and divide by Q(η). For every integer polynomial P, the new error is at most ε. The same new coefficients work for every P.

For transitivity, choose an approximation to θ with error ε/2, finite support S_{0} ⊂ S and coefficients c_{η}. Put M =∑_{η∈S0}|c_{η}|_{ℓ}. Approximate each η ∈S_{0} from T, uniformly over all integer polynomials, to error ε/(2(M + 1)). Substitute these finite combinations in the first one, adding coefficients when a term is repeated. The triangle inequality bounds the error by

Selectable PDF notation • transcription unchecked
ε_{+ M} ε_{≤ε.}
2  2(M + 1)

This proves transitivity and, with the first assertion, the last claim.

Source: Foundations/GaloisRepresentations/SeparatingAlgebras/ Combine.lean, private polyApprox_cut, polyApprox_trans and combine_pf.

The elliptic local-type perturbation has an explicit finite character calculation. Choose a small torsion-free compact open subgroup J ⊂ GL_{a}(E_{w0}) and a surjection ϑ : J →ℤ/ℓ^{m}ℤ, for which every nontrivial character eigenspace in an irreducible local representation forces that representation to be cuspidal. Choose J inside the stabilizer of a given algebraic automorphic form f. The finite-level construction gives a label b(g) ∈ ℤ/ℓ^{m}ℤ, constant on left rational cosets and at infinity, with b(gc) = b(g) + ϑ(c) on the chosen level subgroup. For each character ξ of this cyclic group, the function F_{ξ}(g) = ξ(b(g))f(g) is therefore an algebraic automorphic form of the same weight and has that local character type. Set

Selectable PDF notation • transcription unchecked
G = −∑F_{ξ}.
ξ̸=1

The elementary character sum gives

Selectable PDF notation • transcription unchecked
_{f(g) −G(g) =}{ℓ^{m}f(g), b(g) = 0,
0, b(g) ̸= 0.

Thus every constituent used for G has the required elliptic local type, while its error relative to f is bounded by |ℓ|^{m}_{ℓ} times the coefficient norm of f. Taking m above any prescribed lower bound makes the error arbitrarily small. The source’s torsion-free condition ensures the finite character label descends through the arithmetic stabilizers; the construction of such labels is an input to this perturbation, not an arbitrary global character assigned to J.

Source: SeparatingAlgebras/TyStep.lean:12--92; IntegralStructures/CongruenceOddLevel/NotApartOfOverPair.lean:76--112.

The weight-changing approximation first alters the weight only at the conjugate pair of embeddings over v^{′}, giving the large-gap weight there. The elliptic perturbation above is then made at w_{0}, keeping that weight. The source checks that the integral bounds for the Hecke operators survive this weight change: an operator component at an altered embedding is the identity, by the place-separation condition on its support. Thus the changed weight cannot alter the denominator contribution of that component.

To impose generic Satake parameters at finitely many places Z, the source uses one test operator at each z ∈Z whose eigenvalue is nonzero exactly when the chosen nonzero genericity polynomial is nonzero on the Satake parameter. Append these test eigenvalues, and the scaled Satake power sums at all controlled places above ℓ, to the original Hecke family. The scalars are chosen nonzero so the enlarged operators preserve the required integral bounds. Apply the weight and elliptic approximations to this entire family. In Lemma 7.88 take Q to be the product of the appended test-eigenvalue variables. It retains simultaneous nonvanishing at every z, while retaining approximation of every polynomial in all the other eigenvalues and power sums. Restricting back to those other coordinates is legitimate by renaming variables in the defining polynomial inequality. For the odd-seed version, replace Z by Z ∪W, where W is the finite set of controlled places above ℓ; this imposes their needed genericity too.

Source: IntegralStructures/CongruenceOddLevel/ NotApartOfOverPair.lean:114--269, proofs congUWG_of and CongUWG.congUW4.

All four remaining congruence-density suppliers – the arbitrarily deep torsion-free elliptic local types (J, ϑ), their compatible global finite character labels descending through arithmetic stabilizers, the lacunary weight-changing approximation with support restriction, and the simultaneous Satake-genericity density to-gether with integral test and scaled power-sum operators – are proved unconditionally in Subsection 7.11 (Propositions 7.89–7.94), closing congUWG_of, CongUWG.congUW4, and the unconditional instantiation CongFinOdd in Theorem 7.95.