Skip to content
Date: Oct 2, 2026
Builds on Chapter 2.

A robot arm has two rigid links, each of length \(1\) , joined at an elbow. The shoulder is fixed at the origin. Motors set two angles: \(\theta_1\) , the angle of the first link above the \(x\) -axis, and \(\theta_2\) , the angle by which the second link is bent from the direction of the first. The hand is then at

\[ F(\theta_1,\theta_2)=\bigl(\cos\theta_1+\cos(\theta_1+\theta_2),\ \sin\theta_1+\sin(\theta_1+\theta_2)\bigr). \]

An engineer wants to know two things. If both motors are slightly off, where does the hand end up? And is there a posture in which some small movements of the hand cannot be produced by any small movement of the motors?

Both questions are about a function with two inputs and two outputs. Its derivative cannot be a single number or even a single vector. This chapter shows that it is a matrix, or better, the linear map that the matrix represents. Once the derivative is understood as a linear map, the chain rule becomes the statement that the derivative of a composition is the composition of the derivatives, and every coordinate formula of the subject follows by multiplying matrices.

3.1 The derivative of a map is a linear map

Definition 2.3 called a real-valued function differentiable when a linear function of the displacement predicts its change with relatively small error. Nothing in that sentence requires the values to be numbers.

Definition 3.1 (differentiable map, derivative matrix). Let \(F:D\to\mathbb R^m\) with \(D\subseteq\mathbb R^n\) , and let \(\mathbf a\) be an interior point of \(D\) . The map \(F\) is differentiable at \(\mathbf a\) if there is an \(m\times n\) matrix \(A\) such that

\[ \lim_{\mathbf h\to\mathbf 0}\frac{\lVert F(\mathbf a+\mathbf h)-F(\mathbf a)-A\mathbf h\rVert}{\lVert\mathbf h\rVert}=0 . \]

The matrix \(A\) is the derivative, or Jacobian matrix, of \(F\) at \(\mathbf a\) , written \(DF(\mathbf a)\) .

The matrix acts on displacements: it takes a small change \(\mathbf h\in\mathbb R^n\) of the input and returns the predicted change \(A\mathbf h\in\mathbb R^m\) of the output. A matrix used in this way is a linear map in the sense of linear algebra (math.linear-algebra.matrix-as-map), and it is the map, more than the array of numbers, that deserves the name derivative. Its shape is forced: \(n\) columns because the input has \(n\) coordinates, \(m\) rows because the output has \(m\) .

Proposition 3.2 (the derivative is assembled from gradients). A map \(F=(F_1,\dots,F_m)\) is differentiable at \(\mathbf a\) if and only if each component function \(F_i\) is differentiable at \(\mathbf a\) in the sense of Definition 2.3. In that case row \(i\) of \(DF(\mathbf a)\) is \(\nabla F_i(\mathbf a)\) , so that

\[ DF(\mathbf a)=\begin{pmatrix}\dfrac{\partial F_1}{\partial x_1}&\cdots&\dfrac{\partial F_1}{\partial x_n}\\ \vdots&&\vdots\\ \dfrac{\partial F_m}{\partial x_1}&\cdots&\dfrac{\partial F_m}{\partial x_n}\end{pmatrix} \]

with every entry evaluated at \(\mathbf a\) . In particular the derivative matrix is unique.

Proof. Let \(\mathbf w(\mathbf h)=F(\mathbf a+\mathbf h)-F(\mathbf a)-A\mathbf h\) , a vector in \(\mathbb R^m\) whose \(i\) -th coordinate is \(w_i=F_i(\mathbf a+\mathbf h)-F_i(\mathbf a)-\mathbf A_i\cdot\mathbf h\) , where \(\mathbf A_i\) is row \(i\) of \(A\) . For any vector, \(\lvert w_i\rvert\le\lVert\mathbf w\rVert\le\lvert w_1\rvert+\dots+\lvert w_m\rvert\) . Dividing by \(\lVert\mathbf h\rVert\) , the quotient \(\lVert\mathbf w\rVert/\lVert\mathbf h\rVert\) tends to \(0\) exactly when every \(\lvert w_i\rvert/\lVert\mathbf h\rVert\) does. The latter is Definition 2.3 for \(F_i\) with vector \(\mathbf A_i\) , and Proposition 2.4 identifies that vector as \(\nabla F_i(\mathbf a)\) .

Together with Theorem 2.6 the proposition gives a practical test: if all the partial derivatives \(\partial F_i/\partial x_j\) are continuous on an open set, then \(F\) is differentiable there and its derivative is the matrix of those partial derivatives. Three special cases are worth naming. When \(m=1\) the matrix is a single row, the gradient written horizontally. When \(n=1\) it is a single column, the velocity vector of Chapter 1. And when \(F(\mathbf x)=M\mathbf x\) is itself linear, the error in Definition 3.1 is identically zero with \(A=M\) , so a linear map is its own derivative at every point.

Example 3.1: How the robot’s hand responds to its motors

For the arm of the opening paragraph, differentiate each coordinate of \(F\) with respect to each angle:

\[ DF(\theta_1,\theta_2)=\begin{pmatrix}-\sin\theta_1-\sin(\theta_1+\theta_2)&-\sin(\theta_1+\theta_2)\\ \cos\theta_1+\cos(\theta_1+\theta_2)&\cos(\theta_1+\theta_2)\end{pmatrix}. \]

Take the posture \(\theta_1=0\) , \(\theta_2=\pi/2\) : the first link lies along the \(x\) -axis, the second points straight up, and the hand is at \(F(0,\pi/2)=(1,1)\) . There

\[ DF(0,\pi/2)=\begin{pmatrix}-1&-1\\ 1&0\end{pmatrix}. \]

The first column, \((-1,1)\) , is the velocity of the hand per unit rate of the shoulder motor: turning the shoulder swings the whole arm about the origin. The second column, \((-1,0)\) , is the response to the elbow motor: the hand moves left.

Suppose the motors are off by \(\mathbf h=(0.1,-0.05)\) radians. The linear prediction for the displacement of the hand is \(DF\,\mathbf h=(-0.1+0.05,\ 0.1)=(-0.05,0.1)\) , so the hand should be near \((0.95,\,1.10)\) . Direct evaluation of \(F(0.1,\pi/2-0.05)\) gives \((0.9450,\,1.0986)\) to four decimal places. The prediction misses by a distance of about \(0.0052\) , while the step \(\mathbf h\) has length about \(0.112\) : the error is less than a twentieth of the step, and Definition 3.1 says the ratio goes to zero as the step shrinks.

For the engineer’s second question, compute the determinant. Expanding and using the subtraction formula for the sine,

\[ \det DF=\sin\theta_2 . \]

When \(\theta_2=0\) the arm is straight, the determinant vanishes, and

\[ DF(\theta_1,0)=\begin{pmatrix}-2\sin\theta_1&-\sin\theta_1\\ 2\cos\theta_1&\cos\theta_1\end{pmatrix}. \]

Both columns are multiples of \((-\sin\theta_1,\cos\theta_1)\) , the direction perpendicular to the arm. To first order the hand can move only sideways; no small motion of the motors moves it along the arm. That is the posture the engineer was worried about.

Two panels showing a two-link robot arm. In the bent posture the hand positions reached by joint errors on a circle of radius 0.3 form a closed loop that nearly coincides with a dashed ellipse; in the straight posture the loop collapses onto a thin arc beside a dashed straight segment.
Figure 3.1. The derivative sends a small circle of input errors to an ellipse of output errors. Where the determinant is zero the ellipse degenerates to a segment, and the hand loses a direction of motion.

Figure 3.1 shows what the matrix means. In each panel the motors are perturbed by every pair of angle errors on a circle of radius \(0.3\) . The solid curve is where the hand really goes; the dashed curve is the image of the same circle under the linear map \(\mathbf h\mapsto F(\mathbf a)+DF(\mathbf a)\mathbf h\) . A linear map sends a circle to an ellipse. In the bent posture the ellipse has positive area and the true curve follows it closely. In the straight posture the ellipse has collapsed to a segment, and the true curve is a thin sliver that departs from it only at second order.

3.2 The chain rule

If the hand of the robot carries a sensor, and the reading depends on where the hand is, then the reading depends on the motor angles through the position. One map is fed into another. The rule for differentiating such a composition is the central computational theorem of differential calculus, and with derivatives understood as matrices it has the only form it could have.

The proof needs one estimate, which says that a matrix cannot stretch a vector by more than a fixed factor.

Lemma 3.3 (a matrix has bounded stretch). For an \(m\times n\) matrix \(M\) let \(\lVert M\rVert\) denote the square root of the sum of the squares of its entries. Then \(\lVert M\mathbf v\rVert\le\lVert M\rVert\,\lVert\mathbf v\rVert\) for every \(\mathbf v\in\mathbb R^n\) .

Proof. The \(i\) -th coordinate of \(M\mathbf v\) is the dot product of row \(\mathbf M_i\) with \(\mathbf v\) , so by the Cauchy–Schwarz inequality its square is at most \(\lVert\mathbf M_i\rVert^{2}\lVert\mathbf v\rVert^{2}\) . Summing over \(i\) gives \(\lVert M\mathbf v\rVert^{2}\le\bigl(\lVert\mathbf M_1\rVert^{2}+\dots+\lVert\mathbf M_m\rVert^{2}\bigr)\lVert\mathbf v\rVert^{2}=\lVert M\rVert^{2}\lVert\mathbf v\rVert^{2}\) .

Theorem 3.4 (chain rule). Let \(G\) map an open subset of \(\mathbb R^n\) into an open set \(V\subseteq\mathbb R^m\) , and let \(F:V\to\mathbb R^p\) . If \(G\) is differentiable at \(\mathbf a\) and \(F\) is differentiable at \(\mathbf b=G(\mathbf a)\) , then \(F\circ G\) is differentiable at \(\mathbf a\) and

\[ D(F\circ G)(\mathbf a)=DF(G(\mathbf a))\,DG(\mathbf a), \]

the product of a \(p\times m\) matrix with an \(m\times n\) matrix.

Proof. Write \(A=DG(\mathbf a)\) and \(B=DF(\mathbf b)\) . As in the proof of Theorem 2.10, differentiability lets us write, for all small \(\mathbf h\) and \(\mathbf k\) ,

\[ G(\mathbf a+\mathbf h)=\mathbf b+A\mathbf h+\lVert\mathbf h\rVert\,\boldsymbol\varepsilon_1(\mathbf h),\qquad F(\mathbf b+\mathbf k)=F(\mathbf b)+B\mathbf k+\lVert\mathbf k\rVert\,\boldsymbol\varepsilon_2(\mathbf k), \]

where \(\boldsymbol\varepsilon_1(\mathbf h)\to\mathbf 0\) as \(\mathbf h\to\mathbf 0\) , \(\boldsymbol\varepsilon_2(\mathbf k)\to\mathbf 0\) as \(\mathbf k\to\mathbf 0\) , and \(\boldsymbol\varepsilon_2(\mathbf 0)=\mathbf 0\) . Given \(\mathbf h\) , set \(\mathbf k=G(\mathbf a+\mathbf h)-\mathbf b=A\mathbf h+\lVert\mathbf h\rVert\boldsymbol\varepsilon_1(\mathbf h)\) . Substituting,

\[ F(G(\mathbf a+\mathbf h))-F(G(\mathbf a))-BA\mathbf h=\lVert\mathbf h\rVert\,B\boldsymbol\varepsilon_1(\mathbf h)+\lVert\mathbf k\rVert\,\boldsymbol\varepsilon_2(\mathbf k). \]

By Lemma 3.3, \(\lVert B\boldsymbol\varepsilon_1(\mathbf h)\rVert\le\lVert B\rVert\lVert\boldsymbol\varepsilon_1(\mathbf h)\rVert\) and \(\lVert\mathbf k\rVert\le\bigl(\lVert A\rVert+\lVert\boldsymbol\varepsilon_1(\mathbf h)\rVert\bigr)\lVert\mathbf h\rVert\) . Dividing by \(\lVert\mathbf h\rVert\) , the norm of the left side over \(\lVert\mathbf h\rVert\) is at most

\[ \lVert B\rVert\,\lVert\boldsymbol\varepsilon_1(\mathbf h)\rVert+\bigl(\lVert A\rVert+\lVert\boldsymbol\varepsilon_1(\mathbf h)\rVert\bigr)\lVert\boldsymbol\varepsilon_2(\mathbf k)\rVert . \]

As \(\mathbf h\to\mathbf 0\) the first term tends to \(0\) . The bound on \(\lVert\mathbf k\rVert\) shows that \(\mathbf k\to\mathbf 0\) as well, so \(\boldsymbol\varepsilon_2(\mathbf k)\to\mathbf 0\) and the second term tends to \(0\) . This is Definition 3.1 for \(F\circ G\) with matrix \(BA\) .

The proof is the one-variable proof with absolute values replaced by norms and one extra ingredient, Lemma 3.3, to control what a matrix does to an error term. Notice the order of the factors. The matrix of the map applied first stands on the right, next to the vector it acts on, exactly as in \(F(G(\mathbf x))\) . Since matrix multiplication is not commutative the order matters, and the shapes usually enforce it: \(p\times m\) times \(m\times n\) is defined, and the reverse product generally is not.

Example 3.2: Multiplying two derivative matrices

Let \(G(s,t)=(st,\ s+t^{2})\) and \(F(x,y)=(x^{2}+y,\ xy)\) , and compute \(D(F\circ G)\) at \((s,t)=(1,2)\) . First, \(G(1,2)=(2,5)\) . The derivative matrices are

\[ DG(s,t)=\begin{pmatrix}t&s\\ 1&2t\end{pmatrix},\quad DG(1,2)=\begin{pmatrix}2&1\\ 1&4\end{pmatrix},\qquad DF(x,y)=\begin{pmatrix}2x&1\\ y&x\end{pmatrix},\quad DF(2,5)=\begin{pmatrix}4&1\\ 5&2\end{pmatrix}. \]

The outer derivative is evaluated at \(G(1,2)\) , not at \((1,2)\) . By Theorem 3.4,

\[ D(F\circ G)(1,2)=\begin{pmatrix}4&1\\ 5&2\end{pmatrix}\begin{pmatrix}2&1\\ 1&4\end{pmatrix}=\begin{pmatrix}9&8\\12&13\end{pmatrix}. \]

To check, compose first: \(F(G(s,t))=\bigl(s^{2}t^{2}+s+t^{2},\ s^{2}t+st^{3}\bigr)\) . The partial derivatives with respect to \(s\) are \(2st^{2}+1\) and \(2st+t^{3}\) , which at \((1,2)\) are \(9\) and \(12\) ; with respect to \(t\) they are \(2s^{2}t+2t\) and \(s^{2}+3st^{2}\) , which are \(8\) and \(13\) . These are the columns found above.

Multiplying in the wrong order gives \(DG(1,2)\,DF(2,5)=\begin{pmatrix}13&4\\24&9\end{pmatrix}\) , a perfectly well-defined matrix that is the derivative of nothing in this problem. When both maps go from the plane to the plane, the shapes do not protect you; only the order of composition does.

3.3 The chain rule in coordinates

Written out entry by entry, the matrix product in Theorem 3.4 says the following. Suppose \(z\) is a differentiable function of \(x_1,\dots,x_m\) and each \(x_k\) is a differentiable function of \(s_1,\dots,s_n\) . Then

\[ \frac{\partial z}{\partial s_j}=\sum_{k=1}^{m}\frac{\partial z}{\partial x_k}\,\frac{\partial x_k}{\partial s_j}. \]

In words: to find how \(z\) responds to \(s_j\) , follow every route from \(s_j\) to \(z\) through an intermediate variable, multiply the rates along each route, and add the routes. Theorem 2.10 was the case of a single independent variable. Many people draw the dependencies as a tree, with \(z\) at the top, the intermediate variables below it, and the independent variables at the bottom, and read the sum off the branches.

Example 3.3: A function seen in polar coordinates

Let \(z=f(x,y)\) with \(x=r\cos\theta\) and \(y=r\sin\theta\) . The coordinate form of the chain rule gives

\[ z_r=f_x\cos\theta+f_y\sin\theta,\qquad z_\theta=-f_x\,r\sin\theta+f_y\,r\cos\theta . \]

Take \(f(x,y)=x^{2}-y^{2}\) , so \(f_x=2x=2r\cos\theta\) and \(f_y=-2y=-2r\sin\theta\) . Then

\[ z_r=2r\cos^{2}\theta-2r\sin^{2}\theta,\qquad z_\theta=-2r^{2}\cos\theta\sin\theta-2r^{2}\sin\theta\cos\theta , \]

that is, \(z_r=2r\cos2\theta\) and \(z_\theta=-2r^{2}\sin2\theta\) . Substituting first gives \(z=r^{2}\cos^{2}\theta-r^{2}\sin^{2}\theta=r^{2}\cos2\theta\) , whose partial derivatives are the same two expressions.

The general formulas also reveal how the length of the gradient looks in polar coordinates. Squaring and adding,

\[ z_r^{2}+\frac{z_\theta^{2}}{r^{2}}=(f_x\cos\theta+f_y\sin\theta)^{2}+(-f_x\sin\theta+f_y\cos\theta)^{2}=f_x^{2}+f_y^{2}, \]

because the cross terms cancel. For our function both sides equal \(4r^{2}\) . The factor \(1/r^{2}\) is not an accident: \(\theta\) is an angle, and a change \(\Delta\theta\) moves a point a distance \(r\,\Delta\theta\) , so \(z_\theta/r\) is the rate of change per unit distance in the angular direction.

Common mistake. Treating a partial derivative as a fraction that can be inverted. From \(x=r\cos\theta\) one has \(\partial x/\partial r=\cos\theta\) , and it is tempting to conclude that \(\partial r/\partial x=1/\cos\theta\) . But \(r=\sqrt{x^{2}+y^{2}}\) gives \(\partial r/\partial x=x/r=\cos\theta\) : the two partial derivatives are equal, not reciprocal. The symbol \(\partial x/\partial r\) means “vary \(r\) with \(\theta\) fixed”, while \(\partial r/\partial x\) means “vary \(x\) with \(y\) fixed”. They are derivatives along different curves, and a partial derivative is meaningless until one says which variables are held constant. The true reciprocal relation is between matrices, as the next example shows.

Example 3.4: Inverting the polar coordinate map

Let \(T(r,\theta)=(r\cos\theta,r\sin\theta)\) with \(r>0\) . Its derivative is

\[ DT(r,\theta)=\begin{pmatrix}\cos\theta&-r\sin\theta\\ \sin\theta&r\cos\theta\end{pmatrix},\qquad\det DT=r\cos^{2}\theta+r\sin^{2}\theta=r . \]

Suppose a differentiable inverse \(T^{-1}(x,y)=(r,\theta)\) exists near some point. Then \(T^{-1}\circ T\) is the identity map, whose derivative is the identity matrix, and Theorem 3.4 gives \(D(T^{-1})\,DT=I\) . So the derivative of the inverse map is the inverse matrix:

\[ D(T^{-1})=\bigl(DT\bigr)^{-1}=\frac1r\begin{pmatrix}r\cos\theta&r\sin\theta\\ -\sin\theta&\cos\theta\end{pmatrix}=\begin{pmatrix}\cos\theta&\sin\theta\\ -\dfrac{\sin\theta}{r}&\dfrac{\cos\theta}{r}\end{pmatrix}. \]

The entries of \(D(T^{-1})\) are by definition the partial derivatives of \(r\) and \(\theta\) with respect to \(x\) and \(y\) . Reading them off,

\[ \frac{\partial r}{\partial x}=\cos\theta,\qquad\frac{\partial r}{\partial y}=\sin\theta,\qquad\frac{\partial\theta}{\partial x}=-\frac{\sin\theta}{r},\qquad\frac{\partial\theta}{\partial y}=\frac{\cos\theta}{r}. \]

The first agrees with the direct computation in the Common mistake above, and the last two agree with differentiating \(\theta=\arctan(y/x)\) , which gives \(-y/(x^{2}+y^{2})\) and \(x/(x^{2}+y^{2})\) . All four came from inverting one matrix, with no need to solve for \(r\) and \(\theta\) .

The example assumed that a differentiable inverse exists. The theorem that provides one is among the deepest of the subject.

Theorem 3.5 (inverse function theorem). Let \(F\) be a \(C^1\) map from an open subset of \(\mathbb R^n\) to \(\mathbb R^n\) , and suppose \(\det DF(\mathbf a)\ne 0\) . Then there is an open set \(U\) containing \(\mathbf a\) such that \(F\) is one-to-one on \(U\) , the image \(F(U)\) is open, and the inverse map \(F^{-1}:F(U)\to U\) is of class \(C^1\) , with \(D(F^{-1})(F(\mathbf x))=DF(\mathbf x)^{-1}\) for \(\mathbf x\in U\) .

The existence of the local inverse is proved in analysis by a fixed-point argument that we do not reproduce; the formula for its derivative is the computation of Example 3.4. Two cautions go with the theorem. It is local: the polar map has \(\det DT=r\ne 0\) everywhere on \(r>0\) , yet \(T(r,\theta)=T(r,\theta+2\pi)\) , so it is not one-to-one on its whole domain. And the hypothesis is sufficient, not necessary: \(x\mapsto x^{3}\) is invertible on the whole line although its derivative vanishes at \(0\) ; what fails there is the differentiability of the inverse. For the robot arm the theorem says that near any bent posture the hand position determines the two angles and the angles depend differentiably on the position. At a straight posture, where \(\det DF=0\) , it promises nothing.

3.4 Curves and surfaces defined implicitly

An equation \(F(x,y)=c\) usually defines a curve, but not as the graph of an explicit function. When can it be solved, at least locally, for \(y\) in terms of \(x\) , and what is the slope of the resulting graph?

Theorem 3.6 (implicit function theorem). Let \(F\) be a \(C^1\) function on an open subset of \(\mathbb R^2\) , let \(F(a,b)=c\) , and suppose \(F_y(a,b)\ne 0\) . Then there are an open interval \(I\) containing \(a\) and a unique \(C^1\) function \(\varphi:I\to\mathbb R\) with \(\varphi(a)=b\) whose graph lies in the level set, \(F(x,\varphi(x))=c\) for all \(x\in I\) ; near \((a,b)\) the level set contains no other points. Its derivative is

\[ \varphi'(x)=-\frac{F_x(x,\varphi(x))}{F_y(x,\varphi(x))}. \]

More generally, if \(F\) is a \(C^1\) function of \((x_1,\dots,x_n,y)\) with \(F=c\) and \(\partial F/\partial y\ne 0\) at a point, then near that point the level set is the graph of a unique \(C^1\) function \(y=\varphi(x_1,\dots,x_n)\) , and \(\partial\varphi/\partial x_i=-F_{x_i}/F_y\) .

As with Theorem 3.5, the existence statement is an analysis theorem, proved from the same fixed-point argument. The formula, once existence is granted, is a one-line application of the chain rule. Differentiate the identity \(F(x,\varphi(x))=c\) with respect to \(x\) using Theorem 2.10 along the curve \(x\mapsto(x,\varphi(x))\) , whose velocity is \((1,\varphi'(x))\) :

\[ F_x\cdot 1+F_y\cdot\varphi'(x)=0 , \]

and solve for \(\varphi'\) . The hypothesis \(F_y\ne 0\) is exactly what the division needs. Geometrically, it says that the gradient \((F_x,F_y)\) is not horizontal, so the level curve, which is perpendicular to the gradient by Corollary 2.11, is not vertical.

Example 3.5: The slope of a curve that is not a graph

The curve \(x^{3}+y^{3}=6xy\) is a loop with two tails. Put \(F(x,y)=x^{3}+y^{3}-6xy\) , so the curve is \(F=0\) . The point \((3,3)\) lies on it, since \(27+27=54\) . There \(F_x=3x^{2}-6y=9\) and \(F_y=3y^{2}-6x=9\) . Because \(F_y\ne 0\) , Theorem 3.6 applies: near \((3,3)\) the curve is a graph \(y=\varphi(x)\) with slope \(\varphi'(3)=-9/9=-1\) . The tangent line is \(y-3=-(x-3)\) , that is, \(x+y=6\) .

Where does the theorem fail to apply? We need points of the curve with \(F_y=0\) , that is, \(x=y^{2}/2\) . Substituting into the equation of the curve gives \(y^{6}/8+y^{3}=3y^{3}\) , so \(y^{3}(y^{3}-16)=0\) . One solution is \(y^{3}=16\) : the point \((2^{5/3},2^{4/3})\approx(3.17,2.52)\) , where \(F_x\ne 0\) . There the tangent line is vertical; the curve cannot be written as \(y=\varphi(x)\) nearby, although by the same theorem with the roles of the variables exchanged it can be written as \(x=\psi(y)\) . The other solution is the origin, where \(F_x\) and \(F_y\) both vanish. Neither form of the theorem applies, and indeed the curve crosses itself there, so near the origin it is not a graph in either direction.

The implicit function theorem will be used twice more. In Chapter 5 it is the engine of the proof of the Lagrange multiplier rule, and in Chapter 8 it explains why a level surface with nonvanishing gradient is a genuine surface that can be parametrized.

3.5 A mean value theorem, and its limits

The Mean Value Theorem of one-variable calculus says that the average rate of change over an interval is attained as an instantaneous rate somewhere inside. It extends to real-valued functions of several variables along a line segment.

Theorem 3.7 (mean value theorem on a segment). Let \(f\) be a differentiable real-valued function on an open set containing the segment from \(\mathbf a\) to \(\mathbf b\) . Then there is a point \(\mathbf c\) on the segment with

\[ f(\mathbf b)-f(\mathbf a)=\nabla f(\mathbf c)\cdot(\mathbf b-\mathbf a). \]

Proof. Let \(g(t)=f(\mathbf a+t(\mathbf b-\mathbf a))\) for \(0\le t\le 1\) . By Theorem 2.10, \(g\) is differentiable with \(g'(t)=\nabla f(\mathbf a+t(\mathbf b-\mathbf a))\cdot(\mathbf b-\mathbf a)\) . The one-variable Mean Value Theorem gives \(t_0\in(0,1)\) with \(g(1)-g(0)=g'(t_0)\) . Take \(\mathbf c=\mathbf a+t_0(\mathbf b-\mathbf a)\) .

Corollary 3.8 (zero gradient means constant). Let \(f\) be differentiable on an open set \(U\) in which any two points can be joined by a path made of finitely many line segments lying in \(U\) . If \(\nabla f=\mathbf 0\) throughout \(U\) , then \(f\) is constant on \(U\) .

Proof. On each segment of such a path Theorem 3.7 gives \(f(\text{end})-f(\text{start})=\mathbf 0\cdot(\text{end}-\text{start})=0\) . So \(f\) takes the same value at the two ends of the path.

The hypothesis on \(U\) cannot be dropped: a function equal to \(0\) on one disc and to \(1\) on a second, disjoint disc has zero gradient on their union. A second consequence of Theorem 3.7 is an inequality. If \(\lVert\nabla f\rVert\le M\) along the segment, then by Cauchy–Schwarz \(\lvert f(\mathbf b)-f(\mathbf a)\rvert\le M\lVert\mathbf b-\mathbf a\rVert\) : a bound on the gradient is a bound on how fast the function can change.

Theorem 3.7 is a statement about real-valued functions, and it does not survive the passage to maps. For \(F(t)=(\cos t,\sin t)\) on \([0,2\pi]\) we have \(F(2\pi)-F(0)=\mathbf 0\) , yet \(F'(t)=(-\sin t,\cos t)\) is never zero, so no single \(t_0\) satisfies \(F(2\pi)-F(0)=2\pi F'(t_0)\) . Each coordinate function has its own mean-value point, and the two points differ. What does survive for maps is the inequality, in the form \(\lVert F(\mathbf b)-F(\mathbf a)\rVert\le M\lVert\mathbf b-\mathbf a\rVert\) when \(\lVert DF\rVert\le M\) on the segment; its proof and its many uses are part of analysis.

With the derivative of a map in hand, the first-order theory is complete: a differentiable map is, near each point, a linear map plus a small error, and compositions, inverses, and implicit functions are all governed by the algebra of the linear parts. The next chapter pushes the approximation one order further for real-valued functions, replacing the tangent plane by the best-fitting quadratic surface, because at a critical point the linear part vanishes and the quadratic part decides everything.

Exercises

  1. State Definition 3.1, give the shape of \(DF(\mathbf a)\) for a map from \(\mathbb R^n\) to \(\mathbb R^m\) , and describe what the matrix reduces to when \(m=1\) and when \(n=1\) .

  2. Compute the derivative matrix of each map and state its shape: (a) \(F(x,y)=(x^{2}-y^{2},\ 2xy)\) ; (b) \(G(x,y,z)=(xyz,\ x+y+z)\) ; (c) \(H(t)=(t,t^{2},t^{3})\) . For (a) also compute the determinant.

    Answer

    (a) \(DF=\begin{pmatrix}2x&-2y\\ 2y&2x\end{pmatrix}\) , of shape \(2\times 2\) , with determinant \(4(x^{2}+y^{2})\) . (b) \(DG=\begin{pmatrix}yz&xz&xy\\ 1&1&1\end{pmatrix}\) , of shape \(2\times 3\) . (c) \(DH=\begin{pmatrix}1\\ 2t\\ 3t^{2}\end{pmatrix}\) , of shape \(3\times 1\) , the velocity as a column.

  3. For \(F(x,y)=(x^{2}-y^{2},\ 2xy)\) , use the derivative at \((2,1)\) to estimate \(F(2.1,0.9)\) , compare with the exact value, and explain why one coordinate of the estimate happens to be exact.

    Solution

    From Exercise 2(a), \(DF(2,1)=\begin{pmatrix}4&-2\\ 2&4\end{pmatrix}\) and \(F(2,1)=(3,4)\) . The displacement is \(\mathbf h=(0.1,-0.1)\) , and \(DF(2,1)\mathbf h=(0.4+0.2,\ 0.2-0.4)=(0.6,-0.2)\) . The estimate is \((3.6,3.8)\) .

    The exact value is \(F(2.1,0.9)=(4.41-0.81,\ 2\cdot 2.1\cdot 0.9)\) , which is \((3.6,3.78)\) . The second coordinate is off by \(0.02\) ; the first is exact.

    To see why, expand exactly. For a step \((h,k)\) from \((x,y)\) the first coordinate changes by \((x+h)^{2}-(y+k)^{2}-x^{2}+y^{2}=2xh-2yk+(h^{2}-k^{2})\) . The linear part \(2xh-2yk\) is the prediction, and the error is \(h^{2}-k^{2}\) , which vanishes whenever \(\lvert h\rvert\) equals \(\lvert k\rvert\) , as here. The second coordinate changes by \(2(x+h)(y+k)-2xy=2yh+2xk+2hk\) , with error \(2hk=-0.02\) . In both coordinates the error is quadratic in the step, as differentiability requires; in the first it happens to be zero along the two diagonal directions.

  4. Let \(G(u,v)=(u+v,\ uv,\ u^{2})\) and \(F(x,y,z)=xy+z^{2}\) . Compute \(D(F\circ G)(1,2)\) as a product of two matrices, stating the shape of each factor, and verify the result by composing first.

    Solution

    The inner map \(G\) goes from \(\mathbb R^2\) to \(\mathbb R^3\) , so \(DG\) is \(3\times 2\) ; the outer function \(F\) goes from \(\mathbb R^3\) to \(\mathbb R\) , so \(DF\) is \(1\times 3\) ; the product \(DF\,DG\) is \(1\times 2\) , as the derivative of a real-valued function of \((u,v)\) should be.

    Compute \(DG(u,v)=\begin{pmatrix}1&1\\ v&u\\ 2u&0\end{pmatrix}\) , so \(DG(1,2)=\begin{pmatrix}1&1\\ 2&1\\ 2&0\end{pmatrix}\) , and \(G(1,2)=(3,2,1)\) . Next \(DF(x,y,z)=\begin{pmatrix}y&x&2z\end{pmatrix}\) , which at \((3,2,1)\) is \(\begin{pmatrix}2&3&2\end{pmatrix}\) . Then

    \[ D(F\circ G)(1,2)=\begin{pmatrix}2&3&2\end{pmatrix}\begin{pmatrix}1&1\\ 2&1\\ 2&0\end{pmatrix}=\begin{pmatrix}12&5\end{pmatrix}. \]

    To verify, compose: \(F(G(u,v))=(u+v)uv+u^{4}=u^{2}v+uv^{2}+u^{4}\) . Its partial derivative in \(u\) is \(2uv+v^{2}+4u^{3}=4+4+4=12\) at \((1,2)\) , and in \(v\) it is \(u^{2}+2uv=1+4=5\) . The two methods agree.

  5. Let \(w=f(x,y)\) with \(x=s^{2}-t^{2}\) and \(y=2st\) , where \(f\) is differentiable. Express \(w_s\) and \(w_t\) in terms of \(f_x\) and \(f_y\) , and show that \(w_s^{2}+w_t^{2}=4(s^{2}+t^{2})(f_x^{2}+f_y^{2})\) .

    Solution

    By the coordinate form of the chain rule, with \(x_s=2s\) , \(y_s=2t\) , \(x_t=-2t\) , \(y_t=2s\) ,

    \[ w_s=2s\,f_x+2t\,f_y,\qquad w_t=-2t\,f_x+2s\,f_y , \]

    where \(f_x\) and \(f_y\) are evaluated at \((s^{2}-t^{2},2st)\) . Squaring,

    \[ w_s^{2}=4s^{2}f_x^{2}+8st\,f_xf_y+4t^{2}f_y^{2},\qquad w_t^{2}=4t^{2}f_x^{2}-8st\,f_xf_y+4s^{2}f_y^{2}. \]

    Adding, the cross terms cancel and the rest collects as \(4(s^{2}+t^{2})f_x^{2}+4(s^{2}+t^{2})f_y^{2}=4(s^{2}+t^{2})(f_x^{2}+f_y^{2})\) .

    The reason for the clean answer is visible in the derivative matrix of the substitution, \(\begin{pmatrix}2s&-2t\\ 2t&2s\end{pmatrix}\) : its columns are orthogonal and both have length \(2\sqrt{s^{2}+t^{2}}\) , so it is a rotation followed by a scaling. Such a map multiplies the length of every gradient by the same factor.

  6. A differentiable function \(f\) on \(\mathbb R^n\) minus the origin is homogeneous of degree \(k\) if \(f(t\mathbf x)=t^{k}f(\mathbf x)\) for all \(t>0\) . Prove that then \(\mathbf x\cdot\nabla f(\mathbf x)=kf(\mathbf x)\) , and verify the identity for \(f(x,y)=x^{3}+xy^{2}\) .

    Solution

    Fix \(\mathbf x\ne\mathbf 0\) and consider the function \(\varphi(t)=f(t\mathbf x)\) for \(t>0\) . It is \(f\) composed with the curve \(t\mapsto t\mathbf x\) , whose velocity is \(\mathbf x\) , so by Theorem 2.10

    \[ \varphi'(t)=\nabla f(t\mathbf x)\cdot\mathbf x . \]

    On the other hand homogeneity says \(\varphi(t)=t^{k}f(\mathbf x)\) , and differentiating this expression in \(t\) gives \(\varphi'(t)=kt^{k-1}f(\mathbf x)\) . Equating the two expressions and setting \(t=1\) yields \(\nabla f(\mathbf x)\cdot\mathbf x=kf(\mathbf x)\) .

    For \(f(x,y)=x^{3}+xy^{2}\) , which is homogeneous of degree \(3\) because every term has total degree \(3\) , we have \(f_x=3x^{2}+y^{2}\) and \(f_y=2xy\) . Then \(xf_x+yf_y=3x^{3}+xy^{2}+2xy^{2}=3x^{3}+3xy^{2}=3f\) , as the identity predicts.

  7. The radius of a cone is \(3\) and increasing at the rate \(0.2\) per second while its height is \(4\) and decreasing at \(0.1\) per second. Use the chain rule to find the rate of change of the volume \(V=\tfrac13\pi r^{2}h\) .

    Answer

    \(\dfrac{dV}{dt}=\dfrac{\pi}{3}\bigl(2rh\,r'+r^{2}h'\bigr)=\dfrac{\pi}{3}\bigl(2\cdot 3\cdot 4\cdot 0.2+9\cdot(-0.1)\bigr)=1.3\pi\approx 4.08\) cubic units per second. The volume is increasing even though the height is falling.

  8. For the curve \(x^{2}+xy+y^{2}=7\) , find the slope and the tangent line at \((1,2)\) by implicit differentiation, checking the hypothesis of Theorem 3.6, and find all points of the curve where the tangent is horizontal.

    Solution

    Let \(F(x,y)=x^{2}+xy+y^{2}\) , a polynomial and hence of class \(C^1\) . At \((1,2)\) we have \(F=1+2+4=7\) , so the point is on the curve, and \(F_x=2x+y=4\) , \(F_y=x+2y=5\) . Since \(F_y(1,2)\ne 0\) , Theorem 3.6 applies: near \((1,2)\) the curve is a graph \(y=\varphi(x)\) with slope \(-F_x/F_y\) , which is \(-\tfrac45\) . The tangent line is \(y-2=-\tfrac45(x-1)\) , that is, \(4x+5y=14\) .

    The tangent is horizontal where the slope \(-F_x/F_y\) is zero, which requires \(F_x=0\) and \(F_y\ne 0\) . The condition \(2x+y=0\) gives \(y=-2x\) ; substituting into the curve, \(x^{2}-2x^{2}+4x^{2}=3x^{2}=7\) , so \(x=\pm\sqrt{7/3}\) . The two points are \(\bigl(\sqrt{7/3},-2\sqrt{7/3}\bigr)\) and \(\bigl(-\sqrt{7/3},2\sqrt{7/3}\bigr)\) . At both, \(F_y=x+2y=-3x\ne 0\) , so the theorem applies and the tangent is indeed horizontal. These are the lowest and highest points of the curve, which is an ellipse.

  9. The equation \(z^{3}+xz-y=0\) holds at \((x,y,z)=(1,2,1)\) . Show that it defines \(z\) as a \(C^1\) function of \((x,y)\) near that point, compute \(z_x\) and \(z_y\) there, and use them to estimate the value of \(z\) at \((1.1,1.9)\) .

    Solution

    Let \(F(x,y,z)=z^{3}+xz-y\) , a polynomial. At \((1,2,1)\) , \(F=1+1-2=0\) . The partial derivative with respect to the variable we want to solve for is \(F_z=3z^{2}+x\) , which equals \(4\) at the point and so is not zero. By the general form of Theorem 3.6, near \((1,2,1)\) the level set \(F=0\) is the graph of a unique \(C^1\) function \(z=\varphi(x,y)\) with \(\varphi(1,2)=1\) .

    Its partial derivatives are \(z_x=-F_x/F_z\) and \(z_y=-F_y/F_z\) . Here \(F_x=z=1\) and \(F_y=-1\) , so \(z_x=-\tfrac14\) and \(z_y=\tfrac14\) at the point.

    The linear estimate for a displacement \((0.1,-0.1)\) is \(z\approx 1-\tfrac14(0.1)+\tfrac14(-0.1)\) , that is, \(0.95\) . Solving \(z^{3}+1.1z-1.9=0\) numerically gives \(0.9494\) to four places, so the estimate is off by less than \(0.001\) . Notice that we differentiated a function for which we have no formula.

  10. A student reasons: “Since \(y=r\sin\theta\) , we have \(\partial y/\partial\theta=r\cos\theta\) , and therefore \(\partial\theta/\partial y=1/(r\cos\theta)\) .” Find the correct value of \(\partial\theta/\partial y\) , identify precisely what is wrong with the reasoning, and state the correct relation between the two sets of partial derivatives.

    Solution

    The correct value comes from the inverse of the derivative matrix of the polar map, as in Example 3.4: \(\partial\theta/\partial y=\cos\theta/r\) . It can be confirmed from \(\theta=\arctan(y/x)\) , whose partial derivative in \(y\) is \(x/(x^{2}+y^{2})=r\cos\theta/r^{2}\) . The student’s answer \(1/(r\cos\theta)\) differs from this by the factor \(\cos^{2}\theta\) .

    The flaw is that the two partial derivatives hold different variables fixed. In \(\partial y/\partial\theta=r\cos\theta\) the variable \(r\) is constant: the point moves along a circle. In \(\partial\theta/\partial y\) the variable \(x\) is constant: the point moves along a vertical line. A reciprocal relation holds for a function of one variable and its inverse, where there is only one way to move. With two variables there are many, and the two derivatives describe motions along different curves.

    The correct statement is that the matrices of partial derivatives are inverse to each other, \(D(T^{-1})=(DT)^{-1}\) , which follows from the chain rule applied to \(T^{-1}\circ T\) . An individual entry of the inverse matrix is not the reciprocal of the corresponding entry of the original.

  11. For \(F(x,y)=(x^{2}-y^{2},\ 2xy)\) , determine where Theorem 3.5 applies, show that \(F\) is nevertheless not one-to-one on the plane with the origin removed, and compute the derivative of a local inverse at the point \(F(2,1)=(3,4)\) .

    Hint

    From Exercise 2, \(\det DF=4(x^{2}+y^{2})\) , which is nonzero except at the origin, so Theorem 3.5 applies at every other point. For the failure of injectivity compare \(F(x,y)\) with \(F(-x,-y)\) . For the last part invert the matrix \(DF(2,1)\) of Exercise 3; you should find \(\begin{pmatrix}0.2&0.1\\ -0.1&0.2\end{pmatrix}\) .

  12. Generalize Example 3.1 to an arm with link lengths \(\ell_1\) and \(\ell_2\) : write down the hand position, compute \(\det DF\) , and describe the postures in which the hand loses a direction of motion and which direction is lost.

    Hint

    The hand is at \((\ell_1\cos\theta_1+\ell_2\cos(\theta_1+\theta_2),\ \ell_1\sin\theta_1+\ell_2\sin(\theta_1+\theta_2))\) . Expanding the determinant as in Example 3.1 gives \(\ell_1\ell_2\sin\theta_2\) . It vanishes when \(\theta_2\) is \(0\) or \(\pi\) , the arm fully extended or folded back on itself, and in both cases the columns of \(DF\) are perpendicular to the arm, so motion along the arm is lost.

  13. Let \(f\) be differentiable on a convex open set \(U\) with \(\lVert\nabla f(\mathbf x)\rVert\le M\) for all \(\mathbf x\in U\) . Prove that \(\lvert f(\mathbf b)-f(\mathbf a)\rvert\le M\lVert\mathbf b-\mathbf a\rVert\) for all \(\mathbf a,\mathbf b\in U\) , and find such an \(M\) for \(f(x,y)=\sin(x+2y)\) on the plane.

    Solution

    A set is convex when it contains the segment joining any two of its points, so for \(\mathbf a,\mathbf b\in U\) the whole segment lies in \(U\) and Theorem 3.7 applies: there is a point \(\mathbf c\) on the segment with \(f(\mathbf b)-f(\mathbf a)=\nabla f(\mathbf c)\cdot(\mathbf b-\mathbf a)\) . By the Cauchy–Schwarz inequality and the hypothesis at the point \(\mathbf c\) ,

    \[ \lvert f(\mathbf b)-f(\mathbf a)\rvert\le\lVert\nabla f(\mathbf c)\rVert\,\lVert\mathbf b-\mathbf a\rVert\le M\lVert\mathbf b-\mathbf a\rVert . \]

    For \(f(x,y)=\sin(x+2y)\) the gradient is \(\cos(x+2y)\,(1,2)\) , of length \(\lvert\cos(x+2y)\rvert\sqrt5\le\sqrt5\) . So \(M=\sqrt5\) works on the whole plane, which is convex, and \(\lvert\sin(x_1+2y_1)-\sin(x_2+2y_2)\rvert\le\sqrt5\,\lVert(x_1,y_1)-(x_2,y_2)\rVert\) for all pairs of points. No smaller constant works, because the bound is attained in the limit of nearby points along the direction \((1,2)\) where the cosine is \(1\) .

  14. Show by direct computation that for \(F(t)=(t^{2},t^{3})\) on \([0,1]\) there is no \(t_0\) with \(F(1)-F(0)=F'(t_0)\) , and explain which step in the proof of Theorem 3.7 has no counterpart for vector-valued functions.

    Solution

    Here \(F(1)-F(0)=(1,1)\) and \(F'(t)=(2t,3t^{2})\) . The equation \(F'(t_0)=(1,1)\) requires \(2t_0=1\) and \(3t_0^{2}=1\) simultaneously, that is, \(t_0=\tfrac12\) and \(t_0=1/\sqrt3\) . These are different numbers, so no such \(t_0\) exists.

    In the proof of Theorem 3.7 the one-variable Mean Value Theorem is applied to the single real-valued function \(g\) . For a map with two coordinates one can apply it to each coordinate function separately: the first coordinate \(t^{2}\) has its mean-value point at \(\tfrac12\) and the second coordinate \(t^{3}\) has its own at \(1/\sqrt3\) . The step that has no counterpart is the production of one point that serves all coordinates at once. The Mean Value Theorem is an existence statement about a real-valued function, and existence statements for several functions need not be satisfied by a common point.

  15. Let \(f\) and \(g\) be twice differentiable functions of one variable and \(c\) a constant. Use the chain rule to show that \(u(x,t)=f(x-ct)+g(x+ct)\) satisfies \(u_{tt}=c^{2}u_{xx}\) .

    Hint

    Put \(p=x-ct\) and \(q=x+ct\) . Then \(u_x=f'(p)+g'(q)\) and \(u_t=-cf'(p)+cg'(q)\) by the chain rule. Differentiate once more in the same way and compare \(u_{tt}\) with \(u_{xx}\) ; each differentiation in \(t\) brings out a factor \(\mp c\) .

  16. The period of a pendulum is \(T=2\pi\sqrt{L/g}\) . Use the linearization of \(T\) as a function of \((L,g)\) to show that the relative error in \(T\) is approximately half the relative error in \(L\) minus half the relative error in \(g\) , and bound it when \(L\) is known to within \(1\) percent and \(g\) to within \(0.5\) percent.

    Answer

    \(T_L=\pi/\sqrt{Lg}\) and \(T_g=-\pi\sqrt L/g^{3/2}\) , so \(\Delta T\approx T_L\,\Delta L+T_g\,\Delta g\) and, dividing by \(T\) , \(\Delta T/T\approx\tfrac12\Delta L/L-\tfrac12\Delta g/g\) . In the worst case the two errors have opposite signs, giving a relative error in \(T\) of at most about \(0.5+0.25=0.75\) percent.

  17. A camera maps a point \((x,y,z)\) with \(z>0\) to the image point \(P(x,y,z)=(x/z,\ y/z)\) . A particle moves along the curve \(\mathbf r(t)=(t,t^{2},1+t)\) from Chapter 1. Find the velocity of its image at \(t=1\) as the product \(DP(\mathbf r(1))\,\mathbf r'(1)\) , and check by differentiating the image curve directly.

    Solution

    At \(t=1\) the particle is at \(\mathbf r(1)=(1,1,2)\) with velocity \(\mathbf r'(1)=(1,2t,1)=(1,2,1)\) . The derivative of the camera map is

    \[ DP(x,y,z)=\begin{pmatrix}1/z&0&-x/z^{2}\\ 0&1/z&-y/z^{2}\end{pmatrix},\qquad DP(1,1,2)=\begin{pmatrix}\tfrac12&0&-\tfrac14\\ 0&\tfrac12&-\tfrac14\end{pmatrix}. \]

    By the chain rule the velocity of the image point is the product

    \[ DP(\mathbf r(1))\,\mathbf r'(1)=\bigl(\tfrac12-\tfrac14,\ 1-\tfrac14\bigr), \]

    which is \((\tfrac14,\tfrac34)\) .

    Directly, the image curve is \(\bigl(t/(1+t),\ t^{2}/(1+t)\bigr)\) . The quotient rule gives the derivatives \(1/(1+t)^{2}\) and \((2t(1+t)-t^{2})/(1+t)^{2}\) , which at \(t=1\) are \(\tfrac14\) and \(\tfrac34\) . The third column of \(DP\) records that moving away from the camera pulls the image toward the centre of the picture.

  18. Prove directly from Definition 3.1 that the derivative matrix is unique: if matrices \(A\) and \(B\) both satisfy the definition at \(\mathbf a\) , then \(A=B\) .

    Solution

    Suppose \(A\) and \(B\) both satisfy Definition 3.1 at \(\mathbf a\) . For any \(\mathbf h\ne\mathbf 0\) ,

    \[ (A-B)\mathbf h=\bigl[F(\mathbf a+\mathbf h)-F(\mathbf a)-B\mathbf h\bigr]-\bigl[F(\mathbf a+\mathbf h)-F(\mathbf a)-A\mathbf h\bigr], \]

    so by the triangle inequality \(\lVert(A-B)\mathbf h\rVert/\lVert\mathbf h\rVert\) is at most the sum of the two quotients in the definition, and therefore tends to \(0\) as \(\mathbf h\to\mathbf 0\) .

    Now fix any nonzero vector \(\mathbf v\) and take \(\mathbf h=t\mathbf v\) with \(t>0\) . By linearity \((A-B)(t\mathbf v)=t(A-B)\mathbf v\) , so

    \[ \frac{\lVert(A-B)\mathbf h\rVert}{\lVert\mathbf h\rVert}=\frac{\lVert(A-B)\mathbf v\rVert}{\lVert\mathbf v\rVert}, \]

    which does not depend on \(t\) . A constant that tends to \(0\) as \(t\to 0\) is \(0\) . Hence \((A-B)\mathbf v=\mathbf 0\) for every \(\mathbf v\) , and taking \(\mathbf v\) to be each standard basis vector shows that every column of \(A-B\) is zero. So \(A=B\) . The argument uses exactly one feature of linear maps: their relative size along a ray does not change with scale, so a linear map that is relatively small near the origin must vanish.

Search knowledge base

Explore

On this page

Note