OctoInformBeta

OpenAI preprint, September 2026 · §9. Rational values and curve alternatives

9.1: Integral values of a rational function: Uniformly over polynomials of fixed degree bound, inputs and values bounded by fixed multiples of powers of real X≥2X \ge 2 yield subpolynomial counts

Complex nonpolynomial rational functions have sparse bounded integral values.

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 a nonpolynomial rational function A/BA/B, where A,B∈ℂ[t]A, B \in \mathbb{C}[t] are coprime polynomials with deg⁡B>0\deg B > 0, and a real parameter X≥2X \ge 2. The question is how many integers ss satisfy A(s)=vB(s)A(s) = v B(s) for some v∈ℤv \in \mathbb{Z} when |s||s| and |v||v| are bounded by fixed multiples of powers of XX, uniformly over pairs AA and BB of bounded degree.

The Claim

Theorem 1. Let DD be a positive integer, and let a,b,C0a, b, C_0, and ε\varepsilon be positive real numbers. There exists a constant C>0C > 0, depending only on D,a,b,C0D, a, b, C_0, and ε\varepsilon, such that whenever A,B∈ℂ[t]A, B \in \mathbb{C}[t] are coprime polynomials with deg⁡A≤D\deg A \le D and 0<deg⁡B≤D0 < \deg B \le D, X≥2X \ge 2 is a real number, S⊂ℤS \subset \mathbb{Z} is a finite set, and v:ℤ→ℤv \colon \mathbb{Z} \to \mathbb{Z} is a function satisfying A(s)=v(s)B(s)A(s) = v(s) B(s), |s|≤C0Xa|s| \le C_0 X^a, and |v(s)|≤C0Xb|v(s)| \le C_0 X^b for all s∈Ss \in S, the cardinality of SS satisfies #S≤CXε.\#S \le C X^\varepsilon.(1)✦

In the paper, the result reads: for fixed D∈ℕ>0D \in \mathbb{N}_{>0} and constants a,b,C0>0a, b, C_0 > 0 (where the paper writes A,BA, B for a,ba, b), every ε>0\varepsilon > 0, every X≥2X \ge 2, and every nonpolynomial R∈ℚ(t)R \in \mathbb{Q}(t) whose reduced numerator and denominator have degrees at most DD, one has #{s∈ℤ:|s|≤C0Xa,R(s)∈ℤ,|R(s)|≤C0Xb}≪D,a,b,C0,εXε\#\{s \in \mathbb{Z} : |s| \le C_0 X^a,\, R(s) \in \mathbb{Z},\, |R(s)| \le C_0 X^b\} \ll_{D,a,b,C_0,\varepsilon} X^\varepsilon (excluding poles of RR), uniformly in the coefficients of RR.

The bound (1) passes from R∈ℚ(t)R \in \mathbb{Q}(t) to coprime complex polynomials A,B∈ℂ[t]A, B \in \mathbb{C}[t] with deg⁡B>0\deg B > 0, and from R(s)∈ℤR(s) \in \mathbb{Z} outside poles to A(s)=v(s)B(s)A(s) = v(s) B(s) on a finite set S⊂ℤS \subset \mathbb{Z} for v:ℤ→ℤv \colon \mathbb{Z} \to \mathbb{Z}.

What Is Checked

The claim is stated over a positive integer DD, positive real numbers a,b,C0a, b, C_0, and ε\varepsilon, coprime complex polynomials A,B∈ℂ[t]A, B \in \mathbb{C}[t] with deg⁡A≤D\deg A \le D and 0<deg⁡B≤D0 < \deg B \le D, a real number X≥2X \ge 2, a finite set S⊂ℤS \subset \mathbb{Z}, and an integer-valued function v:ℤ→ℤv \colon \mathbb{Z} \to \mathbb{Z} satisfying A(s)=v(s)B(s)A(s) = v(s) B(s), |s|≤C0Xa|s| \le C_0 X^a, and |v(s)|≤C0Xb|v(s)| \le C_0 X^b for all s∈Ss \in S.