claimroutine
Uniform ramification cut for beta
Gives uniform ramification cut killed by at small primes
controls wild ramification of beta at small primes
Claim·§4.8 A uniform bound for the modular level·inside lemModular level is polynomially bounded in M
Statement (paper)
Fix a prime of -type smaller than the fixed constant, a place of above , and put . Then there is a bound , independent of (depending only on the finitely many possible embedded fields and on the uniformly bounded -unit conductor of ), such that for every the upper ramification group lies in and is killed by the character ; in particular kills for a uniform integer .
In plain English
For a fixed small prime of -type and a place of above it, with , there is a bound independent of such that for all the upper ramification group lies in and is killed by . In particular kills for some uniform integer .
Why it's here
This controls the wild ramification of the square-root cochain at small primes uniformly in . The bound uses only that finitely many local fields occur and that the -unit conductor of is uniformly bounded (from the sign-splitting lemma), and it feeds the uniform conductor bound at small primes used to get the level bound .
Classified routine:
Follows from local class field theory and standard facts on upper ramification groups (e.g. Serre, Local Fields): there are finitely many local fields F/Q_q of bounded degree, and the Q_q-unit conductor of chi is uniformly bounded by the sign-splitting lemma, which together give a uniform cutoff.
Uses
Used by
Sources
PaperOpen
- Section
- §4.8 A uniform bound for the modular level
- Page
- —
- Label
—- Line
sections/04-height.tex:1074
Leannot aligned
Phase 2 aligns this node to a Lean declaration.