OctoInformBeta

OpenAI preprint, September 2026 · §4. A uniquely represented function with intermediate growth

Lemma 4.1: On y2=x3−25xy^2 = x^3 - 25x, for mm even and (Wj)(W_j) strictly increasing, each j≥1j \geq 1 has exactly one representative nP+tnP + t with |n|=j|n| = j

Representative points are unique per index and single-fold.

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

Let EE be the elliptic curve y2=x3−25xy^2 = x^3 - 25x over ℚ\mathbb{Q}, with point at infinity OO. Fix a point PP with E(ℚ)=ℤP⊕TE(\mathbb{Q}) = \mathbb{Z}P \oplus T, where TT is the torsion subgroup. Every rational point is nP+tnP + t for exactly one n∈ℤn \in \mathbb{Z} and one t∈Tt \in T; for a point QQ these are its index nQn_Q and its torsion part.

For j≥1j \geq 1 the points of index ±j\pm j form the set (jP+T)∪(−jP+T)(jP + T) \cup (-jP + T) of 2|T|2|T| points. To speak of jj through a point of EE by a single-fold representation, defined below, one wants a condition that holds of exactly one point of this set and is itself given by a single-fold representation.

Points, Heights and Representatives

The coordinates x(Q)x(Q) and y(Q)y(Q) of a point Q≠OQ \neq O of EE are its affine coordinates, and x(O)=y(O)=0x(O) = y(O) = 0. The xx-height Hx(Q)H_x(Q) of a point QQ of EE is the natural number Hx(Q)=max⁡(|a|,d)if Q≠O and x(Q)=a/d in lowest terms,d≥1,Hx(O)=1.H_x(Q) = \max(|a|, d) \quad \text{if } Q \neq O \text{ and } x(Q) = a/d \text{ in lowest terms}, \ d \geq 1, \qquad H_x(O) = 1.(1)✦

Fix a natural number mm. The multiple height W(Q)W(Q) of a point QQ of EE is the xx-height of [m]Q[m]Q, the mm-th multiple of QQ in the group law✦, and the growth sequence (Wj)j∈ℕ(W_j)_{j \in \mathbb{N}} is the multiple height along the multiples of PP: W(Q)=Hx([m]Q),Wj=W(jP).W(Q) = H_x([m]Q), \qquad W_j = W(jP).(2)✦

A representative is a point QQ of E(ℚ)E(\mathbb{Q}) such that Q≠O,y(Q)≥0,W(Q)>1,andQ+t≠O,x(Q+t)≤x(Q) for every t∈T.Q \neq O, \quad y(Q) \geq 0, \quad W(Q) > 1, \quad \text{and} \quad Q + t \neq O, \ x(Q + t) \leq x(Q) \ \text{ for every } t \in T.(3)✦

Single-fold Relations and Codes

A single-fold representation of a relation R⊆ℕdR \subseteq \mathbb{N}^d is a polynomial F(a,w)F(a, w) with integer coefficients in the input unknowns a=(a1,…,ad)a = (a_1, \dots, a_d) and finitely many auxiliary unknowns w=(w1,…,wk)w = (w_1, \dots, w_k) such that, for all a∈ℕda \in \mathbb{N}^d and w,w′∈ℕkw, w' \in \mathbb{N}^k, a∈R⇔F(a,w)=0 for some w,F(a,w)=F(a,w′)=0⟹w=w′.a \in R \iff F(a, w) = 0 \text{ for some } w, \qquad F(a, w) = F(a, w') = 0 \implies w = w'.(4)✦ A relation is single-fold when it has a single-fold representation.✦ A map h:ℕd→ℕeh\colon \mathbb{N}^d \to \mathbb{N}^e has a single-fold graph when the relation b=h(a)b = h(a) on ℕd×ℕe\mathbb{N}^d \times \mathbb{N}^e is single-fold.✦

A rational code is a tuple (p,n,d,t,s,q)∈ℕ6(p, n, d, t, s, q) \in \mathbb{N}^6: the positive and negative parts pp and nn of a numerator, a denominator dd, and three auxiliary entries.✦ A rational code (p,n,d,t,s,q)(p, n, d, t, s, q) has value (p−n)/d(p - n)/d and 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.(5) The code of a rational number rr is the valid rational code of value rr.✦

A point code is a natural number oo, its flag, together with two rational codes, its xx-code and its yy-code✦; its thirteen entries, the flag followed by the six entries of the xx-code and the six of the yy-code, form a tuple in ℕ13\mathbb{N}^{13}.✦ The code of a point QQ of EE is the point code with flag 11 and the code of 00 twice when Q=OQ = O, and with flag 00, the code of x(Q)x(Q) and the code of y(Q)y(Q) otherwise.✦ A map g:ℕd→E(ℚ)g\colon \mathbb{N}^d \to E(\mathbb{Q}) is a single-fold point map when the map sending zz to the thirteen entries of the code of g(z)g(z) has a single-fold graph.✦

The Claim

Theorem 1. Let mm be a natural number. If QQ and RR are representatives with |nQ|=|nR||n_Q| = |n_R|, then Q=R.Q = R.(6)✦ If QQ is a representative and RR is a point of E(ℚ)E(\mathbb{Q}) with |nR|=|nQ||n_R| = |n_Q|, then x(R)≤x(Q).x(R) \leq x(Q).(7)✦ If g:ℕd→E(ℚ)g\colon \mathbb{N}^d \to E(\mathbb{Q}) is a single-fold point map, then the relation {z∈ℕd:g(z) is a representative}\{z \in \mathbb{N}^d : g(z) \text{ is a representative}\}(8)✦ is single-fold. If mm is even, then every representative QQ satisfies |nQ|≥1.|n_Q| \geq 1.(9)✦ If moreover the sequence (Wj)j∈ℕ(W_j)_{j \in \mathbb{N}} is strictly increasing, then for every j≥1j \geq 1 #{Q∈E(ℚ):Q is a representative and |nQ|=j}=1.\#\{Q \in E(\mathbb{Q}) : Q \text{ is a representative and } |n_Q| = j\} = 1.(10)✦

In the paper, the result reads: for each integer j≥1j \geq 1, exactly one point of (jP+T)∪(−jP+T)(jP + T) \cup (-jP + T) satisfies the representative conditions Q≠OQ \neq O, y(Q)≥0y(Q) \geq 0, W(Q)>1W(Q) > 1, and Q+t≠OQ + t \neq O, x(Q)≥x(Q+t)x(Q) \geq x(Q + t) for t∈Tt \in T, and these are all the representatives.

What Is Checked

The claim is stated over the curve EE with the decomposition E(ℚ)=ℤP⊕TE(\mathbb{Q}) = \mathbb{Z}P \oplus T and the index nQn_Q, the coordinates xx and yy, the heights and the growth sequence of (1) and (2), the representatives of (3), and the single-fold relations of (4) with the rational codes of (5) and the point codes built from them. About these constructions the library proves that every rational number is the value of exactly one valid rational code.✦