Jacobian Matrix and Determinant
The Jacobian captures how a multivariable function distorts space locally. When you change variables in a multiple integral, the Jacobian tells you exactly how infinitesimal areas or volumes scale under the transformation. Without it, you can't correctly convert into (or any other coordinate system).
This section covers the Jacobian matrix, its determinant, and the key properties that make change-of-variables work. We'll also connect it to coordinate transformations and the inverse function theorem.
Definition and Components of the Jacobian Matrix
For a function , the Jacobian matrix is the matrix of all first-order partial derivatives. Entry is , the partial derivative of the -th output component with respect to the -th input variable.
For a transformation in , the Jacobian matrix looks like:
The Jacobian determinant (often just called "the Jacobian") is :
Two critical facts about this determinant:
- A non-zero determinant at a point means the transformation is locally invertible there.
- The absolute value of the determinant gives the local scaling factor: how much an infinitesimal area (or volume, in higher dimensions) stretches or shrinks under the transformation.
Concrete example. For polar coordinates, , :
That's where the familiar factor of in comes from.
Properties and Interpretation of the Jacobian
The Jacobian matrix is the best linear approximation of a differentiable function near a given point. Think of it as the multivariable generalization of the derivative. It encodes all the local behavior: stretching, rotation, reflection, and shearing.
- If the Jacobian matrix exists at a point, the function is differentiable there. Differentiability is stronger than mere continuity; it guarantees the function behaves smoothly enough for linear approximation to work.
- The rank of the Jacobian matrix determines local injectivity and surjectivity. For a square Jacobian (), full rank is equivalent to a non-zero determinant, which means the function is locally one-to-one.
- A positive determinant means the transformation preserves orientation (e.g., it doesn't flip a region into its mirror image). A negative determinant means orientation is reversed. For integration, you take the absolute value either way.
Coordinate Transformations
![Definition and Components of the Jacobian Matrix, [벡터 미적분학] 벡터함수의 기울기 & 자코비안 (Gradient for Vector-Valued Function & Jacobian)](https://storage.googleapis.com/static.prod.fiveable.me/search-images%2F%22Jacobian_matrix_definition_components_partial_derivatives_vector-valued_function_calculus_IV_properties_image%22-img.png)
Concept and Purpose
A coordinate transformation maps points from one coordinate system to another while preserving the underlying geometry. You use them to exploit symmetry or simplify the region of integration.
Common transformations you'll work with:
- Cartesian to polar: , useful for circular regions
- Cartesian to cylindrical: , useful for problems with axial symmetry
- Cartesian to spherical: , useful for spherical regions
- Custom substitutions: any transformation designed to simplify a particular integral
The general change-of-variables formula in two dimensions is:
where is the region in the -plane that maps onto under .
Applying the Chain Rule in Coordinate Transformations
The chain rule connects partial derivatives across coordinate systems. If you have a function expressed in and you switch to , then:
In matrix form, this is exactly multiplication by the Jacobian matrix:
The Jacobian matrix is the bridge that ensures derivatives transform correctly between coordinate systems.
Properties of Coordinate Transformations
For a change of variables to work properly in an integral, the transformation should be bijective (one-to-one and onto) on the interior of the region, except possibly on a set of measure zero (like boundary curves).
- A bijective transformation has a unique inverse: you can map back from to without ambiguity.
- Bijective transformations preserve topological properties like connectedness and compactness, so the shape of your integration region stays well-behaved.
- Minor failures of bijectivity on the boundary (e.g., polar coordinates mapping and to the same ray) don't affect the integral because those boundary sets have zero area.

Inverse Function Theorem
Statement and Implications
Inverse Function Theorem. If is continuously differentiable () and at a point , then there exists an open neighborhood of such that maps bijectively onto an open set , and the inverse is also continuously differentiable.
In plain terms: if the Jacobian determinant isn't zero at a point, the function is locally invertible near that point, and the inverse is smooth. This is the theoretical guarantee that your coordinate transformation actually works in a neighborhood of that point.
The theorem gives a sufficient condition, not a necessary one. A function could still be locally invertible even if the Jacobian determinant is zero, but the theorem won't help you prove it.
Connection to Change of Variables
The inverse function theorem is what justifies the change-of-variables formula. When you write , you need to be locally invertible so that the mapping between regions is well-defined. The non-vanishing Jacobian determinant guarantees this.
The Jacobian of the Inverse
If is locally invertible, the Jacobian of the inverse function satisfies:
This follows directly from the chain rule applied to . A useful consequence for determinants:
So if you know the Jacobian going one direction (say, from to ), you can immediately find the Jacobian going the other direction by taking the reciprocal of the determinant. For polar coordinates, the Jacobian of the inverse transformation has determinant .