Coordinate Transformations
A coordinate transformation is a change of coordinate system: every point of a region keeps its position in space but gets a new address. The reason to do this is practical. Many shapes and functions are awkward to describe in standard Cartesian coordinates and become much simpler in a coordinate system that matches their symmetry. The circle — a quadratic equation in two variables — reduces to the single equation in polar coordinates. Spheres simplify the same way in spherical coordinates, cylinders in cylindrical coordinates. The relabelling itself isn’t the goal; the cleaner description it unlocks is.
In one dimension this idea is just ordinary substitution — replacing by some inside an integral, for instance — and adds nothing on top of 1D calculus. Coordinate transformations only become genuinely useful in for , where the relabelling can mix several coordinates together at once. The local distortion this mixing introduces — how much the new coordinate grid is stretched or twisted near each point — is what the rest of this chapter is about.
Cartesian Coordinates
Before generalizing, it pays to name the coordinate system we have been silently using all along. The “default” understanding of coordinates — the perpendicular-grid picture so familiar that it disappears into the background — is itself a specific named construction.
The Cartesian coordinates of a point are its signed perpendicular distances from mutually perpendicular axes, each carrying the same uniform unit of length. Equivalently, every point has a unique representation
against the standard basis , and the components are its Cartesian coordinates. The system formed by these axes is the Cartesian coordinate system.
What singles out the Cartesian system is its rigidity: axes are straight lines, they are mutually perpendicular, the spacing along each is uniform, and the basis vectors are the same everywhere. That uniformity is exactly why descriptions of objects with rotational, radial, or spherical symmetry (a circle, a ball, a torus) come out clumsy in Cartesian form — the symmetry of the object doesn’t match the symmetry of the grid. Recognizing this as a choice of coordinate system, rather than a built-in feature of space itself, is what opens the door to the alternatives developed in this chapter.
Definition
The objects involved are two open subsets and a function that converts addresses in into addresses in .
Let be open and let be a continuously differentiable bijection. Then is called a coordinate transformation if its inverse is also continuously differentiable.
The bijectivity is the load-bearing requirement: a coordinate transformation is, at heart, a bijective relabelling of points. Every point in gets exactly one new address in , and every address in corresponds to exactly one point in . Without it the new “coordinates” wouldn’t pin down points unambiguously — two distinct points could share the same address (failure of injectivity), or an address could refer to no point at all (failure of surjectivity onto the target region). The two-sided continuous-differentiability requirement adds that the relabelling distorts space smoothly in both directions: small steps in are mapped to small steps in and vice versa, so derivatives, gradients, and integrals carry over cleanly between the two coordinate systems.
Coordinate Transformation Matrix and the Jacobian
The first-order behavior of at a point is captured by exactly the same object as for any other differentiable multivariate function — its Jacobian matrix. In the context of a coordinate transformation, this matrix gets a context-specific name.
For a coordinate transformation with , the coordinate transformation matrix is the Jacobian matrix of :
Because maps to , the matrix is square (), so its determinant is defined. That determinant gets its own name.
The Jacobian determinant (or simply the Jacobian) of a coordinate transformation at is the determinant of its coordinate transformation matrix:
Neither object is conceptually new. The Jacobian matrix is the same one defined for any differentiable multivariate function, and the determinant is the same determinant from linear algebra — only the role they play here is new. The matrix is the local linear approximation of the relabelling at , and the scalar measures the local volume-scaling factor of that linear approximation: how much an infinitesimal volume element in is stretched or compressed when carried over to . This one number is what makes the change-of-variables formula in multivariate integration work, and it is the reason the Jacobian determinant is worth singling out in this setting.
The linear case: matrix multiplication. Multiplying by an invertible matrix, which defines the transformation , is the simplest example of a coordinate transformation. The picture is concrete: takes the standard Cartesian grid and bends it into a new — in general skewed and stretched — grid. The new axes are nothing more than the images of the old axes under .
To see what those new axes look like, apply to the -th standard basis vector . By a basic identity of matrix algebra, multiplying by simply selects the -th column of :
So the columns of are the new axis directions — the basis vectors of the new coordinate system. Concretely, with , the old -axis direction is sent to — column 1 of — and the old -axis direction is sent to — column 2 of . Those two columns are the new basis: the -axis stretched by a factor of 2, and the -axis tilted into a diagonal.
Because is itself linear, its local linear approximation is the global map: for every , and the Jacobian determinant collapses to the single number — the volume-scaling factor of the transformation, uniform across the whole space rather than point-by-point. Nonlinear coordinate transformations are precisely those for which varies from point to point, which is why in the general case the Jacobian has to be re-evaluated at every .
Common Coordinate Systems
Besides the usual Cartesian coordinates introduced above, three coordinate systems are useful enough to be worth knowing by heart:
- the polar coordinates in 2D, parameterizing the plane by distance from the origin and an angle,
- the cylindrical coordinates in 3D, extending the polar idea by an extra height axis,
- the spherical coordinates in 3D, parameterizing space by distance from the origin and two angles.
Each is treated in its own section.
Polar Coordinates
The most familiar non-Cartesian system in 2D is the polar coordinate system. Instead of pinning a point down by its perpendicular distances along the - and -axes, polar coordinates use just two intuitive numbers: how far the point is from the origin, and which direction it lies in. The “how far” is the radius , and the “which direction” is the angle measured counterclockwise from the positive -axis.
The conversion to Cartesian coordinates is right-triangle trigonometry: a point at distance along an angle has horizontal component and vertical component . Packaging this as a coordinate transformation:
The polar coordinate transformation is the map
with corresponding coordinate transformation matrix and Jacobian determinant
The pair are called the polar coordinates of the point .
The domain of excludes — the origin has no well-defined angle, so it can’t be assigned polar coordinates uniquely — and pins to one full revolution to avoid wrapping the same point with infinitely many angles. Together these restrictions make a bijection onto , as required by the definition of a coordinate transformation.
Compute the Jacobian matrix and determinant
The coordinate transformation matrix is the matrix of partial derivatives of the components given and with respect to the inputs and . Computing each entry directly inside the matrix:
The determinant of a matrix expands as , giving:
using the Pythagorean identity in the last step.
Geometric meaning of
The Jacobian determinant being has a clean geometric meaning. Recall that for any coordinate transformation, the Jacobian determinant measures its local area-scaling factor — the ratio between the area of a tiny patch in the input space and the area of its image in the output space. So there are two patches and two areas to compare: one in the input plane, one in the output plane, both connected by .
The polar transformation has two distinct 2D planes involved. The input plane is the -plane — a regular Cartesian-looking plane with on one axis and on the other. The output plane is the actual -plane that we live in.
Pick a small rectangle in the input plane anchored at with sides and . Its area, computed the usual way for a rectangle, is
Now apply and see where this rectangle lands on the output plane. The image is a tiny “donut slice” anchored at radius , with two side lengths:
- in the radial direction — just the change in radius;
- in the angular direction — because an angle of on a circle of radius traces an arc of length (arc length radius angle).
So the donut slice has area
The area-scaling factor of — i.e. the Jacobian determinant — is now just the ratio of the two:
which matches the algebra exactly. The factor vanishes only at , where the donut slice collapses to a point — the one place we had to exclude from the domain.
Cylindrical Coordinates
Cylindrical coordinates extend the polar idea to 3D in the simplest way imaginable: keep polar coordinates for the horizontal plane and bolt on an unchanged height axis. A point in space is described by where it lies in the -plane — the radius and angle from polar coordinates — together with how high above (or below) that plane it sits, which is just the ordinary Cartesian . In that sense the system is more like 2.5D than full 3D: only two of the three coordinates do nontrivial work, and the third rides along untouched.
The conversion to Cartesian coordinates inherits the polar formulas for and , with passing through unchanged:
The cylindrical coordinate transformation is the map
with corresponding coordinate transformation matrix and Jacobian determinant
The triple are called the cylindrical coordinates of the point .
The domain excludes the entire -axis (the line) for the same reason polar coordinates exclude the origin: along this axis the angle is undefined, so the assignment would not be a bijection. The angle is again pinned to one full revolution to avoid wrapping the same point with infinitely many addresses.
Compute the Jacobian matrix and determinant
Each entry of the Jacobian is a partial derivative of one of the three component functions , , with respect to one of the three inputs , , . Computing each entry directly inside the matrix:
The third column and third row are mostly zero because is independent of and , and are independent of . Expanding the determinant along the bottom row picks out only the entry:
so the Jacobian determinant collapses to the polar result — as expected, since the -direction is left untouched and contributes a factor of .
Geometric meaning of
The Jacobian determinant being — the same as for polar coordinates — has the same geometric meaning. The transformation rescales infinitesimal volumes by a factor of : a tiny box in the input maps to a tiny “wedge” of volume in the output, since the height direction is untouched and the slice scales by exactly as in the polar case.
Spherical Coordinates
Spherical coordinates are the natural system for identifying a point inside a ball: instead of describing a point by perpendicular distances, describe it by how far out and which direction. The “how far out” is again a single radius — the distance from the origin, which is the same kind of radius as in polar/cylindrical coordinates. The “which direction” now needs two angles, because directions in 3D form a 2D sphere of possibilities (a single angle could only sweep out a circle). The two angles play complementary roles:
- — the azimuthal angle, just as in polar and cylindrical coordinates: how far around the -axis we have rotated, measured in the -plane from the positive -axis;
- — the polar angle, measured from the positive -axis down toward the point: points to the north pole, lies on the equator, points to the south pole.
Converting to Cartesian coordinates is two nested right-triangle trigonometry steps. First, drop the radius along the polar angle : this gives a height and a horizontal projection of length . Then sweep that horizontal projection through the azimuth as in polar coordinates, producing and .
The spherical coordinate transformation is the map
with corresponding coordinate transformation matrix and Jacobian determinant
The triple are called the spherical coordinates of the point .
The domain again excludes the -axis. There two things go wrong simultaneously: (the origin) has no well-defined direction, and (the north and south poles, sitting on the -axis) has no well-defined azimuth — every value of produces the same point. Removing the -axis from the codomain rules out both failures at once and leaves a bijection. The azimuth is pinned to as before, and the polar angle to the open interval .
Compute the Jacobian matrix and determinant
Filling in the matrix from the same partial-derivative recipe as the polar and cylindrical cases — just with more chain-rule trig per entry:
For the determinant, expand along the bottom row — the middle entry is zero, so only two cofactors contribute:
Each determinant simplifies using :
Putting these back:
Geometric meaning of
The Jacobian determinant scales infinitesimal volumes by . Two factors compose to produce this: the comes from the radial direction stretching a fixed angular wedge into a patch whose area grows quadratically with (a small angular cone subtends a much larger surface area on a big sphere than on a small one); the comes from circles of constant being smaller near the poles than at the equator — at the north pole () and south pole () such circles collapse to a point, which is exactly where the determinant vanishes and the coordinates fail to be a bijection. The negative sign reflects an orientation flip in the chosen ordering and is irrelevant to the absolute volume scaling.