WorksMathematics
Two shapes of maximal degree 135 in the plane Jacobian problem: exclusion of the degree pairs (135,90) and (90,135) with corners (9,36) and (17/9,4)
Abstract
In the list of Guccione, Guccione, Horruitiner and Valqui of the possible shapes of a counterexample to the plane Jacobian conjecture with degrees at most 150, two shapes have starting corner (9,36) and final corner (17/9,4): the standard (3,2)-pairs of degrees (135,90) and the standard (2,3)-pairs of degrees (90,135). We show that no such pair exists, when it is normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui. In suitable polynomial coordinates the pair is confined to an explicit finite system of polynomial equations. Its leading part is a pair of polynomials of degrees 12 and 8 in one variable with 3 p3 q2' - 2 p3' q2 constant, which is unique up to the symmetries of the system and has rational coefficients; the remaining equations are then solved by three steps of linear algebra over Q, and the 29 compatibility conditions, polynomials in five unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for one Groebner basis). All statements are proved relative to the cited results. Nothing in this note has been checked by a third party.
Statement
Throughout, is an algebraically closed field of characteristic zero, , and is or . We use the notation of [1]: for a weight , is the weighted degree, the leading form, and its end points; . Standard -pairs, their starting triple and their regular corners are defined in [1 Definitions 4.3, 6.2, 5.5]. Put .
Standing data 1.1. is a standard -pair in with , , , starting triple , and as in [1 Corollary 5.21(4)]. Thus:
(D1) the support of lies in , that of in , and
with monic of degree 4, [1 Proposition 6.1, Theorem 7.6(2), Remark 3.1]. Moreover has a single root: with .
Theorem 1.2. There is no pair as in Standing data 1.1, neither for nor for .
Remark 1.3. A root of multiplicity of which satisfies inequality (5.9) of [1 Proposition 5.18], that is , generates the regular corner of an -pair in , and such a root exists [1 Propositions 5.16, 5.18]; so . The last condition of the standing data is the case , with corner : these are the two shapes with corners , of [2 Section 6] (the line through these two points has direction and meets the horizontal axis at , and ). If has no root of multiplicity at least 3, then , which is impossible: the point admits neither Case I (the direction would be , with no admissible starting point in [1 Proposition 5.13] nor Case II of [1 Proposition 5.19], and Case III keeps the same point and leads to Case I or Case II. The remaining case , with corner , is not excluded by this arithmetic; for it we rely on [2], where no shape with these two corners is listed. We found no exclusion of the two shapes of the standing data in the literature we searched; their novelty is not otherwise verified. The four authors treat in [3] the shapes of degree below 125 and obtain the bound 108.
The left side
Lemma 2.1. There are such that
are polynomials in . Give the weight 1 and the weight 2. Then has weighted degree with top form , has weighted degree with top form , and
Proof. The argument is the one of [3 Section 4, Case (7, 21)]; we give it in detail. Apply the flip of [1 Section 8], so that the weight becomes , with and for the flipped , and . Let be the element of [1 Theorem 2.6] for ; then . If then , since is not a monomial [1 Remark 2.5], so and , which is impossible; hence , so and in [1 Corollary 7.4]. That corollary applies to the flipped pair (its hypotheses hold with , and ), and to every pair obtained from it by a translation of the second variable by a Laurent monomial in the first which leaves unchanged: such a pair lies in , the degrees of the flipped pair are unchanged, and so is (the element of [1 Theorem 2.6] can be kept, and is excluded in as well). It yields: for every weight between and at which the pair has an edge, and such that the value of is positive at all weights from to , the edge form of is a power .
In the original variables, consider the weights with . The point is the starting point of the edge of at : an edge with a direction strictly between and starting at would end at a point with [1 Remark 1.8], and by the condition on there is no direction of in ; then [1 Proposition 3.7] applies. As long as is the starting point of an edge of weight with , the value of there is , so the point is leading at all weights from to , where the value of is therefore positive as well, and the edge form is a power with a -homogeneous element of whose only possible monomials are and ; so the form is up to a constant, , and by the condition on , that is . The translation removes this edge and leaves unchanged the leading forms at the weights between and , while the -form becomes the monomial ([1 Proposition 3.9], applied after the flip); so the next edge starting at , if any, has a larger . After at most two such translations (, then ; we write for the constants, which may be 0) no edge of weight , , starts at . Since the weight lies within a half-turn of , the point is then still leading for [1 Remark 2.10, Proposition 3.7]; hence every monomial of the translated satisfies , that is, is a monomial in , .
For : at a weight , , where has an edge as above, [1 Proposition 7.3] with gives and proportional values, so (the element , , is not a proper power) and the same translation applies. For the pair obtained after the translations and , the values of and are positive, because and are in the supports; the leading forms commute by [1 Proposition 1.13] (the sum of the values exceeds ), so is proportional to a power of the monomial [1 Proposition 2.1(2)], hence a monomial at a point ; by (D1) such a point of the support has , and is in the support, so on the support of the translated . Letting tend to 4 gives there.
A translation , , replaces by monomials of -weight , so (D1) holds for the translated pair with the same leading forms. Since has , the bound is the weighted degree bound, and for , one has and , which gives the top forms. The Jacobian follows from . □
The right side
Write , so that .
Lemma 3.1. There are with and such that, with
and with the weight , every monomial of has and every monomial of has .
Proof. In one has , so every root of has multiplicity (with , , ). By [1 Proposition 5.18] the automorphism gives an -pair in with a regular corner at , of direction . We follow this corner as in the proof of [1 Proposition 5.19]. Case II is impossible, because [1 Proposition 5.14(4)] requires ; this holds at every step below, since it depends only on the point . In Case III, [1 Proposition 5.17] gives , and the translation produces an -pair in with a regular corner at the same point and a smaller direction. After finitely many steps Case I occurs, for a pair and a direction . There [1 Proposition 1.13], while [1 Corollary 5.7(2)]. Hence , that is , , . The directions of the Case III steps decrease strictly from and stay larger than the direction of the final Case I corner, which is determined by the point ; they have . The only such direction is , so there is at most one such step, a translation . Finally . □
Common coordinates
Let be the set of formal sums such that, for every , only finitely many terms have . It is a ring containing ; for let be the largest weight of its terms and the sum of the terms of that weight. Then and , and is invertible in when .
Lemma 4.1. Let be as in Lemmas 2.1 and 3.1, and put
Then . Write and . Then implies and ; implies and . Moreover the part of with is , the part of with is , and
Proof. Since , , so ; giving the weight 2, this substitution does not increase the weighted degree of Lemma 2.1, which gives the bounds on , and since the top forms become and . In the element of Lemma 3.1 is with ; it is invertible. The assignment , defines a ring morphism which sends to and to , because in . Expanding (ancillary script), the image of has and leading term , and the image of has and leading term : the terms of weights and and the constant term cancel by the choice of , , . Hence the image of has leading term a non-zero multiple of , of weight , and these monomials are distinct for distinct . Therefore, for a non-zero polynomial, the value of on the image of is . Lemma 3.1 gives the bounds and . Finally , so the bracket in is times the bracket in , which is by Lemma 2.1. □
The finite system
Let if and if . Writing again for (this replaces by , changes , and preserves all the statements of Lemma 4.1, the leading terms of the images and the weighted degrees being unchanged), and for , a pair as in the standing data yields in both cases a solution of the following system.
(S1) and with , , , , , , , .
(S2) with , .
Indeed the bounds , for and , for give the shape of and with and , and the top forms , of Lemma 4.1 show that , and that has no term of degree and no term of degree . For the bracket changes sign, which is absorbed in . Since for , where , the coefficients of in (S2) are
Lemma 5.1. If (S1)–(S2) has a solution, it has one with , with no term of degree in , and with , , , where
One has .
Proof. The system is preserved by: multiplying and by non-zero constants; adding constants to and ; replacing by ; the translation (with replaced by ); and the substitution (with replaced by ). So we may assume that and are monic, that has no term of degree , that and that has no term of degree . Consider equation (1) for monic of degrees , with no term of degree in . The substitution , followed by division by and , preserves these conditions and multiplies by and the coefficient of in by . For the ideal of the equation has dimension and degree , so that there are at most solutions, and on each of them (Gröbner basis, Singular [4], ancillary script); since , the substitutions with give distinct solutions from one, so the solutions with form a single orbit, and therefore all solutions with form a single orbit under , . The pair is a solution, with (ancillary script). Hence for every solution, and using we may assume ; the solutions with are and , the second with . The substitution , , followed by the multiplication of by and of by , preserves the system and the normalisations and exchanges the two. □
Proposition 5.2. The system (S1)–(S2), normalised as in Lemma 5.1, has no solution.
Proof (exact computation). With , and , each of (2), (3), (4) is, coefficient by coefficient, a system of linear equations with rational matrix: (2) in the coefficients of $u_2,v_1$; then (3) in those of and in ; then (4) in those of $u_0$; the right-hand sides depend on the solutions of the previous steps. Reducing each matrix to echelon form expresses the pivot unknowns through the others, and the rows without pivot give *conditions*, polynomials with rational coefficients in the unknowns which remain free, which vanish on every solution. Carrying this out (ancillary script): (2) leaves the coefficients $v_{1,7},v_{1,8}$ of $x^7,x^8$ in $v_1$ free and gives no condition; {xref}(3) leaves the coefficients $u_{1,11},u_{1,12}$ of $x^{11},x^{12}$ in $u_1$ and $\kappa$ free and gives no condition; {xref}(4) determines $u_0$ and gives 8 conditions; finally the coefficients of {xref}(5)` give 21 conditions. These 29 polynomials, of degrees 3 and 4 (they are not claimed to be linearly independent), generate the unit ideal of (Gröbner basis, SymPy).
□
As an independent confirmation, the 82 equations of the normalised system in its 56 unknowns, without any elimination, also generate the unit ideal (Gröbner basis, Singular; optional step of the script). As a check of the procedure, the script applies the same elimination to a pair with , and randomly chosen , with the right-hand side of (S2) replaced by its bracket: the conditions then vanish at the chosen values, and no longer do so after the right-hand side is modified.
Proof of Theorem 1.2. A pair as in the standing data gives a solution of (S1)–(S2) by Lemmas 2.1–4.1, hence a normalised one by Lemma 5.1, contradicting Proposition 5.2. □
Scope
Proved here, relative to the cited results: the reduction of Theorem 1.2 to Proposition 5.2 (Lemmas 2.1–5.1). The inputs are (D1), which rests on [1 Proposition 6.1, Theorem 7.6(2), Remark 3.1], and [1 Theorem 2.6, Remarks 1.8, 2.5, 2.10, Corollaries 5.7, 7.4, Propositions 1.13, 2.1, 3.7, 3.9, 5.13, 5.14, 5.16, 5.17, 5.18, 5.19, 7.3], as indicated. The condition on in the standing data is the one of [1 Corollary 5.21(4)], which is established there for the standard pairs attached to a minimal counterexample; the theorem is stated under this condition.
Verified by exact computation: Proposition 5.2; the statements on equation (1) in Lemma 5.1; the arithmetic of Remark 1.3 and Lemma 3.1; the leading terms in Lemma 4.1 (ancillary file
verify_135.pyin the folderanc; SymPy, and Singular for the number of solutions of (1), for which the script writes the input file). The result depends on the correctness of these computations.
Not claimed: a statement on the plane Jacobian conjecture itself; on the pairs with the same starting triple whose polynomial has more than one root (see Remark 1.3); on the third shape of maximal degree 135 with starting corner in [2], which has the corners and ; a new bound on the degree of a counterexample. The completeness of the list of [2] is not re-examined.
[1 Proposition 7.3 and Corollary 7.4], on which Lemma 2.1 rests, are stated in [1] with the indication that their proofs mimic those of Proposition 7.1 and Corollary 7.2; they are applied here to Laurent translates, as in [1 Section 8] and [3]. The references [2] and [3] are arXiv preprints.
The argument has been prepared by the author with AI assistance (Claude, Anthropic). Nothing in this note has been checked by a third party; it has not been validated by professionals.
References
Independent researcher, France
References
- [1]C. Valqui, J. A. Guccione, J. J. Guccione, On the shape of possible counterexamples to the Jacobian Conjecture, J. Algebra 471 (2017), 13–74, doi:10.1016/j.jalgebra.2016.08.039; arXiv:1401.1784v3. Author order as in the journal; statement number refers to the arXiv version v3.DOI
- [2]J. A. Guccione, J. J. Guccione, R. Horruitiner, C. Valqui, Some algorithms related to the Jacobian Conjecture, arXiv:1708.07936v1.arxiv.org/abs/1708.07936
- [3]J. A. Guccione, J. J. Guccione, R. Horruitiner, C. Valqui, Increasing the degree of a possible counterexample to the Jacobian Conjecture from 100 to 108, arXiv:2204.14178.arxiv.org/abs/2204.14178
- [4]W. Decker, G.-M. Greuel, G. Pfister, H. Schönemann, Singular 4-4-1 — A computer algebra system for polynomial computations, https://www.singular.uni-kl.de (2025).