The Setting
Let be the curve over , with point at infinity . Its group of rational points is , with a point of infinite order and the finite torsion subgroup, so that every rational point is with and . A point is measured by the height of its -coordinate, a natural number. Two questions concern the multiples of a point: how fast the height of grows with , and whether, for a fixed , the relation between a point and the height of has a single-fold Diophantine representation once points are written as tuples of natural numbers.
The library states both answers for this curve, along with the basic properties of the canonical height and the existence of an even and of constants and bound by a set of inequalities.
Heights on
The height of a rational number in lowest terms, , is . The height of a point of is the natural number when , and .✦ The naive height of a point of is the real number (1)✦
The canonical height of a point of is the real number equal to one half of the limit, as , of the scaled naive heights .✦
Multiples of
The decomposition of is given by an isomorphism of onto : the point is ✦, the point is for and ✦, and the index of a point is the integer with for some ✦.
For a natural number , the multiple height of a point of is the natural number (2)✦ and the height sequence of is the sequence of natural numbers (3)✦
Point Codes
A rational code is a sextuple of natural numbers✦; its value is the rational number ✦. A rational code is valid when (4)✦ The code of a rational number is the valid rational code of value .✦
A point code is a flag together with two rational codes, its -code and its -code: thirteen natural numbers in all.✦ The height of a point code is the natural number formed from the first three entries , , of its -code.✦ The code of a point of is the point code with flag , -code the code of and -code the code of ; the code of has flag and the code of as both its -code and its -code.✦
For a natural number , the multiplication relation of holds between point codes and when is the code of a point of and is the code of .✦ The relation between point codes and natural numbers holds of when stands in the multiplication relation of with some point code of height .✦
Single-fold Relations
A single-fold representation of a relation on tuples of natural numbers indexed by a set is a polynomial with integer coefficients in input variables and finitely many auxiliary variables such that exactly when for some tuple of natural numbers, and such that any two tuples and with and are equal.✦ A relation on tuples of natural numbers indexed by a set is single-fold when it has a single-fold representation.✦
The Claim
Theorem 1. Let range over the rational points of . The scaled naive heights of converge: (5)✦ For every integer , (6)✦ If has infinite order, then (7)✦ There is a real number such that, for every , (8)✦ For every , (9)✦ If is an even natural number and its height sequence, then for every and , (10)✦ If is a natural number and a real number with for every , then the height sequence of satisfies, for every , (11)✦ There are a real number and positive integers and , with even and for every , such that (12)✦ Finally, let be a natural number, a set, a map from the thirteen entries of a point code into , and . With the point code whose entries are those of at the places gives, (13)✦
In the paper, the result reads: for reduced , with , and ; , for nontorsion , and ; with and an even making satisfy and , with , for , and with , its and being the and above.
What Is Checked
The claim is stated over the curve and its group of rational points with the isomorphism onto , finite, the point and the index it gives, the heights , and , the multiple heights and their height sequences; and (13) is stated over rational codes with their value and validity, point codes and their height, the codes of rational numbers and of points, the multiplication relation, the relation and single-fold representations.
About these constructions the library proves that every rational number has exactly one valid rational code of value .✦