The Jacobian Matrix

⚡ Key Takeaways

The Jacobian matrix of a differentiable map $\mathbf{f}:\mathbb{R}^n\to\mathbb{R}^m$ is the $m\times n$ matrix of all first-order partial derivatives. It is the best linear approximation of $\mathbf{f}$ near a point — the multivariable generalization of the derivative. When $m=n$ , its determinant (the Jacobian determinant) measures how the map scales volume locally and governs the change of variables in multiple integrals. Introduced systematically by Carl Gustav Jacob Jacobi in 1841.

💡 The Core Insight

Differentiation in one variable replaces a curve by its tangent line near a point. In several variables, the Jacobian matrix replaces a (possibly curved) map between spaces by a linear map — the tangent map. Everything hard about the nonlinear function is locally tamed into matrix algebra: composition becomes matrix multiplication, invertibility becomes nonzero determinant, and local volume distortion becomes $|\det J|$ .

DefinitionJacobian Matrix

Let $\mathbf f:\Omega\subseteq\mathbb R^n\to\mathbb R^m$ with component functions $\mathbf f=(f_1,\dots,f_m)$ , and let $\mathbf a\in\Omega$ be an interior point where all first partial derivatives exist. The Jacobian matrix of $\mathbf f$ at $\mathbf a$ is

1

\quad J_{\mathbf f}(\mathbf a)=\frac{\partial(f_1,\dots,f_m)}{\partial(x_1,\dots,x_n)}=\begin{pmatrix}\dfrac{\partial f_1}{\partial x_1}&\cdots&\dfrac{\partial f_1}{\partial x_n}\\[1.2ex]\vdots&\ddots&\vdots\\[0.6ex]\dfrac{\partial f_m}{\partial x_1}&\cdots&\dfrac{\partial f_m}{\partial x_n}\end{pmatrix}\bigg|_{\mathbf a}.

Derivation hint: row $i$ is the gradient $\nabla f_i$ of the $i$ -th component; entry $(i,j)$ is $\partial f_i/\partial x_j$ evaluated at $\mathbf a$ . Here $f_i:\Omega\to\mathbb R$ are scalar components, $x_j$ are the input coordinates, $\Omega$ is an open domain, and $\mathbf a=(a_1,\dots,a_n)$ . The entry in row $i$ , column $j$ is $(J_{\mathbf f})_{ij}=\partial f_i/\partial x_j$ .

DefinitionJacobian Determinant

When $m=n$ , $J_{\mathbf f}(\mathbf a)$ is square and its determinant is the Jacobian determinant:

2

\quad \det J_{\mathbf f}(\mathbf a)=\det\!\left[\frac{\partial f_i}{\partial x_j}(\mathbf a)\right]_{i,j=1}^{n}.

Derivation hint: ordinary determinant of the square matrix [1]; expand by cofactors or use the Leibniz permutation sum. It is often written $\dfrac{\partial(f_1,\dots,f_n)}{\partial(x_1,\dots,x_n)}$ and represents the signed local volume-scaling factor of $\mathbf f$ .

TheoremTotal Derivative and Differentiability

If $\mathbf f$ is differentiable at $\mathbf a$ , then there is a unique linear map $D\mathbf f(\mathbf a):\mathbb R^n\to\mathbb R^m$ such that

3

\quad \lim_{\mathbf h\to\mathbf 0}\frac{\|\mathbf f(\mathbf a+\mathbf h)-\mathbf f(\mathbf a)-D\mathbf f(\mathbf a)\,\mathbf h\|}{\|\mathbf h\|}=0,

Derivation hint: this is the definition of total differentiability — the remainder vanishes faster than first order in $\|\mathbf h\|$ . and the matrix representing $D\mathbf f(\mathbf a)$ in the standard bases is exactly $J_{\mathbf f}(\mathbf a)$ . A sufficient condition: if all partials $\partial f_i/\partial x_j$ exist and are continuous on a neighborhood of $\mathbf a$ (i.e. $\mathbf f\in C^1$ ), then $\mathbf f$ is differentiable there.

TheoremMultivariable Chain Rule

If $\mathbf g:\mathbb R^n\to\mathbb R^p$ is differentiable at $\mathbf a$ and $\mathbf f:\mathbb R^p\to\mathbb R^m$ is differentiable at $\mathbf g(\mathbf a)$ , then $\mathbf f\circ\mathbf g$ is differentiable at $\mathbf a$ and

4

\quad J_{\mathbf f\circ\mathbf g}(\mathbf a)=J_{\mathbf f}\big(\mathbf g(\mathbf a)\big)\,J_{\mathbf g}(\mathbf a).

Derivation hint: composition of linear approximations corresponds to multiplication of their matrices; verify dimensions $(m\times p)(p\times n)=(m\times n)$ .

ProofThe Jacobian represents the total derivative

Step 1 — Linear approximation from differentiability. Suppose $\mathbf f$ is differentiable at $\mathbf a$ with linear map $L=D\mathbf f(\mathbf a)$ , so equation [3] holds. We determine the matrix of $L$ .

Step 2 — Probe along coordinate directions. Take $\mathbf h=t\,\mathbf e_j$ , where $\mathbf e_j$ is the $j$ -th standard basis vector and $t\to 0$ . Dividing the numerator of [3] component-wise and using $L(t\mathbf e_j)=tL(\mathbf e_j)$ :

5

\quad \lim_{t\to0}\frac{f_i(\mathbf a+t\mathbf e_j)-f_i(\mathbf a)-t\,(L\mathbf e_j)_i}{t}=0.

Derivation hint: restrict [3] to the line $\mathbf a+t\mathbf e_j$ ; the $i$ -th component of the vanishing quotient must itself vanish.

Step 3 — Identify the entries. Rearranging [5] gives

6

\quad (L\mathbf e_j)_i=\lim_{t\to0}\frac{f_i(\mathbf a+t\mathbf e_j)-f_i(\mathbf a)}{t}=\frac{\partial f_i}{\partial x_j}(\mathbf a).

Derivation hint: the displayed limit is precisely the definition of the partial derivative of $f_i$ with respect to $x_j$ .

Step 4 — Assemble the matrix. The $j$ -th column of $L$ is $L\mathbf e_j$ , whose $i$ -th entry is $\partial f_i/\partial x_j$ . Hence the matrix of $L$ is exactly $J_{\mathbf f}(\mathbf a)$ from [1]. $\blacksquare$

Step 5 — Chain rule via composition. For [4], if $\mathbf u=\mathbf g(\mathbf a+\mathbf h)-\mathbf g(\mathbf a)\approx J_{\mathbf g}(\mathbf a)\mathbf h$ , then

7

\quad \mathbf f(\mathbf g(\mathbf a+\mathbf h))-\mathbf f(\mathbf g(\mathbf a))\approx J_{\mathbf f}(\mathbf g(\mathbf a))\,\mathbf u\approx J_{\mathbf f}(\mathbf g(\mathbf a))\,J_{\mathbf g}(\mathbf a)\,\mathbf h.

Derivation hint: substitute the linear approximation of $\mathbf g$ into that of $\mathbf f$ ; the error terms are controlled by the differentiability limits and vanish faster than $\|\mathbf h\|$ .

∎

mathematician · Carl Gustav Jacob Jacobi | 1804–1851

A German mathematician at Königsberg and Berlin, Jacobi was a master of determinants and elliptic functions. In his 1841 memoir De determinantibus functionalibus he developed the theory of functional determinants — what we now call Jacobians — proving their multiplicative behavior under composition and their role in the transformation of multiple integrals and the dependence/independence of functions. His name also marks the Jacobi identity, Jacobian elliptic functions, and the Hamilton–Jacobi equation. The functional determinant was a key technical engine of 19th-century analysis and mechanics.

🧠 Intuition

Picture the map $\mathbf f$ as deforming space. Near a point $\mathbf a$ , no matter how curved $\mathbf f$ is globally, it looks like a single linear transformation — a combination of stretching, rotating, shearing, and reflecting. That linear transformation is the Jacobian matrix.

A row $\nabla f_i$ tells you how output component $f_i$ responds to small moves in any input direction.
A column tells you the velocity of the output when you push input variable $x_j$ alone.
The determinant measures how an infinitesimal box of unit volume around $\mathbf a$ gets resized: $|\det J|>1$ expands volume, $<1$ shrinks it, $=0$ collapses it onto a lower-dimensional set, and the sign flips when orientation reverses.

When $m=n=1$ , the Jacobian "matrix" is the $1\times1$ matrix $[f'(x)]$ and the determinant is just $f'(x)$ — the familiar derivative. The whole apparatus is the natural upgrade of $f'$ to many dimensions.

Figure

Local action of a map and its Jacobian: a small grid square at

\mathbf a

maps to a sheared parallelogram whose area is

|\det J|

times the original.

ExamplePolar coordinates: Jacobian determinant

Given. The change of variables $\mathbf f(r,\theta)=(x,y)$ with

8

\quad x=r\cos\theta,\qquad y=r\sin\theta.

Derivation hint: standard polar-to-Cartesian transformation; treat $r,\theta$ as inputs.

Step 1 — Compute partials.

\frac{\partial x}{\partial r}=\cos\theta,\quad \frac{\partial x}{\partial\theta}=-r\sin\theta,\quad \frac{\partial y}{\partial r}=\sin\theta,\quad \frac{\partial y}{\partial\theta}=r\cos\theta.

Step 2 — Form the Jacobian matrix.

9

\quad J=\begin{pmatrix}\cos\theta&-r\sin\theta\\[0.4ex]\sin\theta&r\cos\theta\end{pmatrix}.

Derivation hint: place $\partial(x,y)$ as rows over $\partial(r,\theta)$ as columns, per [1].

Step 3 — Determinant.

10

\quad \det J=\cos\theta(r\cos\theta)-(-r\sin\theta)\sin\theta=r(\cos^2\theta+\sin^2\theta)=r.

Derivation hint: $2\times2$ determinant $ad-bc$ , then apply the Pythagorean identity.

Answer. $\boxed{\det J = r}$ (dimensionless scaling factor per unit input area). Hence the area element transforms as $dx\,dy = r\,dr\,d\theta$ . Evaluating at $r=2,\theta=\pi/4$ : a tiny region near that point is magnified in area by a factor of $2$ .

ExampleLinearizing a nonlinear system at a fixed point

Given. The planar vector field

11

\quad \mathbf f(x,y)=\big(\,x - x^3 - xy,\; 2y - y^2\,\big),

Derivation hint: a competition-type dynamical system; we want $J$ at an equilibrium. with equilibrium (fixed point) at $\mathbf a=(0,0)$ since $\mathbf f(0,0)=(0,0)$ .

Step 1 — Partial derivatives. With $f_1=x-x^3-xy$ , $f_2=2y-y^2$ :

\frac{\partial f_1}{\partial x}=1-3x^2-y,\quad \frac{\partial f_1}{\partial y}=-x,\quad \frac{\partial f_2}{\partial x}=0,\quad \frac{\partial f_2}{\partial y}=2-2y.

Step 2 — Jacobian at the origin. Substitute $x=0,y=0$ :

12

\quad J_{\mathbf f}(0,0)=\begin{pmatrix}1&0\\0&2\end{pmatrix}.

Derivation hint: evaluate each partial at $(0,0)$ ; the nonlinear terms drop out at the origin.

Step 3 — Stability read-off. Eigenvalues are $\lambda_1=1,\ \lambda_2=2$ , both positive.

Answer. $\boxed{J_{\mathbf f}(0,0)=\operatorname{diag}(1,2),\ \lambda=1,2>0}$ — the origin is an unstable node (a source) for the linearized flow. The determinant $\det J=2\neq 0$ , so the linearization is nondegenerate and (by the Hartman–Grobman theorem) faithfully describes the local phase portrait.

⚠️ Common mistake

Existence of all partial derivatives does NOT imply differentiability. The Jacobian matrix in [1] can be fully written down using only partials, yet the linear-approximation limit [3] may fail. Differentiability is the strictly stronger property. The safe sufficient condition is $C^1$ (continuous partials). Also beware:

The Jacobian determinant exists only for square maps ( $m=n$ ); the Jacobian matrix exists for any $m,n$ .
$\det J=0$ at a point does not mean the map is non-invertible globally — it means the linearization is singular there (a critical point).
Order matters: rows index outputs, columns index inputs. Transposing scrambles the chain rule.

CounterexamplePartials exist but the map is not differentiable

Consider $f:\mathbb R^2\to\mathbb R$ ,

13

\quad f(x,y)=\begin{cases}\dfrac{xy}{x^2+y^2}&(x,y)\neq(0,0)\\[1ex]0&(x,y)=(0,0).\end{cases}

Derivation hint: a classic homogeneous-degree-zero function; test continuity and differentiability separately. Both partials at the origin exist and equal $0$ (since $f$ is identically $0$ along each axis), so the "Jacobian" $J_f(0,0)=(0\ \ 0)$ is defined. But along the line $y=x$ , $f(x,x)=\tfrac12$ for all $x\neq0$ , so $f$ is not even continuous at the origin — hence not differentiable. The Jacobian matrix exists but fails to be the total derivative. This shows why $C^1$ (or direct verification of [3]) is required.

connection

The Jacobian sits at the crossroads of analysis and linear algebra:

It generalizes the Derivative of single-variable calculus to maps between Euclidean spaces.
Its rows are Gradient vectors; for a scalar field ( $m=1$ ) the Jacobian is the transposed gradient.
The determinant invokes Determinant theory; its eigenvalues connect to Eigenvalues and Eigenvectors for stability analysis.
It is the protagonist of the Inverse Function Theorem (nonzero Jacobian determinant ⇒ local invertibility) and the Implicit Function Theorem.
In integration it powers the Change of Variables Theorem via $|\det J|$ .
Its matrix product structure is the multivariable Chain Rule.
For maps on manifolds it becomes the differential / pushforward in Differential Geometry.

🔬 Where this appears

⏳ History

- 1750 (Cramer). Determinants emerge from solving linear systems (Cramer's rule), seeding the algebra later applied to Jacobians.

- 1773–1812 (Lagrange, Cauchy). Functional determinants appear implicitly in coordinate-transformation formulas for integrals and in mechanics.

- 1815 (Cauchy). Establishes systematic determinant theory, including multiplicativity

\det(AB)=\det A\det B

— the key to the chain rule for Jacobians.

- 1833 (Jacobi, early work). Begins studying determinants of partial-derivative arrays in problems of variable transformation.

- 1841 (Jacobi). Publishes De determinantibus functionalibus, the foundational treatise defining functional determinants, their composition rule, and their use in detecting functional dependence and transforming integrals.

- 1870s–1900s. The terms "Jacobian matrix" and "Jacobian determinant" become standard in textbooks; the inverse and implicit function theorems are rigorously stated.

- 1930s–40s. Fréchet and the abstract calculus formalize the total derivative as a linear map, clarifying the Jacobian as its matrix representation in finite dimensions.

- 1960s onward. Differential topology (Milnor, Smale) and numerical analysis embed the Jacobian in manifold theory and computational algorithms (Newton–Raphson, automatic differentiation).

open-problem

Boundaries and frontiers around the Jacobian.

Critical sets and rank. Where $\det J=0$ (the critical points), the map degenerates. Understanding the structure of images of critical sets is the subject of Sard's Theorem and singularity theory (Whitney, Thom) — fully classifying singularities of smooth maps remains a deep, active area.
Global vs local invertibility. A nonvanishing Jacobian determinant guarantees only local invertibility. The Jacobian Conjecture (Keller, 1939) asks whether a polynomial map $\mathbb C^n\to\mathbb C^n$ with constant nonzero Jacobian determinant is globally invertible with polynomial inverse — still unproven for $n\ge 2$ .
Beyond finite dimensions. In infinite-dimensional spaces the matrix picture dissolves; one uses the Fréchet derivative, where no determinant exists and change-of-variables theory requires entirely different machinery (Gaussian measures, Cameron–Martin).
Numerical conditioning. Near-singular Jacobians make Newton's method and inverse-kinematics solvers ill-conditioned; robust handling of such degeneracies is an ongoing engineering concern.

Formal Statement

Why It Holds / Derivation

Building Intuition

Worked Examples

Common Misconceptions

Connections

Real-World Applications

Historical Development

Subtleties & Limits

See Also