Summary
The Jacobian Conjecture is one of the most important open problems in algebraic geometry. It was included among the millennium open problems in mathematics by Steve Smale in his address to the Millennium ICM (in the year 2000). Given a polynomial mapping F: ℂn→ℂn which has a nonzero constant determinant of its Jacobian matrix (The Jacobian Condition), the conjecture is that F is an invertible morphism. This means that it is injective, surjective and that its inverse mapping F −1 is also polynomial. Even in dimension n=2 this is still open. This article is about the 2-dimensional Jacobian Conjecture. The degree of a polynomial mapping F is the maximum degree of its polynomial coordinate functions. A striking fact that we prove is that given a degree d, the 2-dimensional Jacobian Conjecture can be settled for all the polynomial mappings of degree d or less. If it is disproved then a counterexample is constructed. The magic tool used is the machinery of Gröbner bases. We use the powerful tools of computational algebra and in particular the theory of Gröbner bases in order to solve a certain ideal membership problem in an algebra of many variables polynomials over the complex field. The Jacobian condition satisfied by the mapping F (of degree d or less) is used in a canonical way to construct an ideal (the Jacobian ideal) within this algebra of polynomials. We consider the two relative resultants of the mapping F (one with respect to X and the second with respect to Y). The key theorem we prove is that the Jacobian Conjecture is valid for F if and only if the leading coefficients of these two resultants belong to the Jacobian ideal. We call this result: The resultant reformulation of the Jacobian Conjecture. Now the Gröbner bases machinery comes in to help to decide on the ideal membership problem we have. The algorithm was programmed and was used to prove the 2-dimensional Jacobian Conjecture up to degree 15. The theoretical importance of this algorithm is that it shows that the conjecture is a decidable problem.
The article contains many other important results, both new and old that are relevant to this particular computational approach to this famous open problem. We assume that the reader has some background in the theory and the folklore of the Jacobian Conjecture. The classical paper [H. Bass, E. Connell, and D. Wright, The Jacobian conjecture: reduction of degree and formal expansion of the inverse, Bull. Amer. Math. Soc. (2), 7 (1982), 287–330] and the only comprehensive book in this area [A. van den Essen, Polynomial Automorphisms and the Jacobian Conjecture, Progress in Mathematics, Vol. 190, Birkhäuser, Basel, 2000] are excellent sources. We use the notation introduced in those sources whenever possible.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Adjamagbo, H. Derksen, and A. Van den Essen, On Polynomial Maps in Positive Characteristic and the Jacobian Conjecture, Report 9208, Univ. of Nijmegen, 1992
H. Bass, E. Connell, and D. Wright, The Jacobian conjecture: reduction of degree and formal expansion of the inverse, Bull. Amer. Math. Soc. (2), 7 (1982), 287–330.
B. Buchberger, Gröbner Bases: an algorithmic method in polynomial ideal theory, in N. K. Bose (ed.) Multidimensional Systems Theory, pp. 184–232, Reidel, Dordrecht, 1985.
T. W. Dube, The Structure of Polynomial Ideals and Gröbner Bases, Preprint, 1990
A. van den Essen, A note on Meisters and Olech’s proof of the global asymptotic stability Jacobian conjecture, Pac. J. Math. (2), 151 (1991), 351–357.
A. van den Essen, Polynomial Automorphisms and the Jacobian Conjecture, Progress in Mathematics, Vol. 190, Birkhäuser, Basel, 2000.
C. Gutierrez, and N. Van Chau, Properness and the Jacobian conjecture in ℝ2, Vietnam J. Math. (4), 31 (2003), 421–427.
R. Gebauer and H. M. Moller, On an installation of Buchberger’s algorithm, in L. Robbiano (ed.) Computational Aspects of Commutative Algebra, pp. 141–152, Academic Press, New York, 1988.
J. Hadamard, Sur les transformations pontuelles, Bull. de la Soc. Math. de France, 34 (1906), 71–81.
W. V. D. Hodge, and D. Pedoe, Methods of Algebraic Geometry, Vol. 1, Cambridge University Press, Cambridge, 1947.
O. H. Keller, Ganze Cremona-Transformationen, Monatsh. Math. Phys., 47 (1939), 299–306.
K. Kurdyka and K. Rusek, Surjectivity of certain injective semialgebraic transformations of ℝn, Math. Z., 200 (1988), 141–148.
E. Mayr and A. Meyer, The complexity of the word problem for commutative semigroups and polynomial ideals, Adv. Math., 46 (1982), 305–329.
G. Meisters and C. Olech, Solution of the global asymptotic stability Jacobian conjecture for the polynomial case, in Analyse Mathematique et applications, pp. 373–381, Gautier-Villars, Paris, 1998.
T. Moh, On the global Jacobian Conjecture and the configuration of roots, J. Reine Angew. Math., 340 (1983), 140–212.
H. M. Moller and F. Mora, Upper and lower bounds for the degree of Gröbner bases, in EUROSAM 1984, Lecture Notes in Computer Science, Vol. 174, pp. 172–183, Springer, Berlin, 1984.
P. Nousiainen and M. E. Sweedler, Automorphisms of polynomial and power series rings, J. Pure Appl. Algebra, 29 (1983), 93–97.
R. Peretz, The Topology of Maximal Domains for Local Homeomorphism Mappings on ℝ2 and an Application to the Jacobian Conjecture, Technion Preprint Series NO-MT, 833, 1988.
R. Peretz, Maximal domains for entire functions, J. Anal. Math., 61 (1993), 1–28.
R. Peretz, The variety of the asymptotic values of a real polynomi al ètale map, J. Pure Appl. Algebra, 01/106 (1996), 103–112.
R. Peretz, On counterexamples to Keller’s problem, Illinois J. Math. (02), 40 (1996), 293–303.
R. Peretz, The geometry of the asymptotics of polynomial maps, Israel J. Math., 105 (1998), 1–59.
S. Pinchuk, A counterexample to the strong real Jacobian conjecture, Math. Z., 217 (1994), 1–4.
M. Razar, Polynomial maps with constant Jacobian, Israel J. Math., 32 (1979), 97–106.
N. Van Chau, Two remarks on non-zero constant Jacobian polynomial maps of ℂ2, Ann. Pol. Math. (1), 82 (2003), 39–44.
D. Wright, On the Jacobian conjecture, Illinois J. Math., 25 (1981), 423–440.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Peretz, R. (2009). The 2-dimensional Jacobian Conjecture: A Computational Approach. In: Klin, M., Jones, G.A., Jurišić, A., Muzychuk, M., Ponomarenko, I. (eds) Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01960-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-01960-9_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01959-3
Online ISBN: 978-3-642-01960-9
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)