Jacobian conjecture

Last updated
Jacobian conjecture
Field Algebraic geometry
Conjectured by Ott-Heinrich Keller
Conjectured in1939
Equivalent to Dixmier conjecture

In mathematics, the Jacobian conjecture is a famous unsolved problem concerning polynomials in several variables. It states that if a polynomial function from an n-dimensional space to itself has Jacobian determinant which is a non-zero constant, then the function has a polynomial inverse. It was first conjectured in 1939 by Ott-Heinrich Keller, [1] and widely publicized by Shreeram Abhyankar, as an example of a difficult question in algebraic geometry that can be understood using little beyond a knowledge of calculus.

Contents

The Jacobian conjecture is notorious for the large number of attempted proofs that turned out to contain subtle errors. As of 2018, there are no plausible claims to have proved it. Even the two-variable case has resisted all efforts. There are currently no known compelling reasons for believing the conjecture to be true, and according to van den Essen [2] there are some suspicions that the conjecture is in fact false for large numbers of variables (indeed, there is equally also no compelling evidence to support these suspicions). The Jacobian conjecture is number 16 in Stephen Smale's 1998 list of Mathematical Problems for the Next Century.

The Jacobian determinant

Let N > 1 be a fixed integer and consider polynomials f1, ..., fN in variables X1, ..., XN with coefficients in a field k. Then we define a vector-valued function F: kN → kN by setting:

F(X1, ..., XN) = (f1(X1, ...,XN),..., fN(X1,...,XN)).

Any map F: kN → kN arising in this way is called a polynomial mapping.

The Jacobian determinant of F, denoted by JF, is defined as the determinant of the N × N Jacobian matrix consisting of the partial derivatives of fi with respect to Xj:

then JF is itself a polynomial function of the N variables X1, ..., XN.

Formulation of the conjecture

It follows from the multivariable chain rule that if F has a polynomial inverse function G: kN → kN, then JF has a polynomial reciprocal, so is a nonzero constant. The Jacobian conjecture is the following partial converse:

Jacobian conjecture: Let k have characteristic 0. If JF is a non-zero constant, then F has an inverse function G: kN → kN which is regular, meaning its components are polynomials.

According to van den Essen, [2] the problem was first conjectured by Keller in 1939 for the limited case of two variables and integer coefficients.

The obvious analogue of the Jacobian conjecture fails if k has characteristic p > 0 even for one variable. The characteristic of a field, if it is not zero, must be prime, so at least 2. The polynomial x − xp has derivative 1 − p xp−1 which is 1 (because px is 0) but it has no inverse function. However, Kossivi Adjamagbo  [ ht ] suggested extending the Jacobian conjecture to characteristic p > 0 by adding the hypothesis that p does not divide the degree of the field extension k(X) / k(F). [3]

The existence of a polynomial inverse is obvious if F is simply a set of functions linear in the variables, because then the inverse will also be a set of linear functions. A simple non-linear example is given by

so that the Jacobian determinant is

In this case the inverse exists as the polynomials

But if we modify F slightly, to

then the determinant is

which is not constant, and the Jacobian conjecture does not apply. The function still has an inverse:

but the expression for x is not a polynomial.

The condition JF ≠ 0 is related to the inverse function theorem in multivariable calculus. In fact for smooth functions (and so in particular for polynomials) a smooth local inverse function to F exists at every point where JF is non-zero. For example, the map x → x + x3 has a smooth global inverse, but the inverse is not polynomial.

Results

Stuart Sui-Sheng Wang proved the Jacobian conjecture for polynomials of degree 2. [4] Hyman Bass, Edwin Connell, and David Wright showed that the general case follows from the special case where the polynomials are of degree 3, or even more specifically, of cubic homogeneous type, meaning of the form F = (X1 + H1, ..., Xn + Hn), where each Hi is either zero or a homogeneous cubic. [5] Ludwik Drużkowski showed that one may further assume that the map is of cubic linear type, meaning that the nonzero Hi are cubes of homogeneous linear polynomials. [6] It seems that Drużkowski's reduction is one most promising way to go forward. These reductions introduce additional variables and so are not available for fixed N.

Edwin Connell and Lou van den Dries proved that if the Jacobian conjecture is false, then it has a counterexample with integer coefficients and Jacobian determinant 1. [7] In consequence, the Jacobian conjecture is true either for all fields of characteristic 0 or for none. For fixed dimension N, it is true if it holds for at least one algebraically closed field of characteristic 0.

Let k[X] denote the polynomial ring k[X1, ..., Xn] and k[F] denote the k-subalgebra generated by f1, ..., fn. For a given F, the Jacobian conjecture is true if, and only if, k[X] = k[F]. Keller (1939) proved the birational case, that is, where the two fields k(X) and k(F) are equal. The case where k(X) is a Galois extension of k(F) was proved by Andrew Campbell for complex maps [8] and in general by Michael Razar [9] and, independently, by David Wright. [10] Tzuong-Tsieng Moh checked the conjecture for polynomials of degree at most 100 in two variables. [11] [12]

Michiel de Bondt and Arno van den Essen [13] [14] and Ludwik Drużkowski [15] independently showed that it is enough to prove the Jacobian Conjecture for complex maps of cubic homogeneous type with a symmetric Jacobian matrix, and further showed that the conjecture holds for maps of cubic linear type with a symmetric Jacobian matrix, over any field of characteristic 0.

The strong real Jacobian conjecture was that a real polynomial map with a nowhere vanishing Jacobian determinant has a smooth global inverse. That is equivalent to asking whether such a map is topologically a proper map, in which case it is a covering map of a simply connected manifold, hence invertible. Sergey Pinchuk constructed two variable counterexamples of total degree 35 and higher. [16]

It is well known that the Dixmier conjecture implies the Jacobian conjecture. [5] Conversely, it is shown by Yoshifumi Tsuchimoto [17] and independently by Alexei Belov-Kanel and Maxim Kontsevich [18] that the Jacobian conjecture for 2N variables implies the Dixmier conjecture in N dimensions. A self-contained and purely algebraic proof of the last implication is also given by Kossivi Adjamagbo and Arno van den Essen [19] who also proved in the same paper that these two conjectures are equivalent to the Poisson conjecture.

See also

Related Research Articles

<span class="mw-page-title-main">Derivative</span> Instantaneous rate of change (mathematics)

In mathematics, the derivative shows the sensitivity of change of a function's output with respect to the input. Derivatives are a fundamental tool of calculus. For example, the derivative of the position of a moving object with respect to time is the object's velocity: this measures how quickly the position of the object changes when time advances.

In mathematics, the determinant is a scalar value that is a function of the entries of a square matrix. The determinant of a matrix A is commonly denoted det(A), det A, or |A|. Its value characterizes some properties of the matrix and the linear map represented by the matrix. In particular, the determinant is nonzero if and only if the matrix is invertible and the linear map represented by the matrix is an isomorphism. The determinant of a product of matrices is the product of their determinants (which follows directly from the above properties).

<span class="mw-page-title-main">Diffeomorphism</span> Isomorphism of smooth manifolds; a smooth bijection with a smooth inverse

In mathematics, a diffeomorphism is an isomorphism of smooth manifolds. It is an invertible function that maps one differentiable manifold to another such that both the function and its inverse are differentiable.

In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots of a real-valued function. The most basic version starts with a real-valued function f, its derivative f′, and an initial guess x0 for a root of f. If f satisfies certain assumptions and the initial guess is close, then

<span class="mw-page-title-main">Probability density function</span> Function whose integral over a region describes the probability of an event occurring in that region

In probability theory, a probability density function (PDF), density function, or density of an absolutely continuous random variable, is a function whose value at any given sample in the sample space can be interpreted as providing a relative likelihood that the value of the random variable would be equal to that sample. Probability density is the probability per unit length, in other words, while the absolute likelihood for a continuous random variable to take on any particular value is 0, the value of the PDF at two different samples can be used to infer, in any particular draw of the random variable, how much more likely it is that the random variable would be close to one sample compared to the other sample.

In vector calculus, the Jacobian matrix of a vector-valued function of several variables is the matrix of all its first-order partial derivatives. When this matrix is square, that is, when the function takes the same number of variables as input as the number of vector components of its output, its determinant is referred to as the Jacobian determinant. Both the matrix and the determinant are often referred to simply as the Jacobian in literature.

In the mathematical field of differential geometry, a metric tensor is an additional structure on a manifold M that allows defining distances and angles, just as the inner product on a Euclidean space allows defining distances and angles there. More precisely, a metric tensor at a point p of M is a bilinear form defined on the tangent space at p, and a metric tensor on M consists of a metric tensor at each point p of M that varies smoothly with p.

In mathematics, specifically differential calculus, the inverse function theorem gives a sufficient condition for a function to be invertible in a neighborhood of a point in its domain: namely, that its derivative is continuous and non-zero at the point. The theorem also gives a formula for the derivative of the inverse function. In multivariable calculus, this theorem can be generalized to any continuously differentiable, vector-valued function whose Jacobian determinant is nonzero at a point in its domain, giving a formula for the Jacobian matrix of the inverse. There are also versions of the inverse function theorem for complex holomorphic functions, for differentiable maps between manifolds, for differentiable functions between Banach spaces, and so forth.

<span class="mw-page-title-main">Affine variety</span> Algebraic variety defined within an affine space

In algebraic geometry, an affine algebraic set is the set of the common zeros over an algebraically closed field k of some family of polynomials in the polynomial ring An affine variety or affine algebraic variety, is an affine algebraic set such that the ideal generated by the defining polynomials is prime.

In mathematics, a submersion is a differentiable map between differentiable manifolds whose differential is everywhere surjective. This is a basic concept in differential topology. The notion of a submersion is dual to the notion of an immersion.

In algebra and in particular in algebraic combinatorics, the ring of symmetric functions is a specific limit of the rings of symmetric polynomials in n indeterminates, as n goes to infinity. This ring serves as universal structure in which relations between symmetric polynomials can be expressed in a way independent of the number n of indeterminates. Among other things, this ring plays an important role in the representation theory of the symmetric group.

In multivariable calculus, the implicit function theorem is a tool that allows relations to be converted to functions of several real variables. It does so by representing the relation as the graph of a function. There may not be a single function whose graph can represent the entire relation, but there may be such a function on a restriction of the domain of the relation. The implicit function theorem gives a sufficient condition to ensure that there is such a function.

In mathematics, a symmetric polynomial is a polynomial P(X1, X2, …, Xn) in n variables, such that if any of the variables are interchanged, one obtains the same polynomial. Formally, P is a symmetric polynomial if for any permutation σ of the subscripts 1, 2, ..., n one has P(Xσ(1), Xσ(2), …, Xσ(n)) = P(X1, X2, …, Xn).

In mathematics, specifically in commutative algebra, the elementary symmetric polynomials are one type of basic building block for symmetric polynomials, in the sense that any symmetric polynomial can be expressed as a polynomial in elementary symmetric polynomials. That is, any symmetric polynomial P is given by an expression involving only additions and multiplication of constants and elementary symmetric polynomials. There is one elementary symmetric polynomial of degree d in n variables for each positive integer d ≤ n, and it is formed by adding together all distinct products of d distinct variables.

<span class="mw-page-title-main">Critical point (mathematics)</span> Point where the derivative of a function is zero

Critical point is a term used in many branches of mathematics.

In mathematics, a change of variables is a basic technique used to simplify problems in which the original variables are replaced with functions of other variables. The intent is that when expressed in new variables, the problem may become simpler, or equivalent to a better understood problem.

In mathematics, a D-module is a module over a ring D of differential operators. The major interest of such D-modules is as an approach to the theory of linear partial differential equations. Since around 1970, D-module theory has been built up, mainly as a response to the ideas of Mikio Sato on algebraic analysis, and expanding on the work of Sato and Joseph Bernstein on the Bernstein–Sato polynomial.

In mathematics, a system of equations is considered overdetermined if there are more equations than unknowns. An overdetermined system is almost always inconsistent when constructed with random coefficients. However, an overdetermined system will have solutions in some cases, for example if some equation occurs several times in the system, or if some equations are linear combinations of the others.

In mathematics, a set of n functions f1, f2, ..., fn is unisolvent on a domain Ω if the vectors

In mathematics, Manin matrices, named after Yuri Manin who introduced them around 1987–88, are a class of matrices with elements in a not-necessarily commutative ring, which in a certain sense behave like matrices whose elements commute. In particular there is natural definition of the determinant for them and most linear algebra theorems like Cramer's rule, Cayley–Hamilton theorem, etc. hold true for them. Any matrix with commuting elements is a Manin matrix. These matrices have applications in representation theory in particular to Capelli's identity, Yangian and quantum integrable systems.

References

  1. ↑ Keller, Ott-Heinrich (1939), "Ganze Cremona-Transformationen", Monatshefte für Mathematik und Physik, 47 (1): 299–306, doi: 10.1007/BF01695502 , ISSN   0026-9255
  2. 1 2 van den Essen, Arno (1997), "Polynomial automorphisms and the Jacobian conjecture" (PDF), Algèbre non commutative, groupes quantiques et invariants (Reims, 1995), Sémin. Congr., vol. 2, Paris: Soc. Math. France, pp. 55–81, MR   1601194
  3. ↑ Adjamagbo, Kossivi (1995), "On separable algebras over a U.F.D. and the Jacobian conjecture in any characteristic", Automorphisms of affine spaces (Curaçao, 1994), Dordrecht: Kluwer Acad. Publ., pp. 89–103, doi: 10.1007/978-94-015-8555-2_5 , ISBN   978-90-481-4566-9, MR   1352692
  4. ↑ Wang, Stuart Sui-Sheng (August 1980), "A Jacobian criterion for separability", Journal of Algebra, 65 (2): 453–494, doi: 10.1016/0021-8693(80)90233-1
  5. 1 2 Bass, Hyman; Connell, Edwin H.; Wright, David (1982), "The Jacobian conjecture: reduction of degree and formal expansion of the inverse", Bulletin of the American Mathematical Society, New Series, 7 (2): 287–330, doi: 10.1090/S0273-0979-1982-15032-7 , ISSN   1088-9485, MR   0663785
  6. ↑ Drużkowski, Ludwik M. (1983), "An effective approach to Keller's Jacobian conjecture", Mathematische Annalen , 264 (3): 303–313, doi: 10.1007/bf01459126 , MR   0714105
  7. ↑ Connell, Edwin; van den Dries, Lou (1983), "Injective polynomial maps and the Jacobian conjecture", Journal of Pure and Applied Algebra, 28 (3): 235–239, doi: 10.1016/0022-4049(83)90094-4 , MR   0701351
  8. ↑ Campbell, L. Andrew (1973), "A condition for a polynomial map to be invertible", Mathematische Annalen, 205 (3): 243–248, doi: 10.1007/bf01349234 , MR   0324062
  9. ↑ Razar, Michael (1979), "Polynomial maps with constant Jacobian", Israel Journal of Mathematics , 32 (2–3): 97–106, doi: 10.1007/bf02764906 , MR   0531253
  10. ↑ Wright, David (1981), "On the Jacobian conjecture", Illinois Journal of Mathematics, 25 (3): 423–440, doi: 10.1215/ijm/1256047158 , MR   0620428
  11. ↑ Moh, Tzuong-Tsieng (1983), "On the Jacobian conjecture and the configurations of roots", Journal für die reine und angewandte Mathematik , 1983 (340): 140–212, doi:10.1515/crll.1983.340.140, ISSN   0075-4102, MR   0691964, S2CID   116143599
  12. ↑ Moh, Tzuong-Tsieng, On the global Jacobian conjecture for polynomials of degree less than 100, preprint
  13. ↑ de Bondt, Michiel; van den Essen, Arno (2005), "A reduction of the Jacobian conjecture to the symmetric case", Proceedings of the American Mathematical Society, 133 (8): 2201–2205, doi: 10.1090/S0002-9939-05-07570-2 , MR   2138860
  14. ↑ de Bondt, Michiel; van den Essen, Arno (2005), "The Jacobian conjecture for symmetric Drużkowski mappings", Annales Polonici Mathematici , 86 (1): 43–46, doi: 10.4064/ap86-1-5 , MR   2183036
  15. ↑ Drużkowski, Ludwik M. (2005), "The Jacobian conjecture: symmetric reduction and solution in the symmetric cubic linear case", Annales Polonici Mathematici, 87: 83–92, doi: 10.4064/ap87-0-7 , MR   2208537
  16. ↑ Pinchuk, Sergey (1994), "A counterexample to the strong real Jacobian conjecture", Mathematische Zeitschrift, 217 (1): 1–4, doi: 10.1007/bf02571929 , MR   1292168
  17. ↑ Tsuchimoto, Yoshifumi (2005), "Endomorphisms of Weyl algebra and -curvatures", Osaka Journal of Mathematics, 42 (2): 435–452, ISSN   0030-6126
  18. ↑ Belov-Kanel, Alexei; Kontsevich, Maxim (2007), "The Jacobian conjecture is stably equivalent to the Dixmier conjecture", Moscow Mathematical Journal, 7 (2): 209–218, arXiv: math/0512171 , Bibcode:2005math.....12171B, doi:10.17323/1609-4514-2007-7-2-209-218, MR   2337879, S2CID   15150838
  19. ↑ Adjamagbo, Pascal Kossivi; van den Essen, Arno (2007), "A proof of the equivalence of the Dixmier, Jacobian and Poisson conjectures" (PDF), Acta Mathematica Vietnamica, 32: 205–214, MR   2368008
This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.