20/07/15 22:22:21.33 hRRJMwM+.net
>>148 追加
URLﾘﾝｸ(en.wikipedia.org)
Tate's algorithm
(抜粋)
In the theory of elliptic curves, Tate's algorithm takes as input an integral model of an elliptic curve E over {\displaystyle \mathbb {Q} }\mathbb {Q} , or more generally an algebraic number field, and a prime or prime ideal p. It returns the exponent fp of p in the conductor of E, the type of reduction at p, the local index
c_p=[E(Q_p):E^0(Q_p)],
where E^0(Q_p) is the group of Q_p-points whose reduction mod p is a non-singular point.
Also, the algorithm determines whether or not the given integral model is minimal at p, and, if not, returns an integral model with integral coefficients for which the valuation at p of the discriminant is minimal.
Tate's algorithm also gives the structure of the singular fibers given by the Kodaira symbol or Neron symbol, for which, see elliptic surfaces: in turn this determines the exponent fp of the conductor E.
Tate's algorithm can be greatly simplified if the characteristic of the residue class field is not 2 or 3; in this case the type and c and f can be read off from the valuations of j and Δ (defined below).
Tate's algorithm was introduced by John Tate (1975) as an improvement of the description of the Neron model of an elliptic curve by Neron (1964).
Contents
1 Notation
2 The algorithm
3 Implementations
Implementations
The algorithm is implemented for algebraic number fields in the PARI/GP computer algebra system, available through the function elllocalred.