By OpenAISourceGitHub

Manuscripts from openai/math

Fork
Clone
git clone https://openversions.com/git/index/openai-math.git
Cite
Version link
https://openversions.com/index/openai-math/commit/dfd8c46870b48511e697cbb43a3c8c91d375fa2f
Version identifier (commit hash)
dfd8c46870b48511e697cbb43a3c8c91d375fa2f

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

All papers

Claims

Findings

Hilbert’s tenth problem over the rational numbers

There is no algorithm which, given a polynomial f∈Z[X1,…,Xn]f \in \mathbb{Z}[X_1, \dots, X_n], with nn part of the input, decides whether ff has a zero in Qn\mathbb{Q}^n.

Let f∈Z[X1,…,Xn]f \in \mathbb{Z}[X_1, \dots, X_n] be nonconstant. If every finite system of rational constraints constructed in §2.4 for ff is solvable, then ff has a zero in Zn\mathbb{Z}^n.

There are a positive existential formula Φ(b)\Phi(b) in the language of rings, with fixed rational coefficients, and a finite set S1S_1 of rational primes such that: (1) Q⊨Φ(b)\mathbb{Q} \models \Phi(b) for every b∈Zb \in \mathbb{Z}; and (2) if b∈Q×b \in \mathbb{Q}^\times and Q⊨Φ(b)\mathbb{Q} \models \Phi(b), then, for every q∉S1q \notin S_1, the inequality vq(b)<0v_q(b) < 0 implies vq(b)∈2Zv_q(b) \in 2\mathbb{Z}.

There exist five distinct points C⊂P1(Q)\mathcal{C} \subset \mathbf{P}^1(\mathbb{Q}), including ∞\infty, a finite set SS of rational primes, and constants H,c>0H, c > 0 such that for s=(u:v)∈P1(Q)∖Cs = (u : v) \in \mathbf{P}^1(\mathbb{Q}) \setminus \mathcal{C}, h(s)≤HMS(s)ch(s) \le H M_S(s)^c, where MS(s)M_S(s) is the product, without repetition, of primes q∉Sq \notin S for which at least one of vq(Lb(u,v))−min⁡{vq(u),vq(v)}v_q(L_b(u, v)) - \min\{v_q(u), v_q(v)\} (b∈Cb \in \mathcal{C}) is odd.

For F=Q(2)F = \mathbb{Q}(\sqrt{2}), d=75−532d = 75 - 53\sqrt{2}, and E:y2=x3−d2xE: y^2 = x^3 - d^2 x, the group E(F)E(F) has rank one, and there exist a positive integer mm and a nontorsion point P∈E(F)P \in E(F) such that mE(F)=ZPmE(F) = \mathbb{Z}P.

There is a finite set K⊂Z>0\mathcal{K} \subset \mathbb{Z}_{>0} such that, for every A∈ZA \in \mathbb{Z} and every real B>0B > 0, there exist integers u1,u2,vu_1, u_2, v with v≠0v \neq 0 such that on setting u3=Av−u1−u2u_3 = Av - u_1 - u_2, each of the thirteen numbers v,Lb(uj,v)v, L_b(u_j, v) (1≤j≤3,b∈C∖{∞}1 \le j \le 3, b \in \mathcal{C} \setminus \{\infty\}) has the form ϵkr\epsilon k r with ϵ∈{1,−1}\epsilon \in \{1, -1\}, k∈Kk \in \mathcal{K}, and r>Br > B a rational prime splitting in FF of good reduction for E,EσE, E^\sigma satisfying gcd⁡(d1,d2)∣4\gcd(d_1, d_2) \mid 4 and r∤d1d2r \nmid d_1 d_2.

With the usual effective coding, H10(Q)\mathrm{H}10(\mathbb{Q}) has Turing degree 0′0', and the same is true for rational solvability of integral polynomials of total degree at most four, and for deciding whether ∑i=1sqi2\sum_{i=1}^s q_i^2 has a zero in QN\mathbb{Q}^N given a nonempty finite list q1,…,qs∈Z[X1,…,XN]q_1, \dots, q_s \in \mathbb{Z}[X_1, \dots, X_N] of total degree at most two.

Methods

Recursive first-order theory T of finite rational tests and compactness reduction to an elementary extension of Q with an additive elliptic index map eta: R -> *Z.

Source excerpts

“Let T be a theory in a countable recursive expansion of the language of rings. Its ring R is required to be an integral domain of characteristic zero with √2 ∈/ Frac(R).” · Show in paper

“Lemma 2.9. If every finite rational test succeeds, there exist an ambient elementary extension of the many-sorted structure specified in §2.1, a model R of T , a tuple a ∈ Rn with f(a) = 0, and an embedding R ,→ ∗Q into its rational sort such that every element of the image satisfies Φ.” · Show in paper

Positive existential formula Phi(b) excluding odd-order poles outside a finite prime set via simultaneous 2-Selmer matrix rank calculations on two elliptic curve twists.

Source excerpts

“Define Φ(b) to hold if b = 0, or if b ̸= 0 and, for some m ∈ M, md ∈ Dm, and t, e ∈ Q, the following conditions hold:” · Show in paper

“The matrix and simultaneous rank calculations below adapt that viewpoint to the present curve family.” · Show in paper

Quaternionic Shimura curve quotient of discriminant 210 carrying a principally polarized abelian surface family, combined with modularity at p=2 and Faltings height comparisons to bound base height by odd-contact primes.

Source excerpts

“Let B/Q be the indefinite quaternion algebra of discriminant 210 = 2 · 3 · 5 · 7, let O be a maximal order, and put G = B×.” · Show in paper

“The modularity input is [49, Theorem 1.1] in its exact form: every continuous irreducible odd two-dimensional 2-adic representation of GQ, unramified outside finitely many primes and de Rham at 2 with distinct Hodge–Tate weights, is a Tate twist of the representation associated with a classical cuspidal eigenform.” · Show in paper

Green–Tao–Ziegler finite-complexity prime-pattern lower bound combined with Selberg's lambda^2 upper sieve on affine fibers to construct representations with controlled elliptic reduction orders.

Source excerpts

“We use the following precise form of the Green–Tao–Ziegler theorem.” · Show in paper

“The following estimate uses Selberg’s λ2 method [63]; compare [44, Section 3.2].” · Show in paper

Arithmetic-circuit normalization reducing general rational polynomial solvability to degree-four polynomials and sums of squares of degree-two polynomials.

Source excerpts

“For the degree restriction, we apply over Q the algebraic normalization used in [13, Theorem 7.5].” · Show in paper