On the polynomial values represented by binary quadratic forms
Bogdan Grechuk, Jamal Agbanwa
math.GM
Jul 7, 2026 · v2
TL;DR
All main results, including that x^6-4 is a sum of two squares infinitely often, were formalized in Lean using the Aristotle AI system.
Abstract
Many Diophantine equations can be reduced to the question of whether, for a given non-degenerate integral binary quadratic form $F$ and a univariate polynomial $P$ with integer coefficients, $P(x)$ can be represented by $F$ for infinitely many values of $x$. We develop a method for answering this question for certain cubic and quartic polynomials $P$, as well as for certain polynomials of the form $P(x)=R(Q(x))$, where $R(t)$ and $Q(x)$ are polynomials of degrees $3$ and $2$, respectively. Applying this method with $F(y,z)=y^2+z^2$, $R(t)=t^3-4$ and $Q(x)=x^2$, we conclude that $x^6-4$ is a sum of two squares infinitely often. In turn, this implies that the equation $y^2+x^3y+z^2+1=0$ has infinitely many integer solutions. Prior to this work, it was the shortest equation for which it was unknown whether its integer solution set is finite or infinite. We conclude with a list of the new shortest equations for which the finiteness problem remains open. All main results of this paper have been formalized in Lean using Aristotle.
Problem
Many Diophantine equations reduce to deciding whether a polynomial P(x) is represented by a non-degenerate integral binary quadratic form for infinitely many integers x. The equation y^2+x^3y+z^2+1=0 was the shortest equation whose integer solution set was not known to be finite or infinite.
Approach
A tangent-line construction expands R(t) around a point u where R(u) is represented by the form. This reduces representability of R(Q(x)) to a Pell-type auxiliary equation, together with congruence conditions in the general binary quadratic form case. The method covers certain cubic and quartic polynomials and compositions R(Q(x)) with cubic R and quadratic Q. The main results were formalized in Lean using Aristotle.
Results
x^6-4 is a sum of two squares infinitely often, so y^2+x^3y+z^2+1=0 has infinitely many integer solutions. This completes the classification of Diophantine equations of length l<9. Four further length-9 equations (x^6+f for f in {8,5,-3,-4}) are resolved, leaving twenty open equations of length 9.