OctoInformBeta

OpenAI preprint, September 2026 · §3. A rank-one curve with unique arithmetic codes

Lemma 3.2: Validity of a finite family of codes is single-fold, and so are equations and weak inequalities between rational expressions in their values

Each rational number has exactly one valid code.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Here ℕ={0,1,2,…}\mathbb{N} = \{0, 1, 2, \dots\} contains 00. A single-fold representation of a relation R⊆ℕmR \subseteq \mathbb{N}^m is a polynomial P(a,w)P(a, w) with integer coefficients in input variables a=(a1,…,am)a = (a_1, \dots, a_m) and finitely many auxiliary variables w=(w1,…,wk)w = (w_1, \dots, w_k) such that, for every input tuple a∈ℕma \in \mathbb{N}^m, a∈R⇔P(a,w)=0 for some w∈ℕk,P(a,w)=P(a,w′)=0⟹w=w′ for all w,w′∈ℕk.a \in R \iff P(a, w) = 0 \text{ for some } w \in \mathbb{N}^k, \qquad P(a, w) = P(a, w') = 0 \implies w = w' \text{ for all } w, w' \in \mathbb{N}^k.(1)✦ A relation R⊆ℕmR \subseteq \mathbb{N}^m 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 y2=x3−25xy^2 = x^3 - 25x of the curve EE, read on rational numbers xx and yy: how can it become a single-fold relation on codes of xx and yy? 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 z=(p,n,d,t,s,q)∈ℕ6z = (p, n, d, t, s, q) \in \mathbb{N}^6 of natural numbers: the positive part pp and the negative part nn of a numerator, a denominator dd, and three auxiliary entries tt, ss and qq.✦ A rational code zz is valid when pn=0,d=1+t+s,(p+n)t+d=1+qd.pn = 0, \qquad d = 1 + t + s, \qquad (p + n)t + d = 1 + qd.(2)✦ The value of a rational code zz is the rational number val⁡(z)=(p−n)/d\operatorname{val}(z) = (p - n)/d.✦

A family of rational codes indexed by a set II is a tuple a=(ai)i∈Ia = (a_i)_{i \in I} of rational codes ai∈ℕ6a_i \in \mathbb{N}^6. The value of such a family aa is the point val⁡(a)=(val⁡(ai))i∈I\operatorname{val}(a) = (\operatorname{val}(a_i))_{i \in I} of ℚI\mathbb{Q}^I.✦

Expressions and Fractions

A rational expression in variables XiX_i, i∈Ii \in I, is a formal term built from the variables and from constants c∈ℚc \in \mathbb{Q} by sums, products and negation: e::=Xi∣c∣e1+e2∣e1e2∣−e1.e \;::=\; X_i \mid c \mid e_1 + e_2 \mid e_1 e_2 \mid -e_1 .(3)✦ The value e(x)e(x) of a rational expression ee at a point x∈ℚIx \in \mathbb{Q}^I is the rational number obtained by substituting xix_i for XiX_i and computing in ℚ\mathbb{Q}.✦

A fraction of polynomials f/gf/g in variables a1,…,ama_1, \dots, a_m is a pair of polynomials ff and gg with integer coefficients in these variables, its numerator and its denominator.✦ The value of f/gf/g at a tuple a∈ℕma \in \mathbb{N}^m is the rational number f(a)/g(a)f(a)/g(a).✦

The Claim

Theorem 1. For every rational number rr, |{z∈ℕ6:z is a valid rational code with val⁡(z)=r}|=1.\bigl|\{\, z \in \mathbb{N}^6 : z \text{ is a valid rational code with } \operatorname{val}(z) = r \,\}\bigr| = 1 .(4)✦ If zz and z′z' are valid rational codes, then val⁡(z)=val⁡(z′)⟹z=z′.\operatorname{val}(z) = \operatorname{val}(z') \implies z = z' .(5)✦ If z=(p,n,d,t,s,q)z = (p, n, d, t, s, q) is a valid rational code, then gcd⁡(p+n,d)=1.\gcd(p + n, d) = 1 .(6)✦

A subset of (ℕ6)I(\mathbb{N}^6)^I is read as a relation on ℕ6|I|\mathbb{N}^{6|I|}, by listing the entries of all codes in a fixed order. For every finite set II, the set VI={a∈(ℕ6)I:ai is a valid rational code for every i∈I}V_I = \{\, a \in (\mathbb{N}^6)^I : a_i \text{ is a valid rational code for every } i \in I \,\}(7)✦ is single-fold. For a finite set II and rational expressions ee and e′e' in the variables XiX_i, i∈Ii \in I, the relations {a∈VI:e(val⁡(a))=e′(val⁡(a))}\{\, a \in V_I : e(\operatorname{val}(a)) = e'(\operatorname{val}(a)) \,\}(8)✦ and {a∈VI:e(val⁡(a))≤e′(val⁡(a))}\{\, a \in V_I : e(\operatorname{val}(a)) \le e'(\operatorname{val}(a)) \,\}(9)✦ are single-fold.

If G⊆ℕmG \subseteq \mathbb{N}^m is a single-fold relation and f/gf/g and f′/g′f'/g' are fractions of polynomials in a1,…,ama_1, \dots, a_m with g(a)>0g(a) > 0 and g′(a)>0g'(a) > 0 for every a∈Ga \in G, then the relation {a∈G:f(a)/g(a)=f′(a)/g′(a)}\{\, a \in G : f(a)/g(a) = f'(a)/g'(a) \,\}(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 (p−n)/d(p - n)/d, over families of codes and rational expressions (3) evaluated at the values of the codes, over fractions of polynomials with their values f(a)/g(a)f(a)/g(a), and over single-fold relations as defined in (1).