Keyboard shortcuts

Press or to navigate between chapters

Press S or / to search in the book

Press ? to show this help

Press Esc to hide this help

Multivariable Differentiation

The heart of the multivariable foundations (analysis spine). The right notion of derivative in several variables is not the collection of partial derivatives but the total (Fréchet) derivative — the best linear approximation, encoded by the Jacobian matrix. Getting this right makes the chain rule a statement about matrix multiplication and sets up the tangent-space picture that manifolds (topology-manifolds.md §3) take for granted.

References: Rudin, Principles of Mathematical Analysis, ch. 9; Spivak, Calculus on Manifolds, ch. 2.

1. Partial and Directional Derivatives

For , open, the partial derivative in the -th coordinate is

and more generally the directional derivative along a unit vector is . Warning: existence of all partials (even all directional derivatives) does not imply continuity. The function (with ) has both partials at the origin yet is discontinuous there. Partials alone are too weak; we need the total derivative.

2. The Total (Fréchet) Derivative

A map is (totally) differentiable at if there is a linear map with

is the derivative (or differential) of at — the unique best linear approximation, exactly the multivariable form of the one-variable statement (differentiation.md §1). Differentiability at implies continuity at .

2.1 The Jacobian matrix

In standard coordinates is represented by the Jacobian matrix of partial derivatives,

If is differentiable then all partials exist and is this matrix; the converse needs a regularity hypothesis:

Sufficient condition ( differentiable). If all partial derivatives exist and are continuous on , then is differentiable on (such is called continuously differentiable, ).

So in practice "the partials are continuous" is the checkable certificate of differentiability.

2.2 Gradient

For scalar , is a row vector; its transpose is the gradient

The gradient points in the direction of steepest ascent and is orthogonal to level sets — the geometric facts behind Lagrange multipliers and the vector-calculus operator (vector-calculus.md §2).

3. The Chain Rule

Chain Rule. If is differentiable at and is differentiable at , then is differentiable at and i.e. the Jacobian of a composite is the product of Jacobian matrices.

Proof idea. Compose the two best-linear-approximations; the cross error terms are because is bounded (a linear map on is Lipschitz).

This is the cleanest justification for the linear-algebra packaging of the derivative: the messy multivariable chain rule is just the entry of a matrix product.

4. Higher Derivatives and the Symmetry of Mixed Partials

Second partials assemble into the Hessian matrix .

Clairaut–Schwarz Theorem. If the second partials of are continuous on (i.e. ), then mixed partials commute:

Hence the Hessian is symmetric. This symmetry is exactly the algebraic fact in disguise — it is what makes the exterior derivative well-defined and what gives and (differential-forms.md §4).

5. Taylor's Theorem in Several Variables

For near ,

in multi-index notation. The second-order expansion

drives the second-derivative test: at a critical point (), a positive-definite Hessian gives a local min, negative-definite a local max, indefinite a saddle. This is the one-variable Taylor theorem (differentiation.md §6) propagated along rays.

6. The Mean Value Inequality

The exact one-variable MVT () has no vector-valued analogue (there may be no single for all components). The usable replacement is an inequality:

Mean Value Inequality. If is and the segment , then .

This bound — a derivative controlling an increment — is what powers the convergence estimates in the contraction-mapping proof of the inverse function theorem (inverse-implicit.md).

7. Connection to Tangent Spaces

The derivative-as-linear-map is the flat model of the manifold notion of differential. For a smooth map between manifolds, the pushforward is, in charts, precisely the Jacobian of this page (topology-manifolds.md §3). Everything here is the local coordinate computation that the intrinsic manifold language packages coordinate-free.

8. Where this page is used


Next: Inverse and Implicit Function Theorems.