Differentiability and the Total Derivative
Suppose a function of two variables has both partial derivatives at a point. Does that mean the function behaves like a plane near that point? Surprisingly, the answer is no. Understanding why forces us to rebuild the very definition of "derivative" for functions of several variables. In one-variable calculus, differentiability at a point means the graph has a well-defined tangent line. The difference quotient converges to a single number, the slope. In several variables there is no single direction to take a limit along. So the naive difference quotient makes no sense — division by a vector is undefined. The fix, due essentially to Fréchet and Stolz, is to stop asking "what is the derivative." Instead we ask "what linear map best approximates the function near this point." This reframing is the total derivative. It is the correct, robust generalization of the derivative to . This idea matters because it is the hinge on which all of multivariable calculus turns. Partial derivatives alone are too weak. A function can have every partial derivative at a point and yet fail to be continuous there. This is unthinkable for genuinely differentiable functions. The total derivative repairs this by demanding a uniform, direction-independent linear approximation. This single strengthened definition is exactly what is needed to prove the results students actually use. These include continuity of differentiable functions, the chain rule, and the interpretation of the gradient as encoding all directional derivatives at once. The big picture is a shift in perspective that recurs throughout advanced mathematics. Differentiation is fundamentally about linear approximation, not about slopes or rates computed one coordinate at a time. Once a function is differentiable at a point in this linearized sense, an entire machine of linear algebra becomes available. Matrices, linear maps, eigenvalues can all be used to analyze local behavior. This is the seed of the inverse function theorem, of differential geometry, and of the general theory of derivatives in Banach spaces. This article gives the precise definition of the total derivative as a linear map. It proves that differentiability implies continuity. It also proves the standard sufficient condition: continuity of all partial derivatives near a point guarantees differentiability there. Along the way we build the intuition for why partial derivatives can fail to see the whole picture. We also set up the language — the Jacobian matrix, the gradient — used in everything that follows.
- Partial derivatives measure change along coordinate axes only; they can all exist without the function being "smooth" in any real sense.
- The total derivative at a point is a linear map that best approximates near , in a precise limiting sense.
- If is differentiable at , that linear map is unique and its matrix is exactly the Jacobian of partial derivatives.
- Differentiability is a strong hypothesis: it always implies continuity at the point, unlike mere existence of partials.
- A clean sufficient condition exists: if all partial derivatives exist near and are continuous at , then is differentiable at .
- Key idea: differentiability means "looks linear up close," and this single demand upgrades a pile of partial derivatives into one honest linear approximation.
Where this lives today
The total derivative is the starting point for the <span class="wiki-link-missing">Chain Rule in Several Variables</span>, which is only true in its clean matrix form () because the derivatives involved are linear maps that compose exactly like matrices — a fact that has no clean analogue if one only has partial derivatives. It is also the foundation for the <span class="wiki-link-missing">Gradient and Directional Derivatives</span>: once is known to be linear, the Riesz representation of that linear functional (for scalar-valued ) is the gradient vector, and every directional derivative is recovered instantly as a dot product. In differential geometry and general relativity, the total derivative generalizes to the differential of a smooth map between manifolds, the basic object underlying tangent spaces and pushforwards. In optimization and machine learning, the Jacobian and its square-matrix specialization the Hessian drive Newton's method and gradient-based training algorithms, where "differentiable" in the total-derivative sense is exactly the hypothesis needed for gradient descent to make local sense. In numerical analysis, the linear approximation given by the total derivative underlies Newton's method for systems of equations, and in control theory, linearization of nonlinear dynamical systems around an equilibrium is literally computing the total derivative (Jacobian) of the vector field.
Ask the tutor: Can you show me how the total derivative behaves under the chain rule when maps into with ?
Let be open, let , and let . We say is differentiable at if there exists a linear map such that
where the limit is taken over with . If such an exists it is called the total derivative (or Fréchet derivative) of at , written or . When is differentiable at every point of we say is differentiable on . Equivalently, is differentiable at with derivative if there is a function with as , such that
When is differentiable at , its Jacobian matrix is the matrix representing in the standard bases; its entry is the partial derivative (this identification is proved below).
Intuition
Think first about : a function is differentiable at exactly when there is a number — the familiar derivative — with . The graph of the affine function is tangent to the graph of , meaning the error shrinks faster than itself. The total derivative definition is exactly this idea transplanted to : replace the number by a linear map , and replace "" by evaluating that linear map at the vector . The graph of near — an -dimensional surface sitting in — is approximated by a flat -dimensional affine subspace (a "tangent plane" when ), and the approximation error, measured relative to , must vanish no matter which direction comes from. That last clause is the crux. Partial derivatives only test what happens as approaches along the coordinate axes, one at a time. A function's graph can have a perfectly good tangent line in the -direction, a perfectly good tangent line in the -direction, and yet still be sharply creased, or even discontinuous, along other directions such as the diagonal. The total derivative rules this out by demanding a single linear approximation that works uniformly over all directions simultaneously — this is why differentiability is the strictly stronger and mathematically correct notion.
The picture above is the geometric content of the classic example (with ): along each axis the function is identically , so both partial derivatives at the origin exist and equal . But approaching the origin along the diagonal gives , so the function is not even continuous at the origin — utterly incompatible with any linear (indeed any reasonable) approximation. This single example already shows that "partials exist" is far too weak a hypothesis, and motivates why the definition of the total derivative insists on a two-sided, all-directions limit.
Let be open, , and .
(a) Uniqueness. If both satisfy the defining limit condition for the total derivative of at , then .
(b) Continuity. If is differentiable at , then is continuous at .
(a) Uniqueness. Suppose are linear maps with
By the triangle inequality, for with ,
Letting , the right side tends to , so
Fix any nonzero vector . Since is open, for all sufficiently small , so we may substitute with in . By linearity of ,
which is a constant independent of . Since this expression must tend to as while it never changes value, it must already equal . Hence . As was an arbitrary nonzero vector (and the zero vector is trivially sent to by any linear map), is the zero map, i.e. .
(b) Continuity. Let , so by definition there is as with
for all with (setting if needed, which is consistent since the term vanishes at regardless). Since is a linear map , it is represented by some matrix, and every linear map between finite-dimensional normed spaces is continuous; concretely, if has matrix entries , then by the Cauchy–Schwarz inequality applied row by row,
for some constant depending only on (for instance works, using Cauchy–Schwarz on each row and then summing squares). In particular as . Now take the limit of as :
As , the term , and since and (a product of a bounded, in fact vanishing, quantity and a vanishing quantity). Hence
which is precisely the statement that as , i.e. is continuous at .
∎If is differentiable at , then every partial derivative exists, and the matrix of in the standard bases is the Jacobian matrix
In particular for , for all , where .
Let with matrix , so for the standard basis vector . Apply the defining limit with , :
Looking at the -th coordinate (which is bounded above by the full norm, since for any vector ), we get
which says exactly that the one-variable difference quotient converges to as . That is precisely the definition of the partial derivative , and its value is . This holds for every , proving the claim. The gradient statement is the case written as a dot product, since a matrix acting on by matrix multiplication is the dot product of its row with .
∎Let be open and let . Suppose all partial derivatives exist at every point of some open ball , and each is continuous at . Then is differentiable at , and
(The vector-valued case follows by applying this componentwise, since a map into is differentiable iff each component function is.)
We use a telescoping / mean value theorem argument, changing one coordinate at a time. Write with , so that . Define the intermediate points
so . Each lies in : indeed the straight segment from to stays in the ball since is convex, and each is a convex combination of coordinates of and lying on this path region — more directly, . Telescope the difference:
The -th term changes only the -th coordinate: and agree in all coordinates except the -th, where they differ by . Define the one-variable function
for between and . Then . Since exists throughout , is differentiable on the relevant interval (a subset of shifted appropriately, staying inside by the convexity argument above), with . By the (one-variable) Mean Value Theorem applied to on the interval between and , there exists strictly between and (or anything if , in which case the term is and we may pick ) such that
Call the point ; note as , since (it is a point on the segment path within distance of , by the same convexity bound as above, since shares the first shifted coordinates and interpolates the -th). Therefore
Now subtract the candidate linear approximation :
Divide by and use :
As , we showed for each . Since each is continuous at by hypothesis, each term . Hence the right-hand side, a finite sum of vanishing quantities, tends to . This shows precisely that
and is manifestly linear in . By definition, is differentiable at with , and by the uniqueness theorem this is the only possible total derivative, matching the Jacobian/gradient formula.
∎Worked examples
Example 1 — a genuinely asymmetric differentiability check. Let , and let . We verify differentiability at directly from partial derivatives, compute the total derivative, and use it to approximate near a nearby point. Compute partials everywhere:
Both are polynomials in , hence continuous on all of (a fact from single/multivariable continuity theory: polynomials are continuous everywhere). By the continuous partials theorem, is differentiable at every point of , in particular at . Evaluate at :
So the total derivative is the linear map
with Jacobian (gradient, since ) row vector . Also compute . Linear approximation near : for small,
Test this at (an asymmetric, non-special perturbation), i.e. at the point : Approximation: . Exact value: . Compute each term: , so first term . Second term: , so . Third term: . Sum: . The linear approximation gives , the true value is — an error of about , which is small compared to (relative error , consistent with a genuinely quadratic remainder relative size that shrinks as , since is a degree-3 polynomial and the next-order terms are quadratic in ).
Example 2 — partials exist but differentiability fails (the boundary case made precise). Let
This is a genuinely asymmetric variant of the standard counterexample (using rather than ), chosen so continuity actually holds here — making the failure purely about the linear approximation, a subtler and more instructive breakdown.
Continuity at : using polar coordinates ,
Since for all , we get as . So is continuous at the origin, with .
Partial derivatives at the origin: by definition,
Both partials exist. If were differentiable at , uniqueness together with the Jacobian identity would force
Testing the defining limit directly. We must check whether
Using polar coordinates again, the numerator is
so the whole quotient equals
which is independent of and depends only on the approach angle . Along (i.e. approaching along the positive -axis, ): the quotient is . But along (the diagonal ): , so both bracketed differences are , giving quotient too — so we must probe further. Try : , .
Quotient . Since the quotient takes the nonzero value along rays with arbitrarily close to the origin, while the definition requires the quotient to tend to along every path, the limit does not exist (or at least is not ). Hence is not differentiable at , even though it is continuous there and both partial derivatives exist. This shows continuity plus existence of partials is still not enough — the extra ingredient of continuity of the partials near the point (used in the sufficient condition theorem) is doing real work, since here the partials can be computed to be discontinuous at the origin (direct computation shows their values depend on the approach angle in the same oscillatory way).
The sufficient condition theorem hypothesizes that the partial derivatives exist and are continuous at . Drop the continuity requirement, keeping only existence, and differentiability can fail — Example 2 above is exactly such an instance. To see explicitly that the partials are discontinuous at the origin, compute away from the origin using the quotient rule:
Along the path approaching the origin, , so this simplifies to for all on that path. But we computed . Since , does not tend to its value at the origin as we approach along , so is discontinuous at . This is precisely the missing hypothesis, and precisely why the mean-value-theorem proof of the sufficient condition theorem cannot be salvaged here: the error terms do not vanish as , so the proof's key estimate breaks down, matching the failure of differentiability we exhibited directly.
Scope, edge cases & common traps
| Situation | What is true | What is not automatically true |
|---|---|---|
| All partials exist at | Nothing about continuity or differentiability at | need not be continuous at (e.g. ) |
| continuous at , partials exist at | Still nothing guaranteed about differentiability | Directional limit of difference quotient may depend on direction (Example 2) |
| Partials exist near and continuous at | is differentiable at (the sufficient condition theorem) | Converse is false: differentiable functions can have discontinuous partials nearby (partials need only exist, not be continuous, off the single point where the derivative is evaluated, in more elaborate examples) |
| differentiable at | continuous at ; unique total derivative; Jacobian formula holds | Existence of the total derivative does not require partials to be continuous everywhere near , only that some linear map works at itself |
The mathematician behind it
Origins · 1 minMaurice René Fréchet and how this was discovered
Fréchet, a French mathematician trained under Jacques Hadamard, sought a definition of "derivative" general enough to apply not just in but in infinite-dimensional spaces of functions. His 1906 doctoral thesis introduced the general framework of metric spaces, and his subsequent work on differentiation in normed vector spaces — now called the Fréchet derivative — is the direct ancestor of the total derivative definition given here, specialized down to . The key conceptual leap, that a derivative should be a linear map satisfying a uniform approximation property rather than a number or a table of numbers, is his.
Why isn't "all partial derivatives exist" the correct definition of differentiability?
Because partial derivatives only probe behavior along the coordinate axes, they can completely miss bad behavior in other directions. The function (extended by ) has , yet is not even continuous at the origin, since for all while . Any acceptable definition of "derivative" must at minimum force continuity, matching single-variable calculus, where differentiability implies continuity. The total derivative definition, requiring a uniform vanishing-error linear approximation over all directions of approach simultaneously, is the right generalization precisely because it does force continuity, as proved in the main theorem.
Is the total derivative the same thing as the Jacobian matrix?
They are closely related but conceptually distinct. The total derivative is a linear map , an abstract object independent of any choice of coordinates. The Jacobian matrix is the concrete matrix representing that linear map once you fix the standard bases on domain and codomain. The corollary proved above shows they carry identical information — the entry of the Jacobian is — but the total derivative is the primary, basis-free notion, while the Jacobian is its computational shadow.
Does differentiability at a single point say anything about a neighborhood of that point?
No — differentiability at is purely a local, pointwise statement about the limiting behavior of as , and it says nothing directly about points other than . It is entirely possible to construct functions differentiable at exactly one point and nowhere else nearby (analogous to one-variable examples like for rational and for irrational , adapted to several variables). The sufficient condition theorem sidesteps this concern by hypothesizing that partials exist on a whole neighborhood and are continuous at the point of interest, which is what lets the mean value theorem argument access nearby intermediate points.
How does the total derivative definition relate to the tangent plane from vector calculus?
For a scalar function differentiable at , the affine function , written out using the gradient as , is exactly the classical tangent plane formula. The defining limit condition says the graph of and this plane differ by an error that is , which is the rigorous meaning of "the plane is tangent to the graph." So the tangent plane is simply the graph of the affine approximation built from the total derivative.
Can a function be differentiable at a point without its partial derivatives being continuous anywhere nearby?
Yes. The sufficient condition (continuous partials near ) is only a sufficient, not necessary, condition for differentiability at . There exist functions, built by scaling oscillatory terms like into two variables, whose partial derivatives exist everywhere but oscillate wildly and are discontinuous at the point in question, while the function is still differentiable exactly there by direct verification of the defining limit. Such examples show the theorem in this article gives a convenient, checkable sufficient condition, not an if-and-only-if characterization.
Why does the proof of the sufficient condition theorem move one coordinate at a time instead of all at once?
Because the one-variable Mean Value Theorem, the key tool available, only applies to functions of a single real variable. By freezing all but one coordinate and letting only that one vary, each step of the telescoping sum becomes an honest single-variable function to which the Mean Value Theorem directly applies, producing an exact intermediate point. Summing these exact one-variable statements, and then using continuity of the partials to show the intermediate points can be replaced by itself in the limit, reconstructs the full multivariable linear approximation.
What goes wrong if is not assumed open in the definition?
Openness of guarantees that for every direction , the point lies in for all sufficiently small , which is what allows the limit defining differentiability, and the uniqueness argument extracting from that limit, to make sense in every direction. If were a boundary point of , some directions might be entirely unavailable near , the limit could only be taken over a restricted cone of directions, and the resulting "derivative" would generally fail to be unique, since a linear map is only pinned down by testing all directions in .