The Setting
Take the curve over , with point at infinity , torsion subgroup of its group of rational points, and a point with . In a Diophantine representation a rational point of is carried by a code, a tuple of natural numbers, and the group law by a polynomial relation among codes. The question is whether this arithmetic keeps the auxiliary tuple unique: whether a point has only one valid code, and whether the relations giving the code of a sum and of a fixed multiple have representations with a unique auxiliary tuple.
For a set of input variables, a single-fold representation of a relation is a polynomial with integer coefficients in the variables of and in auxiliary variables forming a finite set , such that for every (1)✦ and such a is unique when it exists. A relation is single-fold when it has a single-fold representation.✦ For sets and of variables, a map has a single-fold graph when the relation is single-fold.✦
Codes for Points
A rational code is a sextuple ✦; its value is the rational number , with and the positive and negative parts of the numerator.✦ A rational code is valid when (2)✦ which writes its value in lowest terms. 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 , and so a tuple of thirteen natural numbers, one at each of thirteen positions; and denote the values of and .✦ A point code is valid when and are valid and either and , or and (3)✦
The point of a valid point code is the rational point of equal to when and to when .✦ The code of a rational point of is the point code with flag and the code of as -code and -code when , and with flag and the codes of and as -code and -code when .✦
The point code read from a tuple along a map from the thirteen positions to a set of variables is the point code whose entry at each position is .✦
Addition and Multiples on Codes
For rational numbers , the chord condition is the pair of equations (4)✦ the addition formulas on for a line of slope , with denominators cleared.
The addition relation on point codes holds of , where has flag and values and , when one of five cases holds, the last two with the chord slope and the tangent slope: (5)✦
For , the multiple relation on point codes holds of when and for some rational point of .✦
A map is single-fold when the map , from to , has a single-fold graph.✦
The Claim
Theorem 1. Let be a set of variables and .
If and are valid point codes with , then (6)✦
If , and are valid point codes, then (7)✦
If and are valid point codes, there is exactly one valid point code such that (8)✦
For maps , and from the thirteen positions to , the relation (9)✦ is single-fold.
For maps and from the thirteen positions to , the relation (10)✦ is single-fold.
If and are single-fold maps from to , then so is (11)✦
If is a single-fold map from to , then so is (12)✦
In the paper, the result reads: given valid codes for , addition has a polynomial implementation with a unique output code for and a unique complete tuple of auxiliary coordinates, and the same holds for any fixed finite chain of additions and for multiplication by any fixed positive integer.
What Is Checked
The claim is stated over the curve and its group of rational points, rational codes with their value, their validity (2) and the code of a rational number, point codes with their validity (3), their point , the code of a point and the code read from a tuple, the chord condition (4), the relations of (5) and , and single-fold representations (1), relations, graphs and maps.
About these constructions the library proves that every rational number has exactly one valid rational code of value .✦