WorksMathematics
The degree pair (56,140) in the plane Jacobian problem: exclusion of the shape with starting corner (7,21) and final corner (13/7,3)
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, the family F_11 contributes one shape: the standard (2,5)-pairs of degrees (56,140) with starting corner (7,21) and final corner (13/7,3). 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; the left side is reduced as in the treatment of the corner (7,21) by the four authors for the degrees (56,84). In suitable polynomial coordinates the pair is then confined to an explicit finite system of polynomial equations, which has no solution: a chain of linear eliminations with rational coefficients leads to 840=0. The eliminations are reproduced by an ancillary script, which also confirms the result by a Groebner basis computation. 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 of the family of [2 Section 5] for , the only member of that family with degrees at most 150 [2 Section 6]. The first arXiv version of [3] listed this family among those discarded, assuming that two expressions for the intersection number of a Jacobian pair coincide; the revised version (arXiv v2) establishes only an inequality between them and no longer contains that list. To our knowledge the shape has not been excluded elsewhere.
The roots of
Lemma 2.1. In Standing data 1.1, with .
Proof. By [1 Definition 6.2], is a regular corner of the -pair in , with . In one has with ; the bracket of and vanishes, both being powers of up to constants, has at least seven distinct roots and . By [1 Proposition 5.16] some root of has multiplicity at least (the root can be taken different from 0 because ). 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 . For this point is . By [1 Proposition 5.19] it would be the first entry of a regular corner of Case I or of Case II (in the sense of [1 Section 5, before Remark 5.9]). Case II requires [1 Proposition 5.14(4)]. In Case I, with direction , [1 Proposition 1.13, Corollary 5.7(2)] give , that is , , ; by [1 Proposition 5.13] one of , , would have a solution in positive integers, which is not the case. Hence .
The left side
Lemma 3.1. There is such that
are polynomials in . Give the weight 1 and the weight 2. Then has weighted degree 14 with top form , has weighted degree 35 with top form , and
Proof. This is the reduction of [4 Section 4, Case (7, 21)], stated there for ; we give the argument 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 , 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 is 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 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 3 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 weighted degree bound, 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 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 , hence (no direction is smaller than in the interval of directions) and with , 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 . Then [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 lie strictly between and , so , each at most once. 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
Then . Write and . Then implies and ; implies and . Moreover , , , are non-zero, and
Proof. Since , , so ; giving the weight , this substitution does not increase the weighted degree of Lemma 3.1, which gives and , and the top form of becomes , that of becomes . 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 , , 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, , and its leading part is the image of the corresponding terms. Lemma 4.1 gives the values and for the images of and ; the monomials , , , correspond to , , , . Finally , so the bracket in is times the bracket in , which is by Lemma 3.1. □
The finite system
Writing again for (this replaces by , changes , and preserves all the statements of Lemma 5.1, the leading terms of the images and the weighted degrees being unchanged), a pair as in the standing data yields a solution of the following system, in which stands for .
(S1) with , , ; with , , ; and .
(S2) with , .
In (S1), has 15 possible monomials and has 72. The system is deliberately weaker than what is known: the top forms of Lemma 3.1 and the fact that and are polynomials in give further restrictions, which are not needed.
Lemma 6.1. If (S1)–(S2) has a solution, it has one with and . For such a solution , , and .
Proof. The system is preserved by , with replaced by and by ; it multiplies by , by and by , so we may assume that these three coefficients are . The system is also preserved by adding constants to and , and by , since the monomials of satisfy and ; the coefficient of in is and has no such monomial, and the coefficient of in is ; so and then can be chosen to obtain . These operations do not change the terms with of . The terms of (S2) with read , where , because the bracket of and is a multiple of , on which takes the value of the sum minus . This equation has the unique solution stated (ancillary script). □
Proposition 6.2. The system (S1)–(S2), normalised as in Lemma 6.1, has no solution.
Proof. Call the terms with the layer of and those with the layer of ; put in layer and in layer . The bracket of a term of layer of with a term of layer of is a monomial with , and , , have , , . So the coefficients of the monomials with in (S2) form, once the layers are known, a system of linear equations in the unknowns of layer , with a matrix of rational numbers (the brackets with the normalised layers of order ).
Step 1. Solving these linear systems for with exact rational arithmetic (ancillary script; they are all solvable, and leave four coefficients , , , free) one finds, independently of the free coefficients,
The term of (S2) enters at .
Step 2. The only monomials of with are and , and those of with are , , . Hence the coefficients of and in (S2) are
With the values of Step 1 the first gives , and the second becomes . □
As an independent confirmation, the 104 equations of the normalised system (in 82 unknowns: the remaining 12 coefficients of , the remaining 68 coefficients of , and ) generate the unit ideal of the polynomial ring over : the reduced Gröbner basis computed by Singular [5] is (optional step of the ancillary script, which writes the input file).
Proof of Theorem 1.2. A pair as in the standing data gives a solution of (S1)–(S2) 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, 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: Step 1 of Proposition 6.2 (linear systems over , SymPy) and its confirmation by a Gröbner basis (Singular); the equation of order 0 in Lemma 6.1; the arithmetic of Lemmas 2.1 and 4.1; the leading terms in Lemma 5.1 (ancillary file
verify_56_140.pyin the folderanc). The contradiction uses the term on the right-hand side of (S2), that is, the Jacobian of Lemma 3.1.Not claimed: a statement on the plane Jacobian conjecture itself; on the other members of the family or on the families , with the same starting corner; a new bound on the degree of a counterexample (see [4] for the one obtained by the four authors). The same shape with and exchanged is covered by exchanging them. 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 [4]. The references [2] and [4] 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 numbers refer 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, The Jacobian conjecture: Approximate roots and intersection numbers, Pro Mathematica 30 (2019), no. 60, 51–89; arXiv:1708.09367v2 (v1 under the title The Jacobian Conjecture: Discarding infinite families using intersection numbers).arxiv.org/abs/1708.09367
- [4]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
- [5]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).