Tate curve

Last updated

In mathematics, the Tate curve is a curve defined over the ring of formal power series with integer coefficients. Over the open subscheme where q is invertible, the Tate curve is an elliptic curve. The Tate curve can also be defined for q as an element of a complete field of norm less than 1, in which case the formal power series converge.

Contents

The Tate curve was introduced by JohnTate  ( 1995 ) in a 1959 manuscript originally titled "Rational Points on Elliptic Curves Over Complete Fields"; he did not publish his results until many years later, and his work first appeared in Roquette (1970).

Definition

The Tate curve is the projective plane curve over the ring Z[[q]] of formal power series with integer coefficients given (in an affine open subset of the projective plane) by the equation

where

are power series with integer coefficients. [1]

The Tate curve over a complete field

Suppose that the field k is complete with respect to some absolute value | |, and q is a non-zero element of the field k with |q|<1. Then the series above all converge, and define an elliptic curve over k. If in addition q is non-zero then there is an isomorphism of groups from k*/qZ to this elliptic curve, taking w to (x(w),y(w)) for w not a power of q, where

and taking powers of q to the point at infinity of the elliptic curve. The series x(w) and y(w) are not formal power series in w.

Intuitive example

In the case of the curve over the complete field, , the easiest case to visualize is , where is the discrete subgroup generated by one multiplicative period , where the period . Note that is isomorphic to , where is the complex numbers under addition.

To see why the Tate curve morally corresponds to a torus when the field is C with the usual norm, is already singly periodic; modding out by q's integral powers you are modding out by , which is a torus. In other words, we have an annulus, and we glue inner and outer edges.

But the annulus does not correspond to the circle minus a point: the annulus is the set of complex numbers between two consecutive powers of q; say all complex numbers with magnitude between 1 and q. That gives us two circles, i.e., the inner and outer edges of an annulus.

The image of the torus given here is a bunch of inlaid circles getting narrower and narrower as they approach the origin.

This is slightly different from the usual method beginning with a flat sheet of paper, , and gluing together the sides to make a cylinder , and then gluing together the edges of the cylinder to make a torus, .

This is slightly oversimplified. The Tate curve is really a curve over a formal power series ring rather than a curve over C. Intuitively, it is a family of curves depending on a formal parameter. When that formal parameter is zero it degenerates to a pinched torus, and when it is nonzero it is a torus).

Properties

The j-invariant of the Tate curve is given by a power series in q with leading term q−1. [2] Over a p-adic local field, therefore, j is non-integral and the Tate curve has semistable reduction of multiplicative type. Conversely, every semistable elliptic curve over a local field is isomorphic to a Tate curve (up to quadratic twist). [3]

Related Research Articles

Elliptic-curve cryptography (ECC) is an approach to public-key cryptography based on the algebraic structure of elliptic curves over finite fields. ECC allows smaller keys compared to non-EC cryptography to provide equivalent security.

<span class="mw-page-title-main">Elliptic curve</span> Algebraic curve

In mathematics, an elliptic curve is a smooth, projective, algebraic curve of genus one, on which there is a specified point O. An elliptic curve is defined over a field K and describes points in K2, the Cartesian product of K with itself. If the field's characteristic is different from 2 and 3, then the curve can be described as a plane algebraic curve which consists of solutions (x, y) for:

<i>p</i>-adic number Number system extending the rational numbers

In number theory, given a prime number p, the p-adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; p-adic numbers can be written in a form similar to decimals, but with digits based on a prime number p rather than ten, and extending to the left rather than to the right.

<span class="mw-page-title-main">Torus</span> Doughnut-shaped surface of revolution

In geometry, a torus is a surface of revolution generated by revolving a circle in three-dimensional space one full revolution about an axis that is coplanar with the circle. The main types of toruses include ring toruses, horn toruses, and spindle toruses. A ring torus is sometimes colloquially referred to as a donut or doughnut.

The Lenstra elliptic-curve factorization or the elliptic-curve factorization method (ECM) is a fast, sub-exponential running time, algorithm for integer factorization, which employs elliptic curves. For general-purpose factoring, ECM is the third-fastest known factoring method. The second-fastest is the multiple polynomial quadratic sieve, and the fastest is the general number field sieve. The Lenstra elliptic-curve factorization is named after Hendrik Lenstra.

<span class="mw-page-title-main">Algebraic curve</span> Curve defined as zeros of polynomials

In mathematics, an affine algebraic plane curve is the zero set of a polynomial in two variables. A projective algebraic plane curve is the zero set in a projective plane of a homogeneous polynomial in three variables. An affine algebraic plane curve can be completed in a projective algebraic plane curve by homogenizing its defining polynomial. Conversely, a projective algebraic plane curve of homogeneous equation h(x, y, t) = 0 can be restricted to the affine algebraic plane curve of equation h(x, y, 1) = 0. These two operations are each inverse to the other; therefore, the phrase algebraic plane curve is often used without specifying explicitly whether it is the affine or the projective case that is considered.

<span class="mw-page-title-main">Modular group</span> Orientation-preserving mapping class group of the torus

In mathematics, the modular group is the projective special linear group of 2 × 2 matrices with integer coefficients and determinant 1. The matrices A and A are identified. The modular group acts on the upper-half of the complex plane by fractional linear transformations, and the name "modular group" comes from the relation to moduli spaces and not from modular arithmetic.

<span class="mw-page-title-main">Weierstrass elliptic function</span> Class of mathematical functions

In mathematics, the Weierstrass elliptic functions are elliptic functions that take a particularly simple form. They are named for Karl Weierstrass. This class of functions are also referred to as ℘-functions and they are usually denoted by the symbol ℘, a uniquely fancy script p. They play an important role in the theory of elliptic functions. A ℘-function together with its derivative can be used to parameterize elliptic curves and they generate the field of elliptic functions with respect to a given period lattice.

<i>j</i>-invariant

In mathematics, Felix Klein's j-invariant or j function, regarded as a function of a complex variable τ, is a modular function of weight zero for SL(2, Z) defined on the upper half-plane of complex numbers. It is the unique such function which is holomorphic away from a simple pole at the cusp such that

In mathematics, a formal group law is a formal power series behaving as if it were the product of a Lie group. They were introduced by S. Bochner (1946). The term formal group sometimes means the same as formal group law, and sometimes means one of several generalizations. Formal groups are intermediate between Lie groups and Lie algebras. They are used in algebraic number theory and algebraic topology.

In mathematics, complex multiplication (CM) is the theory of elliptic curves E that have an endomorphism ring larger than the integers. Put another way, it contains the theory of elliptic functions with extra symmetries, such as are visible when the period lattice is the Gaussian integer lattice or Eisenstein integer lattice.

Hyperelliptic curve cryptography is similar to elliptic curve cryptography (ECC) insofar as the Jacobian of a hyperelliptic curve is an abelian group in which to do arithmetic, just as we use the group of points on an elliptic curve in ECC.

<span class="mw-page-title-main">Puiseux series</span> Power series with rational exponents

In mathematics, Puiseux series are a generalization of power series that allow for negative and fractional exponents of the indeterminate. For example, the series

In number theory and algebraic geometry, a rational point of an algebraic variety is a point whose coordinates belong to a given field. If the field is not mentioned, the field of rational numbers is generally understood. If the field is the field of real numbers, a rational point is more commonly called a real point.

Lehmer's conjecture, also known as the Lehmer's Mahler measure problem, is a problem in number theory raised by Derrick Henry Lehmer. The conjecture asserts that there is an absolute constant such that every polynomial with integer coefficients satisfies one of the following properties:

In the theory of elliptic curves, Tate's algorithm takes as input an integral model of an elliptic curve E over , 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

In mathematics, Arakelov theory is an approach to Diophantine geometry, named for Suren Arakelov. It is used to study Diophantine equations in higher dimensions.

In mathematics the division polynomials provide a way to calculate multiples of points on elliptic curves and to study the fields generated by torsion points. They play a central role in the study of counting points on elliptic curves in Schoof's algorithm.

In mathematics, elliptic curve primality testing techniques, or elliptic curve primality proving (ECPP), are among the quickest and most widely used methods in primality proving. It is an idea put forward by Shafi Goldwasser and Joe Kilian in 1986 and turned into an algorithm by A. O. L. Atkin the same year. The algorithm was altered and improved by several collaborators subsequently, and notably by Atkin and François Morain, in 1993. The concept of using elliptic curves in factorization had been developed by H. W. Lenstra in 1985, and the implications for its use in primality testing followed quickly.

In mathematics, the rank of an elliptic curve is the rational Mordell–Weil rank of an elliptic curve defined over the field of rational numbers. Mordell's theorem says the group of rational points on an elliptic curve has a finite basis. This means that for any elliptic curve there is a finite subset of the rational points on the curve, from which all further rational points may be generated. If the number of rational points on a curve is infinite then some point in a finite basis must have infinite order. The number of independent basis points with infinite order is the rank of the curve.

References

  1. Manin & Panchishkin (2007) p.220
  2. Silverman (1994) p.423
  3. Manin & Panchiskin (2007) p.300