Why Is the Jacobian of a Polynomial Isomorphism a Nonzero Constant?
At a glance
- 1. Use the inverse
Let ψ be the polynomial inverse of φ.
- 2. Apply the chain rule
Differentiate ψ composed with φ to get a product of Jacobian matrices equal to the identity.
- 3. Take determinants
The Jacobian determinants multiply to 1, so Jφ is a unit in the polynomial ring.
- 4. Identify the units
The only units in a polynomial ring over a field are nonzero constants.
Assume the usual setting: is a polynomial isomorphism of affine -space over a field , and denotes the determinant of its Jacobian matrix. The key point is that an isomorphism has a polynomial inverse. Differentiating the composition of the map and its inverse shows that has a multiplicative inverse in the polynomial ring . The units of that ring are exactly the nonzero elements of , so must be a nonzero constant.
Apply the chain rule to the inverse
Write the coordinate functions of as
where each is a polynomial. Because is an isomorphism, there is an inverse polynomial map , with equal to the identity map.
For a polynomial map , its Jacobian matrix is
and its Jacobian determinant is . The chain rule for the composition gives
Since is the identity, its Jacobian matrix is the identity matrix. Taking determinants yields
Both factors are polynomials in . Thus has a polynomial multiplicative inverse: namely, .
Why this forces a constant
In a polynomial ring over a field, a polynomial is invertible only if it is a nonzero constant. For example, if nonzero polynomials and satisfy , then the total degree of the product is the sum of their total degrees. The product has degree zero, so both and must have degree zero. Consequently,
where denotes the nonzero elements of $k. This proves that the Jacobian determinant is a non-zero constant.
The same argument can be written as a direct calculation. For any point , the chain rule gives
The determinant is therefore not merely nonzero at each point: it is invertible as a polynomial, which is the stronger fact needed to conclude it is constant.
Worked example
Consider the polynomial map defined by
Its inverse is , so is an isomorphism. Its Jacobian matrix and determinant are
The inverse has Jacobian determinant as well, consistent with the chain-rule identity. More generally, a polynomial automorphism can have any nonzero constant as its Jacobian determinant; for instance, an invertible linear map has determinant equal to the determinant of its matrix.
Common mistakes and scope
- Showing only that the determinant is nonzero at every point: Pointwise nonvanishing alone is not the argument. The chain rule shows that the determinant has a polynomial inverse. That makes it a unit in the coordinate ring.
- Assuming a polynomial map with nonzero constant Jacobian is automatically an isomorphism: The proof establishes a necessary condition, not a general converse. In characteristic zero and dimension at least two, the converse for polynomial maps of affine space is the Jacobian conjecture, an open problem. In positive characteristic it can fail: over a field of characteristic , the one-variable polynomial has derivative but is not a polynomial automorphism.
- Using the statement without specifying what means: Here is the determinant of the Jacobian matrix of a polynomial map . For maps between more general varieties, the appropriate Jacobian or determinant depends on the varieties and the chosen local coordinates; the affine-space argument applies directly in the stated setting.
Spotted an error? Send a correction. Read how we write and check articles in our editorial policy.