A stable-coordinate counterexample in four variables
A polynomial that becomes a coordinate with one extra variable, but not without it, disproves two conjectures.
A coordinate is a polynomial that some reversible change of variables turns into a single variable. This paper proves that one degree-five polynomial in four variables becomes a coordinate after adding one variable (Lean proof listed). It also proves that the same polynomial is not a coordinate in the original four variables. Every level set is a copy of three-dimensional space, yet none can be straightened into a flat slice. This disproves the stable coordinate conjecture in four variables and the Abhyankar–Sathaye conjecture in four-dimensional space.
The explanation
Take the polynomial x + y² in two variables. Replace x by x − y², and it becomes plain x. That replacement is a polynomial automorphism [a change of variables made of polynomials that other polynomials can undo]. Here the undo step is x → x + y². Call a polynomial a coordinate if some such change turns it into one variable. A coordinate is one axis in disguise.
Now take four complex variables, x₁ to x₄. First set Q = x₂² − x₄² + x₁x₃. Then set f = x₁ − 2Q(Q(x₂ + x₄) + x₁x₄). Multiplied out, f has 16 terms and degree 5. At (0, 0, 0, 0) it equals 0. At (1, 0, 0, 0) it equals 1. At (1, 1, 1, 1), Q equals 1 and f equals −5.
Add a fifth variable, w, that f does not even use. The paper builds an explicit change of all five variables that turns f into x₁. It then proves that no change of the original four variables does thisSource 1. So f is a stable coordinate [a polynomial that becomes a coordinate once spare variables are added]. Yet it is not a coordinate on its own. A Lean proof is listed for both halves.
The stable coordinate conjecture says this cannot happen. It predicts that a stable coordinate was a coordinate all along. Shpilrain and Yu stated the one-variable form as a conjecture in 2002. They also showed that it holds over the complex numbers in two and three variables. With one variable it is elementary. So four variables is the first place a counterexample could existSource 2. One spare variable is already enough here.
The example also answers a second question. A fiber of f is the set of points where f takes one fixed value. For a coordinate, every fiber is a flat copy of affine three-space [ordinary three-dimensional complex space]. The paper shows every fiber of f is also a copy of three-spaceSource 3. Yet no change of variables of four-space carries any of them to a coordinate hyperplaneSource 3. That is a flat slice such as x₁ = 0. Mathematicians call such a fiber nonrectifiable [impossible to straighten by any polynomial change of the whole space]. The Abhyankar–Sathaye conjecture predicts that this never happens. In two variables the Abhyankar–Moh–Suzuki theorem says the answer is yes. The example says no in four-dimensional spaceSource 4.
A companion paper from 24 September 2026 had already found a different counterexample to Abhyankar–Sathaye. Its polynomial F also has four variables, and the set where F = 0 is a copy of three-spaceSource 5. F fails to be a coordinate for a simple reason. At the point (2, 0, −1/2, 1/2), F equals −1 and all four of its slopes are zeroSource 6. A coordinate can never have such a flat point, because the change of variables would then have no inverse thereSource 7. That paper claims the three-space shape for the zero fiber onlySource 5.
The October polynomial f cannot be caught by that test. It becomes a coordinate once w is added, and the same slope argument then rules out any flat point. That is the real obstacle. Earlier work found polynomials that become coordinates after adding variables. Lewis proved in 2013 that one well-known test polynomial, the second Vénéreau polynomial, is a coordinate. Blanc and Poloni later proved stability for a wider family. Showing that a polynomial is a stable coordinate is explicit work. Showing that it is not a coordinate needs a different kind of argumentSource 8.
Here is the idea in plain terms. If f were a coordinate, a certain sliding symmetry would have to survive on a simpler ring built from f. The paper then shows that no such symmetry exists. One quantity in it would have to be a polynomial and also carry a negative weightSource 9. Both cannot be true. The strategy adapts an earlier OpenAI preprint on a related question, called cancellationSource 10. This example, however, does not itself give a cancellation counterexample. Its surrounding space is ordinary four-space, and the problem sits in the polynomial fSource 11.
Adding more unused variables keeps the Abhyankar–Sathaye failure in every dimension of four or moreSource 12. The three-variable case is not covered. How sure is this? The Lean scope note lists a formal version of the main claims. It covers the degree-five polynomial and its coordinate status with and without w. It also covers the claim that every fiber is three-space and cannot be straightened. It also covers the Abhyankar–Sathaye failure in every dimension of at least four. No specialist review has been published.
What it doesn't show. This does not settle the Abhyankar–Sathaye question in three variables, and it does not give a cancellation counterexample.
Where it came from
This result comes from an unreleased OpenAI model, published in the openai/math release on 6 October 2026.
Hype check
Major if the proofs hold. The Lean scope note lists formal versions of the main statements. No specialist has published a review, and the three-variable case is not addressed.
Words used
- Polynomial automorphism
- A change of variables made of polynomials that other polynomials can undo.
- Coordinate
- A polynomial that some polynomial automorphism turns into a single variable.
- Stable coordinate
- A polynomial that becomes a coordinate after extra unused variables are added.
- Affine three-space
- Ordinary three-dimensional space, here with complex numbers as coordinates.
- Fiber
- The set of points where a polynomial takes one fixed value.
- Rectifiable
- Able to be carried onto a flat coordinate slice by a polynomial change of the whole space.
- Lean
- A computer proof checker that confirms each step of a formal proof.
The original papers (2)
- A stable coordinate that is not a coordinate in four variables (PDF, opens in a new tab) October 5, 2026 Formal proof listed
- An explicit noncoordinate polynomial with affine three-space zero fibre (PDF, opens in a new tab) September 24, 2026 Formal proof listed
All quoted lines (12)
-
There is a -algebra automorphism of sending to , but there is no such automorphism of .
A stable coordinate that is not a coordinate in four variables Back to text -
Thus four variables are the first possible dimension for a counterexample, and one added variable already suffices.
A stable coordinate that is not a coordinate in four variables Back to text -
For every , the hypersurface is isomorphic to and its embedding in is not rectifiable.
A stable coordinate that is not a coordinate in four variables Back to text -
Corollary … gives a negative answer to this conjecture in ambient dimension four.
A stable coordinate that is not a coordinate in four variables Back to text -
We construct an explicit counterexample to the Abhyankar–Sathaye conjecture: a noncoordinate polynomial in four complex variables whose zero fibre is affine three-space.
An explicit noncoordinate polynomial with affine three-space zero fibre Back to text -
At this reduces to , so .
An explicit noncoordinate polynomial with affine three-space zero fibre Back to text -
If a polynomial automorphism had as its first component, its Jacobian matrix at would have a zero first row.
An explicit noncoordinate polynomial with affine three-space zero fibre Back to text -
For the polynomial in Theorem …, the first problem is settled by explicit substitutions; the second requires a derivation obstruction.
A stable coordinate that is not a coordinate in four variables Back to text -
Such a derivation has a coefficient that would simultaneously have to be a polynomial in and have negative fiber weight. This is impossible.
A stable coordinate that is not a coordinate in four variables Back to text -
The graded-ring and line-bundle strategy adapts the construction in.
A stable coordinate that is not a coordinate in four variables Back to text -
In our example the ambient variety is already , and the obstruction concerns its distinguished polynomial.
A stable coordinate that is not a coordinate in four variables Back to text -
Adjoining variables gives counterexamples in every ambient dimension at least four.
An explicit noncoordinate polynomial with affine three-space zero fibre Back to text
Other sources
- OpenAI, “A stable coordinate that is not a coordinate in four variables”, openai/math preprint (5 October 2026)
sending to , but there is no such automorphism of .
- OpenAI, “An explicit noncoordinate polynomial with affine three-space zero fibre”, openai/math preprint (24 September 2026)
We give a counterexample in ambient dimension four, and hence in every ambient dimension at least four. The three-variable case is not addressed.
- V. Shpilrain and J.-T. Yu, “Affine varieties with equivalent cylinders”, Journal of Algebra 251 (2002), 295–307
- J. Blanc and I. van Santen, “Embeddings of affine spaces into quadrics”, Transactions of the AMS 371 (2019), 8429–8465
- S. S. Abhyankar and T. T. Moh, “Embeddings of the line in the plane”, J. Reine Angew. Math. 276 (1975), 148–166
- M. Suzuki, “Propriétés topologiques des polynômes de deux variables complexes, et automorphismes algébriques de l'espace C²”, J. Math. Soc. Japan 26 (1974), 241–257
- D. Lewis, “Vénéreau-type polynomials as potential counterexamples”, Journal of Pure and Applied Algebra 217 (2013), 946–957
- J. Blanc and P.-M. Poloni, “Bivariables and Vénéreau polynomials”, Annales de la Faculté des sciences de Toulouse 31 (2022), 1391–1418
- OpenAI, “An explicit failure of complex affine-space cancellation”, openai/math preprint (23 September 2026)