WorksMathematics
The degree pair (84,126) in the plane Jacobian problem: exclusion of the shape with final corner (19/7,5)
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 maximal degree 126. One of them consists of the standard (2,3)-pairs of degrees (84,126) with starting corner (7,35) and final corner (19/7,5), normalised as in Corollary 5.21 of Guccione-Guccione-Valqui. We show that no such pair exists. The two sides of the Newton polygon are described by the results of Guccione-Guccione-Valqui; in suitable polynomial coordinates they confine the pair to an explicit finite system of polynomial equations, which is solved order by order and has no solution. All statements are proved relative to the cited results; the final step is an exact computation, reproduced by an ancillary script (SymPy, and Singular for one ideal membership). The other shape of maximal degree 126 is the subject of a companion note. The argument has not yet been examined by specialists.
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, after rescaling and :
(D1) the support of lies in , that of in , and
with monic of degree 5, [1 Proposition 6.1, Theorem 7.6(2)]. Moreover has a single root: with .
Theorem 1.2. There is no pair as in Standing data 1.1.
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 a -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 ; it is the only shape with these degrees in the list of [2 Section 6]. If has no root of multiplicity at least 4, then , which is impossible by the arithmetic of Lemma 3.1 below: the corner admits neither Case I nor Case II. The remaining case , with corner , is not excluded by that arithmetic alone; for it we rely on [2].
The first arXiv version of [3] (August 2017) listed the shape of the standing data among those discarded, assuming that two expressions and for the intersection number of a Jacobian pair, due to Y. Xu, coincide. The published version [3] establishes the formula but only an inequality for , and no longer contains that list. To our knowledge the shape has not been excluded elsewhere.
The left side
Lemma 2.1. There is such that
are polynomials in . Give the weight 2 and the weight 1. Then has weighted degree 28 with top form , has weighted degree 42 with top form , and
Proof. 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 . As in the proof of [1 Proposition 8.1]: 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 and to every pair obtained from it by a translation of the second variable by a Laurent monomial in the first (the form , the degrees , and are unchanged). It yields: 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 end point , the form is up to a constant, so , and by the condition on . Here is the starting point of the edge at , because (compare [1 Section 8]); and the statement applies at every stage of the process below, so that no edge with a non-integer appears after a translation. The translation removes this edge and leaves the forms of smaller unchanged [1 Proposition 3.9]. After at most three such translations () no edge of weight , , has end point . 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 , . The same holds for . For every weight with the values of and are positive, since and remain in the supports of the translated polynomials and , . At a weight where has an edge, [1 Proposition 7.3] with (its hypothesis on the brackets holds, because is a constant) gives and proportional values, so and the same translation applies. At the remaining weights the leading forms commute by [1 Proposition 1.13], so is proportional to a power of the monomial [1 Proposition 2.1(2)], that is, is the monomial at . Hence on the support of .
A translation with 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 , which gives the top form; likewise for . 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 . The monomials of with lie between and , both with non-zero coefficient; those of with lie between and , both with non-zero coefficient.
Proof. In one has , so every root of has multiplicity 10 (with , , ). By [1, Proposition 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 . In Case III, [1 Proposition 5.17] gives , hence 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 . There , so [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 4.1. Let , , , be as in Lemmas and , and put
Write and in . Then implies , and implies . Moreover and .
Proof. In the element of Lemma is with ; it is invertible. The assignment , defines a ring morphism which sends to and to , because in . Expanding, the image of has and leading term , and the image of has and leading term : the terms of weights , , cancel by the choice of , , , and no monomial has weight . 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 gives , ; the monomials and correspond to and .
The finite system
By Lemmas and , and since the substitution preserves the weighted degree ( of weight ) and turns the top form of into , 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 .
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 :
Lemma 5.1. If (S1)–(S3) has a solution, it has one with , , ,
and .
Proof. The system is preserved by , which multiplies by , by , by and by . So we may assume and ; the remaining freedom is , , , which multiplies by , a cube root of unity. By (S1) the layers of order 0 are and , and by (S3). The equation of order 0 then has exactly three solutions, with , permuted by , ; one of them is the pair displayed (ancillary script). Finally replace by and by : this preserves (S1)–(S3) and the layers of order 0, since has no term in layers 0 and 1 of , and . □
Proposition 5.2. The system (S1)–(S3), normalised as in Lemma 5.1, has no solution.
Proof (exact computation). 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 of rational numbers and a right-hand side depending on the earlier layers. Every solution satisfies , whose general solution expresses through and those coordinates of which remain free; substituting it, the entries of are conditions: polynomials with rational coefficients in the free coordinates of the layers , which vanish on every solution. Carrying this out for (ancillary script):
(A) For exactly five coordinates remain free, namely , , , , , and the script records 28 distinct conditions. The ideal they generate in the polynomial ring over in these five variables contains , and (Gröbner basis, Singular [8]).
(B) With , for the free coordinates are , and the script records 26 distinct conditions; they generate the unit ideal of (Gröbner basis, SymPy).
By (A) the three coordinates vanish on every solution, and by (B) there is none. Independently of this two-step argument, the 73 distinct recorded conditions of orders in the five free coordinates generate the unit ideal (Gröbner basis, Singular; optional step of the script). □
As a check of the procedure, the script repeats step (B) without condition (S3) (with the same three coordinates equal to zero, orders $k\leq 36): the conditions obtained all vanish at the origin of the free coordinates.
Proof of Theorem 1.2. A pair as in the standing data gives a solution of (S1)–(S3), 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 2.5, 2.10, 5.8, Corollaries 5.7, 7.4, Propositions 1.13, 2.1, 3.7, 3.9, 5.13, 5.14, 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 equation of order 0 in Lemma 5.1; the arithmetic of Lemma 3.1 and Remark 1.3; the leading terms in Lemma 4.1 (ancillary
file verify_84_126.py in the folder anc; SymPy, and Singular for step (A), for which the script also writes the input file). Step (A) was not obtained with SymPy alone.
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). The other shape of maximal degree 126 in [2], with starting corner and degrees , is treated in the companion note [7]. The same shape with and exchanged is covered by exchanging them. No new bound on the degree of a counterexample (see [4] for the published one) is claimed here.
[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 in [5, 6].
The argument has been checked only by the author with AI assistance (Claude, Anthropic); 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. 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]D. Niedbala Giraudin, A residue obstruction for the family F₂ with (m,n) = (3,5): the degree pair (75, 125) in the plane Jacobian problem, Hexagon hexagon:2611.00675 (2026).hub.valency.io/works/W_rab5qd4g
- [6]D. Niedbala Giraudin, A residue obstruction for the whole family F₂ in the plane Jacobian problem, Hexagon hexagon:2611.00685 (2026).
- [7]D. Niedbala Giraudin, The degree pair (126, 84) in the plane Jacobian problem: the point (16/3, 10) is not a regular corner, Hexagon hexagon:2611.00709 (2026).hub.valency.io/works/W_4y7b75au
- [8]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).