Tate's algorithm

{{Short description|Algorithm in the theory of elliptic curves}} In the theory of elliptic curves, '''Tate's algorithm''' takes as input an integral model of an elliptic curve ''E'' over <math>\mathbb{Q}</math>, or more generally an algebraic number field, and a prime or prime ideal ''p''. It returns the exponent ''f''_''p'' of ''p'' in the conductor of ''E'', the type of reduction at ''p'', the local index

: <math>c_p=[E(\mathbb{Q}_p):E^0(\mathbb{Q}_p)],</math>

where <math>E^0(\mathbb{Q}_p)</math> is the group of <math>\mathbb{Q}_p</math>-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 Néron symbol, for which, see elliptic surfaces: in turn this determines the exponent ''f''_''p'' 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 {{harvs|txt=yes|last=Tate|first=John|authorlink=John Tate (mathematician)|year=1975}} as an improvement of the description of the Néron model of an elliptic curve by {{harvs|txt|last=Néron|year=1964}}.

==Notation== Assume that all the coefficients of the equation of the curve lie in a complete discrete valuation ring ''R'' with perfect residue field '' K'' and maximal ideal generated by a prime π. The elliptic curve is given by the equation :<math>y^2+a_1xy+a_3y = x^3+a_2x^2+a_4x+a_6.</math> Define: :<math>v(\Delta)=</math> the p-adic valuation of <math>\pi</math> in <math>\Delta</math>, that is, exponent of <math>\pi</math> in prime factorization of <math>\Delta</math>, or infinity if <math>\Delta = 0</math> :<math>a_{i,m}=a_i/\pi^m</math> :<math>b_2=a_1^2+4a_2</math> :<math>b_4=a_1a_3+2a_4^{}</math> :<math>b_6=a_3^2+4a_6</math> :<math>b_8=a_1^2a_6-a_1a_3a_4+4a_2a_6+a_2a_3^2-a_4^2</math> :<math>c_4=b_2^2-24b_4</math> :<math>c_6=-b_2^3+36b_2b_4-216b_6</math> :<math>\Delta=-b_2^2b_8-8b_4^3-27b_6^2+9b_2b_4b_6</math> :<math>j=c_4^3/\Delta.</math>

==The algorithm==

*Step 1: If π does not divide Δ then the type is I₀, ''c''=1 and ''f''=0. *Step 2: If π divides Δ but not c₄ then the type is I_v with v = v(Δ), ''c''=v, and ''f''=1. *Step 3. Otherwise, change coordinates so that π divides ''a''₃,''a''₄,''a''₆. If π² does not divide ''a''₆ then the type is II, ''c''=1, and ''f''=v(Δ); *Step 4. Otherwise, if π³ does not divide ''b''₈ then the type is III, ''c''=2, and ''f''=v(Δ)&minus;1; *Step 5. Otherwise, let ''Q₁'' be the polynomial ::<math>Q_1(Y) = Y^2+a_{3,1}Y-a_{6,2}.</math>. :If π³ does not divide ''b''₆ then the type is IV, ''c''=3 if <math>Q_1(Y)</math> has two roots in K and 1 if it has two roots outside of K, and ''f''=v(Δ)&minus;2. *Step 6. Otherwise, change coordinates so that π divides ''a''₁ and ''a''₂, π² divides ''a''₃ and ''a''₄, and π³ divides ''a''₆. Let ''P'' be the polynomial ::<math>P(T) = T^3+a_{2,1}T^2+a_{4,2}T+a_{6,3}.</math> :If <math>P(T)</math> has 3 distinct roots modulo π then the type is I₀^*, ''f''=v(&Delta;)&minus;4, and ''c'' is 1+(number of roots of ''P'' in ''K''). *Step 7. If ''P'' has one single and one double root, then the type is I_ν^* for some ν>0, ''f''=v(Δ)&minus;4&minus;ν, ''c''=2 or 4: there is a "sub-algorithm" for dealing with this case. *Step 8. If ''P'' has a triple root, change variables so the triple root is 0, so that π² divides ''a''₂ and π³ divides ''a''₄, and π⁴ divides ''a''₆. Let ''Q₂'' be the polynomial ::<math>Q_2(Y) = Y^2+a_{3,2}Y-a_{6,4}.</math>. :If <math>Q_2(Y)</math> has two distinct roots modulo π then the type is IV^*, ''f''=v(&Delta;)&minus;6, and ''c'' is 3 if the roots are in ''K'', 1 otherwise. *Step 9. If <math>Q_2(Y)</math> has a double root, change variables so the double root is 0. Then π³ divides ''a''₃ and π^{5<!--Tate has a misprint here-->} divides ''a''₆. If π⁴ does not divide ''a''₄ then the type is III^* and ''f''=v(Δ)&minus;7 and ''c'' = 2. *Step 10. Otherwise if π⁶ does not divide ''a''₆ then the type is II^* and ''f''=v(Δ)&minus;8 and ''c'' = 1. *Step 11. Otherwise the equation is not minimal. Divide each ''a''_''n'' by π^''n'' and go back to step 1.

==Implementations==

The algorithm is implemented for algebraic number fields in the PARI/GP computer algebra system, available through the function elllocalred.

==References== *{{citation | last = Cremona | first = John | title = Algorithms for modular elliptic curves | accessdate = 2007-12-20 | url = http://www.warwick.ac.uk/~masgaj/book/fulltext/index.html | zbl=0872.14041 |location=Cambridge | publisher=Cambridge University Press |edition=2nd | year=1997 | isbn=0-521-59820-6 }} *{{citation|title=An Algorithm for Finding a Minimal Weierstrass Equation for an Elliptic Curve |first= Michael |last=Laska |journal=Mathematics of Computation|volume= 38|issue= 157|year= 1982|pages= 257–260 |doi=10.2307/2007483|jstor=2007483|zbl=0493.14016 |doi-access=free}} * {{Citation | last1=Néron | first1=André | author1-link= André Néron | title=Modèles minimaux des variétés abèliennes sur les corps locaux et globaux | url=http://www.numdam.org/item?id=PMIHES_1964__21__5_0 | mr = 0179172 | year=1964 | journal=Publications Mathématiques de l'IHÉS | volume=21 | pages=5–128 | doi=10.1007/BF02684271 | zbl=0132.41403 | language=French}} *{{citation | first=Joseph H. | last=Silverman | authorlink=Joseph H. Silverman |title= Advanced Topics in the Arithmetic of Elliptic Curves | series=Graduate Texts in Mathematics | volume=151 | publisher=Springer-Verlag | isbn=0-387-94328-5 | year=1994 | zbl=0911.14015 }} *{{citation|chapter=Algorithm for determining the type of a singular fiber in an elliptic pencil |last=Tate|first=John | authorlink=John Tate (mathematician) |series=Lecture Notes in Mathematics |publisher=Springer|publication-place= Berlin / Heidelberg |issn=1617-9692 |volume=476 |editor1-last=Birch | editor1-first=B.J. | editor1-link=Bryan John Birch | editor2-last=Kuyk | editor2-first=W. |title=Modular Functions of One Variable IV |doi=10.1007/BFb0097582 |year=1975 |isbn=978-3-540-07392-5 |pages=33–52 |mr=0393039 |zbl=1214.14020 }}

Category:Elliptic curves Category:Number theory