Metraipolis › archive › dc_9c2b71dbf319
Tate's algorithm — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Tate%27s_algorithm
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T19:45:34.188Z
- SHA-256 of the archived text
1b3fd443979979ca3a44d807c97c2243118b858c9677f02e24243a8337dee12c- Stable URL of this page
https://metraipolis.com/documento/dc_9c2b71dbf319
How to cite
Tate's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Tate%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_9c2b71dbf319 (Metraipolis archive dc_9c2b71dbf319, sha256 1b3fd443979979ca3a44d807c97c2243118b858c9677f02e24243a8337dee12c)
BibTeX
@misc{dc9c2b71dbf319,
title = {Tate's algorithm — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Tate%27s_algorithm},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_9c2b71dbf319; sha256 1b3fd443979979ca3a44d807c97c2243118b858c9677f02e24243a8337dee12c},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Tate%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the theory of elliptic curves, Tate's algorithm takes as input an integral model of an elliptic curve E over Q {\displaystyle \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 ) ] , {\displaystyle c_{p}=[E(\mathbb {Q} _{p}):E^{0}(\mathbb {Q} _{p})],} where E 0 ( Q p ) {\displaystyle E^{0}(\mathbb {Q} _{p})} is the group of Q p {\displaystyle \mathbb {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 Néron symbol, for which, see elliptic surface: 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 Néron model of an elliptic curve by Néron (1964).
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Number theory»).
Fonte: Wikipedia in inglese, voce «Tate's algorithm» — https://en.wikipedia.org/wiki/Tate%27s_algorithm
Wikidata Q7687930 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7687930
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Tate%27s_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369061693, consultata il 2026-10-07T19:07:00.193Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 3dbe0abe0ca8dcdd5084ea95af7624583219ca85b97fee6290146a6067f8231a