One-equation reductions for the rational Hamilton quaternions and Lipschitz order
Status Partially solved · unsolvedmath.comLLM status Open unverified
Top Open Problems unknownunknown Not reported cataloguedPartially solvedOpenStatement
Definitions and mathematical statement
Shared notation.
$\mathbb N$, $\mathbb Z$, $\mathbb Q$, $\mathbb R$, and $\mathbb C$ denote the natural numbers, integers, rationals, reals, and complex numbers, respectively. All additional parameters and hypotheses are specified in the question.Statement recorded in the supplied source.
Let $\mathbb H_{\mathbb Q}$ be the Hamilton quaternion algebra over $\mathbb Q$, and let $\mathcal O=\mathbb Z+i\mathbb Z+j\mathbb Z+k\mathbb Z$ be its Lipschitz order. Decide the solvability of arbitrary noncommutative polynomial equations with either rational or quaternion coefficients, and with unknowns constrained either to $\mathbb H_{\mathbb Q}$ or to $\mathcal O$. Also ask for existential definitions of $\mathbb Z$ in $\mathcal O$ and of $\mathbb Q$ in $\mathbb H_{\mathbb Q}$, and for the analogous decision questions in $M_n(\mathbb Z)$ and $M_n(\mathbb Q)$.Formulation references: [S1], [S2].
Short English statement
Let $\mathbb H_{\mathbb Q}$ be the Hamilton quaternion algebra over $\mathbb Q$, and let $\mathcal O=\mathbb Z+i\mathbb Z+j\mathbb Z+k\mathbb Z$ be its Lipschitz order. Decide the solvability of arbitrary noncommutative polynomial equations with either rational or quaternion coefficients, and with unknowns constrained either to $\mathbb H_{\mathbb Q}$ or to $\mathcal O$. Also ask for existential definitions of $\mathbb Z$ in $\mathcal O$ and of $\mathbb Q$ in $\mathbb H_{\mathbb Q}$, and for the analogous decision questions in $M_n(\mathbb Z)$ and $M_n(\mathbb Q)$.Sources
- S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 20002344 (AIM-LOGIC-0120). Catalogue attribution under CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
- S2 Original problem formulation and mathematical context. https://aimath.org/WWN/hilberts10th/hilberts10th.pdf.
Statement licence: CC-BY-4.0 · Source file
Contributions 1
OpenAI claim summary for Math-2303
Rational undecidability can be interpreted in central quaternion or matrix variables. The bundle also includes integral-order equations, and those are not resolved merely by the rational-polynomial reduction.
One-equation reductions for the rational Hamilton quaternions and Lipschitz order
OpenAI's claim
OpenAI presents the following claims relevant to this question, with manuscript numbers following paper order in Sources. In manuscript 1 (family 004; 2026-09-24), the asserted result is that rational solvability of integer-coefficient polynomials with an unrestricted number of variables is undecidable.Mathematical statement of the claimed result
Manuscript 1.
With $n$ variable and integral polynomial coefficients explicitly encoded, the rational Diophantine decision claim is \[ \{f\in\mathbb Z[X_1,\ldots,X_n]:\exists x\in\mathbb Q^n,\ f(x)=0\} \quad\text{is undecidable}. \] There is no algorithm giving the correct yes/no answer for every such input; the coefficient ring is $\mathbb Z$, but sought solutions lie in $\mathbb Q$.Outline of the argument
For manuscript 1 (family 004; 2026-09-24), integer solvability is represented by an effective sequence of finite rational tests. Elliptic indices, odd valuation contacts, and a height argument force an ordinary integer witness when every test succeeds; a hypothetical rational decision procedure would then decide the integer problem by two concurrent searches.Formal verification
No Lean formalization is listed at this snapshot for manuscript 1 (family 004; 2026-09-24).This site has not executed the Lean code. Described statement coverage is not an independent proof check.
Status caveat
The manuscripts were produced by an internal OpenAI model. OpenAI cautions that results without formalization can contain mistakes. This site has not independently checked the proofs; the label records the scope of OpenAI's claim.Sources
- OpenAI, Hilbert's tenth problem over the rational numbers, 2026-09-24; citation key
OAI:Hilberts-tenth-problem-over-the-rational-numbers-September-24-2026. PDF (GitHub); PDF (direct); Manuscript page and citation; Latest version; Statement source: thm:main. - OpenAI catalogue entry.