OctoInformBeta

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

Lemma 3.3: A valid point code is determined by its point, and the addition relation on valid codes holds exactly when their points add

Sums and multiples of points of EE as single-fold relations.

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

Take the curve E:y2=x3−25xE\colon y^2 = x^3 - 25x over ℚ\mathbb{Q}, with point at infinity OO, torsion subgroup TT of its group of rational points, and a point PP with E(ℚ)=ℤP⊕TE(\mathbb{Q}) = \mathbb{Z}P \oplus T. In a Diophantine representation a rational point of EE 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 VV of input variables, a single-fold representation of a relation R⊆ℕVR \subseteq \mathbb{N}^V is a polynomial FF with integer coefficients in the variables of VV and in auxiliary variables forming a finite set KK, such that for every a∈ℕVa \in \mathbb{N}^V a∈R⇔F(a,w)=0 for some w∈ℕK,a \in R \iff F(a, w) = 0 \text{ for some } w \in \mathbb{N}^K,(1)✦ and such a ww is unique when it exists. A relation R⊆ℕVR \subseteq \mathbb{N}^V is single-fold when it has a single-fold representation.✦ For sets VV and UU of variables, a map ϕ:ℕV→ℕU\phi\colon \mathbb{N}^V \to \mathbb{N}^U has a single-fold graph when the relation {(a,b)∈ℕV×ℕU:b=ϕ(a)}\{(a, b) \in \mathbb{N}^V \times \mathbb{N}^U : b = \phi(a)\} is single-fold.✦

Codes for Points

A rational code is a sextuple u=(p,n,d,t,s,q)∈ℕ6u = (p, n, d, t, s, q) \in \mathbb{N}^6✦; its value is the rational number (p−n)/d(p - n)/d, with pp and nn the positive and negative parts of the numerator.✦ A rational code uu 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)✦ which writes its value in lowest terms. The code of a rational number rr is the valid rational code of value rr.

A point code c=(o,u,v)c = (o, u, v) is a flag o∈ℕo \in \mathbb{N} together with two rational codes, its xx-code uu and its yy-code vv, and so a tuple of thirteen natural numbers, one at each of thirteen positions; x(c)x(c) and y(c)y(c) denote the values of uu and vv.✦ A point code cc is valid when uu and vv are valid and either o=1o = 1 and x(c)=y(c)=0x(c) = y(c) = 0, or o=0o = 0 and y(c)2=x(c)3−25x(c).y(c)^2 = x(c)^3 - 25\,x(c).(3)✦

The point QcQ_c of a valid point code c=(o,u,v)c = (o, u, v) is the rational point of EE equal to OO when o=1o = 1 and to (x(c),y(c))(x(c), y(c)) when o=0o = 0.✦ The code κ(Q)\kappa(Q) of a rational point QQ of EE is the point code with flag 11 and the code of 00 as xx-code and yy-code when Q=OQ = O, and with flag 00 and the codes of xx and yy as xx-code and yy-code when Q=(x,y)Q = (x, y).✦

The point code aσa_\sigma read from a tuple a∈ℕVa \in \mathbb{N}^V along a map σ\sigma from the thirteen positions to a set VV of variables is the point code whose entry at each position ii is aσ(i)a_{\sigma(i)}.✦

Addition and Multiples on Codes

For rational numbers δ,ν,x1,x2,y1,x3,y3\delta, \nu, x_1, x_2, y_1, x_3, y_3, the chord condition Lδ,ν(x1,x2,y1;x3,y3)L_{\delta,\nu}(x_1, x_2, y_1; x_3, y_3) is the pair of equations δ2(x3+x1+x2)=ν2,δ(y3+y1)=ν(x1−x3),\delta^2 (x_3 + x_1 + x_2) = \nu^2, \qquad \delta (y_3 + y_1) = \nu (x_1 - x_3),(4)✦ the addition formulas on EE for a line of slope ν/δ\nu/\delta, with denominators cleared.

The addition relation AA on point codes holds of (c1,c2,c3)(c_1, c_2, c_3), where cic_i has flag oio_i and values xi=x(ci)x_i = x(c_i) and yi=y(ci)y_i = y(c_i), when one of five cases holds, the last two with the chord slope and the tangent slope: (a)o1=1 and c3=c2;(b)o1=0,o2=1 and c3=c1;(c)o1=o2=0,x1=x2,y1+y2=0 and o3=1;(d)o1=o2=0,x1≠x2,o3=0 and Lx1−x2,y1−y2(x1,x2,y1;x3,y3);(e)o1=o2=0,x1=x2,y1+y2≠0,o3=0 and L2y1,3x12−25(x1,x1,y1;x3,y3).\begin{array}{ll} \text{(a)} & o_1 = 1 \text{ and } c_3 = c_2;\\ \text{(b)} & o_1 = 0,\ o_2 = 1 \text{ and } c_3 = c_1;\\ \text{(c)} & o_1 = o_2 = 0,\ x_1 = x_2,\ y_1 + y_2 = 0 \text{ and } o_3 = 1;\\ \text{(d)} & o_1 = o_2 = 0,\ x_1 \neq x_2,\ o_3 = 0 \text{ and } L_{x_1 - x_2,\, y_1 - y_2}(x_1, x_2, y_1; x_3, y_3);\\ \text{(e)} & o_1 = o_2 = 0,\ x_1 = x_2,\ y_1 + y_2 \neq 0,\ o_3 = 0 \text{ and } L_{2y_1,\, 3x_1^2 - 25}(x_1, x_1, y_1; x_3, y_3). \end{array}(5)✦

For m∈ℕm \in \mathbb{N}, the multiple relation MmM_m on point codes holds of (c,c′)(c, c') when c=κ(Q)c = \kappa(Q) and c′=κ(mQ)c' = \kappa(mQ) for some rational point QQ of EE.✦

A map f:ℕV→E(ℚ)f\colon \mathbb{N}^V \to E(\mathbb{Q}) is single-fold when the map a↦κ(f(a))a \mapsto \kappa(f(a)), from ℕV\mathbb{N}^V to ℕ13\mathbb{N}^{13}, has a single-fold graph.✦

The Claim

Theorem 1. Let VV be a set of variables and m∈ℕm \in \mathbb{N}.

  1. If cc and c′c' are valid point codes with Qc=Qc′Q_c = Q_{c'}, then c=c′.c = c'.(6)✦

  2. If c1c_1, c2c_2 and c3c_3 are valid point codes, then A(c1,c2,c3)⇔Qc1+Qc2=Qc3.A(c_1, c_2, c_3) \quad\Longleftrightarrow\quad Q_{c_1} + Q_{c_2} = Q_{c_3}.(7)✦

  3. If c1c_1 and c2c_2 are valid point codes, there is exactly one valid point code c3c_3 such that A(c1,c2,c3).A(c_1, c_2, c_3).(8)✦

  4. For maps σ\sigma, τ\tau and ρ\rho from the thirteen positions to VV, the relation {a∈ℕV:aσ,aτ,aρ are valid and A(aσ,aτ,aρ)}\{\, a \in \mathbb{N}^V : a_\sigma,\ a_\tau,\ a_\rho \text{ are valid and } A(a_\sigma, a_\tau, a_\rho) \,\}(9)✦ is single-fold.

  5. For maps σ\sigma and τ\tau from the thirteen positions to VV, the relation {a∈ℕV:Mm(aσ,aτ)}\{\, a \in \mathbb{N}^V : M_m(a_\sigma, a_\tau) \,\}(10)✦ is single-fold.

  6. If ff and gg are single-fold maps from ℕV\mathbb{N}^V to E(ℚ)E(\mathbb{Q}), then so is a↦f(a)+g(a).a \mapsto f(a) + g(a).(11)✦

  7. If ff is a single-fold map from ℕV\mathbb{N}^V to E(ℚ)E(\mathbb{Q}), then so is a↦mf(a).a \mapsto m f(a).(12)✦

In the paper, the result reads: given valid codes for Q1,Q2∈E(ℚ)Q_1, Q_2 \in E(\mathbb{Q}), addition has a polynomial implementation with a unique output code for Q1+Q2Q_1 + Q_2 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 EE 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 QcQ_c, the code κ(Q)\kappa(Q) of a point and the code aσa_\sigma read from a tuple, the chord condition (4), the relations AA of (5) and MmM_m, and single-fold representations (1), relations, graphs and maps.

About these constructions the library proves that every rational number rr has exactly one valid rational code of value rr.✦