WorksMathematics
The degree pair (88,132) in the plane Jacobian problem: exclusion of the shape with starting corner (11,33) and final corner (19/4,8)
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, exactly one shape has maximal degree 132, up to the exchange of the two polynomials: the standard (2,3)-pairs of degrees (88,132) with starting corner (11,33) and final corner (19/4,8). 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 has exactly two solutions, defined over Q(sqrt(-3)) and exchanged by its non-trivial automorphism; for each of them the system is solved order by order by linear algebra over that field, and the compatibility conditions of the first twelve orders, six polynomials in three unknowns, generate the unit ideal. The computation is exact and is reproduced by an ancillary script (SymPy, and Singular for three Groebner bases). 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 . 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 , [1 Proposition 6.1, Theorem 7.6(2)].
Theorem 1.2. There is no pair as in Standing data 1.1.
This is the shape with corners , and of [2 Section 6]: by [2 Theorem 2.20, items (5), (8), (13)] the second corner lies on the line through of direction given by the direction of the starting triple, which is therefore , and Lemma 2.1 below shows that the middle entry of the triple is then necessarily . We found no exclusion of this shape in the literature we searched; its novelty is not otherwise verified. The four authors treat in [3] the shapes of degree below 125 and obtain the bound 108.
The roots of
Lemma 2.1. Let be a standard -pair in with a regular corner . Then . In Standing data 1.1, with .
Proof. The point lies in , on the line through of direction and below [1 Proposition 5.14 and its proof]: with . The corner is of Case II in the sense of [1 Section 5, before Remark 5.9]: Case I would require [1, Proposition 5.13], and Case III would require that $\rho=4$ divides $\ell=1$ [1 Proposition 5.17]. If then , and is the first entry of a regular corner of [1, Remark 5.11], which requires $\gcd(11-e,33-4e)>1$ [1 Proposition 5.19]` (the other alternative of that proposition, , is impossible for ); but . Hence and .
In one has with ; the bracket of and vanishes, both being powers of up to constants, has at least five distinct roots and . By [1 Proposition 5.16] some root of has multiplicity at least (the root can be taken different from , the multiplicity of the root being smaller than this bound). A root of of multiplicity gives roots of of multiplicity ; so some root of has multiplicity , and by [1 Proposition 5.18] some -pair in has a regular corner at . By [1 Proposition 5.19] this point would be the first entry of a regular corner of Case I or of Case II. Case II requires [1 Proposition 5.14(4)], which fails for . In Case I, with direction , [1 Proposition 1.13, Corollary 5.7(2)] give , which determines , and [1 Proposition 5.13] requires a positive integer with or a positive integer with , where and . For the directions are and no such integer exists (ancillary script). Hence . □
The left side
Lemma 3.1. There is such that
are polynomials in . Then has total degree 22 with top form , has total degree 33 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 ): for every weight between and at which the pair has an edge, the edge form of is a power . In the original variables: for a weight with carrying an edge with starting point , the form is up to a constant, so , and by the condition on ; thus . Here is the starting point of the edge at : an edge of 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 between and ; then [1 Proposition 3.7] applies. The weights with are in the range of the corollary, because . The translation removes this edge [1 Proposition 3.9] (take if there is no such edge). By [1 Proposition 3.9] the leading forms of the translated pair at the weights between and are unchanged, and its -form is the monomial ; so an edge with starting point and could only occur for . The same corollary applies to the translated pair: it lies in , the form and 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). Hence the form of such an edge would again be a power , with a -homogeneous element of whose only possible monomials are and , which forces . So no edge with and starting point remains. 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 every weight with the values of and are positive, since and remain in the supports and , . At the weight , if has an edge there, [1 Proposition 7.3] with gives and proportional values, so (the element , , is not a proper power) and the same translation applies. For the translated pair and , 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 is the monomial at and on the support of the translated . Letting tend to gives there.
The translation replaces by monomials of -weight , so (D1) holds for the translated pair with the same leading forms. Since has , the bound is the bound on the total degree, and for , one has and, by Lemma 2.1, , which gives the top form; likewise for . The Jacobian follows from . □
The right side
Write , so that .
Lemma 4.1. There are with and such that, with
and with the weight , every monomial of has and every monomial of has . The monomials of with lie between and , both with non-zero coefficient; those of with lie between and , both with non-zero coefficient.
Proof. By Lemma 2.1 and its proof, every root of has multiplicity $16\ge \frac{22}{3}$ in , and by [1 Proposition 5.18] the automorphism gives a -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 a -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, , , . By [1 Proposition 5.13] either with , which would give ; or with . If then ; so with , that is, and . 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 (the direction is smaller than ), so there is at most one such step, a translation . Finally , and . □$
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 5.1. Let , , be as in Lemmas 3.1 and 4.1, and put
Write and in . Then implies and ; implies and . Moreover , , , are non-zero, the part of of degree 22 is , and .
Proof. The substitution does not increase the total degree and turns the top form of Lemma 3.1 into ; it preserves the bracket. In the element of Lemma 4.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 3 and 0 cancel by the choice of and . 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 , and the leading part is the image of the corresponding terms. Lemma 4.1 gives the values 2 and 3 for the images of and ; the monomials , , , correspond to , , , .
The finite system
By Lemmas 2.1–5.1, a pair as in the standing data yields a solution of the following system.
(S1) with , , ; with , , ; and .
(S2) with .
(S3) The part of on the line is , with .
In (S1), has 89 possible monomials and has 187. Call the terms with the layer of and those with the layer of , and write , . The bracket of a term of layer of with a term of layer of is a monomial with , and has . So (S2) is equivalent to the equations of order :
With , the layers of order 0 are
with by (S1).
Lemma 6.1. If (S1)–(S3) has a solution, it has one with and . For such a solution , , and is one of exactly two tuples, which have their entries in and are exchanged by its non-trivial automorphism; in both, is a root of
whose discriminant is , and
Proof. The equation of order 0 in (1) reads, for the coefficient of , , and for the coefficient of , ,
because . The system (2) has no solution with and (Gröbner basis, ancillary script). The system (S1)–(S3) is preserved by , which multiplies by , by , each by and by . Since we may assume ; then , and comparing the coefficients of in and in (S3) gives . Adding constants to and , and replacing by , preserves (S1)–(S3) and the layers of order 0, since has no term in layer 0 of . Finally, with and the system (2) has exactly two solutions, in which satisfies the quadratic equation stated (Gröbner basis, ancillary script), and the displayed expressions satisfy (2) for each root (ancillary script). □
Proposition 6.2. The system (S1)–(S3), normalised as in Lemma 6.1, has no solution.
Proof (exact computation). Fix one of the two tuples of Lemma 6.1; its entries lie in , and (S3) fixes the coefficients of on the line : . For the equation of order in (1) is : a linear system in the vector of the coefficients of layer not fixed by (S3) or by the normalisation, with a matrix with entries in and a right-hand side depending on the earlier layers. Reducing to echelon form expresses the pivot coordinates of through and the coordinates which remain free, and the rows of the echelon form without pivot give conditions: polynomials over in the free coordinates of the layers , which vanish on every solution. Carrying this out for (ancillary script): exactly three coordinates remain free, namely (layer 2), (layer 3) and (layer 4), and there are six conditions, one for each of and two for . These six polynomials generate the unit ideal of (Gröbner basis, Singular [4]; the script writes the input file). Hence there is no solution with this tuple. The other tuple is obtained by the non-trivial automorphism of , which transforms the whole computation, so the conclusion is the same. □
As a check of the procedure, the script repeats the computation without condition (S3): it then finds four free coordinates and four conditions for , all vanishing when the free coordinates are 0, in agreement with the fact that alone satisfies (S1) and (S2).
Proof of Theorem 1.2. A pair as in the standing data gives a solution of (S1)–(S3) by Lemmas 2.1–5.1, hence a normalised one by Lemma 6.1, contradicting Proposition 6.2. □
Scope
Proved here, relative to the cited results: the reduction of Theorem 1.2 to Proposition 6.2 (Lemmas 2.1–6.1). The inputs are (D1), which rests on [1 Proposition 6.1, Theorem 7.6(2), Remark 3.1], and [1 Definition 6.2, Theorem 2.6, Remarks 2.5, 2.10, 5.11, 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 6.2; the statements on the system (2) in Lemma 6.1; the arithmetic of Lemmas 2.1 and 4.1; the leading terms in Lemma 5.1 (ancillary file
verify_88_132.pyin the folderanc; SymPy for the linear algebra over , and Singular for three Gröbner bases, for which the script writes the input files). The result depends on the correctness of these computations.
Not claimed: a statement on the plane Jacobian conjecture itself; a new bound on the degree of a counterexample (see [3] for the one obtained by the four authors). The same shape with and exchanged is covered by exchanging them, provided the condition on Succ holds for the polynomial of degree 88; both conditions are part of [1 Corollary 5.21(4)]. The completeness of the list of [2] is not re-examined.
[1 Proposition 7.3 and Corollary 7.4], on which Lemma 3.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 a Laurent translate, 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 for 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.
- [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).