The Setting
Here contains . A single-fold representation of a relation is a polynomial with integer coefficients in input variables and finitely many auxiliary variables such that, for every input tuple , (1)✦ A relation is single-fold when it has a single-fold representation.
Rational numbers enter such representations through codes, tuples of natural numbers that stand for them. Take the equation of the curve , read on rational numbers and : how can it become a single-fold relation on codes of and ? When codes sit in the auxiliary tuple of a single-fold representation, each rational number may have only one code, auxiliary entries included.
Rational Codes
A rational code is a sextuple of natural numbers: the positive part and the negative part of a numerator, a denominator , and three auxiliary entries , and .✦ A rational code is valid when (2)✦ The value of a rational code is the rational number .✦
A family of rational codes indexed by a set is a tuple of rational codes . The value of such a family is the point of .✦
Expressions and Fractions
A rational expression in variables , , is a formal term built from the variables and from constants by sums, products and negation: (3)✦ The value of a rational expression at a point is the rational number obtained by substituting for and computing in .✦
A fraction of polynomials in variables is a pair of polynomials and with integer coefficients in these variables, its numerator and its denominator.✦ The value of at a tuple is the rational number .✦
The Claim
Theorem 1. For every rational number , (4)✦ If and are valid rational codes, then (5)✦ If is a valid rational code, then (6)✦
A subset of is read as a relation on , by listing the entries of all codes in a fixed order. For every finite set , the set (7)✦ is single-fold. For a finite set and rational expressions and in the variables , , the relations (8)✦ and (9)✦ are single-fold.
If is a single-fold relation and and are fractions of polynomials in with and for every , then the relation (10)✦ is single-fold.
In the paper, the result reads: every rational number has exactly one code, and any fixed finite sequence of rational additions, subtractions, multiplications, divisions by nonzero divisors and comparisons on valid codes has a polynomial implementation with unique outputs and auxiliary coordinates.
What Is Checked
The claim is stated over rational codes with their validity (2) and their value , over families of codes and rational expressions (3) evaluated at the values of the codes, over fractions of polynomials with their values , and over single-fold relations as defined in (1).