propositionroutine
Formal group comparison of elliptic multiples
Formal group: and recovers
reads integer data off elliptic multiples locally
Proposition·
ell:formal·§2.1 Elliptic indices and the local comparisonStatement (paper)
There is a fixed finite set of rational primes with the following
properties. Let , let be any place of above ,
normalized by , and let , with . Assume
reduce to at . Then
For every integer , if in addition and ,
then and
Both assertions also hold at the same place after replacing
by and imposing the
corresponding reduction-to- hypotheses on the conjugate points.
Here and below the valuation of zero is , so is included.
In plain English
Outside a fixed finite set of primes , if and reduce to at a place above , then . If also and , then and agrees with modulo -valuation at least ; the same holds for the conjugates .
Why it's here
This is the local tool that turns elliptic-curve multiples into integer arithmetic. On the formal group the parameter behaves like up to higher-order terms, so ratios of parameters give the -adic valuation of exactly, and the truncated map recovers the rational to precision . The local comparison lemma and the simultaneous integer tests corollary use it to read off integer information at places of .
Classified routine:
A direct consequence of the standard theory of formal groups of elliptic curves, namely the formal logarithm and on for good reduction primes, as in Silverman's Arithmetic of Elliptic Curves, Ch. IV and VII. The truncated-logarithm precision bound is a standard computation once .
Uses
Nothing else in the paper
Used by
Sources
PaperOpen
- Section
- §2.1 Elliptic indices and the local comparison
- Page
- —
- Label
ell:formal- Line
sections/02-reduction.tex:109
Leannot aligned
Phase 2 aligns this node to a Lean declaration.