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 Rn\mathbb{R}^n. 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.

Key takeaways
  • 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 Df(a):Rn→RmDf(a): \mathbb{R}^n \to \mathbb{R}^m that best approximates ff near aa, in a precise limiting sense.
  • If ff is differentiable at aa, 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 aa and are continuous at aa, then ff is differentiable at aa.
  • 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 (D(g∘f)(a)=Dg(f(a)) Df(a)D(g\circ f)(a) = Dg(f(a))\,Df(a)) 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 Df(a)Df(a) is known to be linear, the Riesz representation of that linear functional (for scalar-valued ff) 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 ff maps into Rm\mathbb{R}^m with m>1m>1?

DefinitionTotal derivative / differentiability at a point

Let U⊆RnU \subseteq \mathbb{R}^n be open, let f:U→Rmf : U \to \mathbb{R}^m, and let a∈Ua \in U. We say ff is differentiable at aa if there exists a linear map L:Rn→RmL : \mathbb{R}^n \to \mathbb{R}^m such that

lim⁡h→0∥f(a+h)−f(a)−L(h)∥∥h∥=0,\lim_{h \to 0} \frac{\lVert f(a+h) - f(a) - L(h) \rVert}{\lVert h \rVert} = 0,

where the limit is taken over h∈Rn∖{0}h \in \mathbb{R}^n \setminus \{0\} with a+h∈Ua + h \in U. If such an LL exists it is called the total derivative (or Fréchet derivative) of ff at aa, written Df(a)Df(a) or f′(a)f'(a). When ff is differentiable at every point of UU we say ff is differentiable on UU. Equivalently, ff is differentiable at aa with derivative LL if there is a function ε:U−a→Rm\varepsilon : U - a \to \mathbb{R}^m with ε(h)→0\varepsilon(h) \to 0 as h→0h \to 0, such that

f(a+h)=f(a)+L(h)+∥h∥ ε(h).f(a+h) = f(a) + L(h) + \lVert h \rVert \,\varepsilon(h).

When ff is differentiable at aa, its Jacobian matrix Jf(a)Jf(a) is the m×nm \times n matrix representing L=Df(a)L = Df(a) in the standard bases; its (i,j)(i,j) entry is the partial derivative ∂fi/∂xj(a)\partial f_i/\partial x_j(a) (this identification is proved below).

Intuition

Think first about m=n=1m = n = 1: a function ff is differentiable at aa exactly when there is a number LL — the familiar derivative f′(a)f'(a) — with f(a+h)=f(a)+Lh+o(h)f(a+h) = f(a) + Lh + o(h). The graph of the affine function x↦f(a)+f′(a)(x−a)x \mapsto f(a) + f'(a)(x-a) is tangent to the graph of ff, meaning the error shrinks faster than hh itself. The total derivative definition is exactly this idea transplanted to Rn\mathbb{R}^n: replace the number LL by a linear map L:Rn→RmL : \mathbb{R}^n \to \mathbb{R}^m, and replace "LhLh" by evaluating that linear map at the vector hh. The graph of ff near aa — an nn-dimensional surface sitting in Rn+m\mathbb{R}^{n+m} — is approximated by a flat nn-dimensional affine subspace (a "tangent plane" when n=2,m=1n=2,m=1), and the approximation error, measured relative to ∥h∥\lVert h\rVert, must vanish no matter which direction h→0h \to 0 comes from. That last clause is the crux. Partial derivatives only test what happens as hh approaches 00 along the coordinate axes, one at a time. A function's graph can have a perfectly good tangent line in the xx-direction, a perfectly good tangent line in the yy-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.

Figure
A cone-like graph: partials exist at the origin but the surface is not flat there
x z = f(x,y) slice y=0: flat, f_x(0,0)=0 slice x=y: sharp V, not linear a = (0,0)

The picture above is the geometric content of the classic example f(x,y)=xyx2+y2f(x,y) = \dfrac{xy}{x^2+y^2} (with f(0,0)=0f(0,0)=0): along each axis the function is identically 00, so both partial derivatives at the origin exist and equal 00. But approaching the origin along the diagonal x=yx = y gives f(x,x)=1/2≠0f(x,x) = 1/2 \neq 0, 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.

TheoremUniqueness of the total derivative, and differentiability implies continuity

Let U⊆RnU \subseteq \mathbb{R}^n be open, f:U→Rmf: U \to \mathbb{R}^m, and a∈Ua \in U.

(a) Uniqueness. If L1,L2:Rn→RmL_1, L_2 : \mathbb{R}^n \to \mathbb{R}^m both satisfy the defining limit condition for the total derivative of ff at aa, then L1=L2L_1 = L_2.

(b) Continuity. If ff is differentiable at aa, then ff is continuous at aa.

Proof

(a) Uniqueness. Suppose L1,L2L_1, L_2 are linear maps Rn→Rm\mathbb{R}^n \to \mathbb{R}^m with

lim⁡h→0∥f(a+h)−f(a)−L1(h)∥∥h∥=0,lim⁡h→0∥f(a+h)−f(a)−L2(h)∥∥h∥=0.\lim_{h\to 0}\frac{\lVert f(a+h)-f(a)-L_1(h)\rVert}{\lVert h\rVert}=0, \qquad \lim_{h\to 0}\frac{\lVert f(a+h)-f(a)-L_2(h)\rVert}{\lVert h\rVert}=0.

By the triangle inequality, for h≠0h \neq 0 with a+h∈Ua+h \in U,

∥L1(h)−L2(h)∥∥h∥≤∥f(a+h)−f(a)−L1(h)∥∥h∥+∥f(a+h)−f(a)−L2(h)∥∥h∥.\frac{\lVert L_1(h) - L_2(h)\rVert}{\lVert h \rVert} \le \frac{\lVert f(a+h)-f(a)-L_1(h)\rVert}{\lVert h\rVert} + \frac{\lVert f(a+h)-f(a)-L_2(h)\rVert}{\lVert h\rVert}.

Letting h→0h \to 0, the right side tends to 00, so

lim⁡h→0∥(L1−L2)(h)∥∥h∥=0.(∗)\lim_{h \to 0} \frac{\lVert (L_1 - L_2)(h)\rVert}{\lVert h \rVert} = 0. \tag{$\ast$}

Fix any nonzero vector v∈Rnv \in \mathbb{R}^n. Since UU is open, a+tv∈Ua + tv \in U for all sufficiently small t>0t > 0, so we may substitute h=tvh = tv with t→0+t \to 0^+ in (∗)(\ast). By linearity of L1−L2L_1 - L_2,

∥(L1−L2)(tv)∥∥tv∥=∣t∣ ∥(L1−L2)(v)∥∣t∣ ∥v∥=∥(L1−L2)(v)∥∥v∥,\frac{\lVert (L_1-L_2)(tv)\rVert}{\lVert tv\rVert} = \frac{|t|\,\lVert (L_1-L_2)(v)\rVert}{|t|\,\lVert v \rVert} = \frac{\lVert (L_1-L_2)(v)\rVert}{\lVert v\rVert},

which is a constant independent of tt. Since this expression must tend to 00 as t→0+t \to 0^+ while it never changes value, it must already equal 00. Hence (L1−L2)(v)=0(L_1-L_2)(v) = 0. As vv was an arbitrary nonzero vector (and the zero vector is trivially sent to 00 by any linear map), L1−L2L_1 - L_2 is the zero map, i.e. L1=L2L_1 = L_2.

(b) Continuity. Let L=Df(a)L = Df(a), so by definition there is ε(h)→0\varepsilon(h) \to 0 as h→0h \to 0 with

f(a+h)=f(a)+L(h)+∥h∥ ε(h)f(a+h) = f(a) + L(h) + \lVert h \rVert\, \varepsilon(h)

for all hh with a+h∈Ua + h \in U (setting ε(0)=0\varepsilon(0) = 0 if needed, which is consistent since the ∥h∥ε(h)\lVert h \rVert \varepsilon(h) term vanishes at h=0h=0 regardless). Since LL is a linear map Rn→Rm\mathbb{R}^n \to \mathbb{R}^m, it is represented by some matrix, and every linear map between finite-dimensional normed spaces is continuous; concretely, if LL has matrix entries (ℓij)(\ell_{ij}), then by the Cauchy–Schwarz inequality applied row by row,

∥L(h)∥≤C∥h∥\lVert L(h) \rVert \le C \lVert h \rVert

for some constant C≥0C \ge 0 depending only on LL (for instance C=(∑i,jℓij2)1/2C = \left(\sum_{i,j} \ell_{ij}^2\right)^{1/2} works, using Cauchy–Schwarz on each row and then summing squares). In particular L(h)→0L(h) \to 0 as h→0h \to 0. Now take the limit of f(a+h)f(a+h) as h→0h \to 0:

∥f(a+h)−f(a)∥≤∥L(h)∥+∥h∥ ∥ε(h)∥≤C∥h∥+∥h∥∥ε(h)∥.\lVert f(a+h) - f(a) \rVert \le \lVert L(h) \rVert + \lVert h \rVert \, \lVert \varepsilon(h) \rVert \le C\lVert h \rVert + \lVert h\rVert \lVert \varepsilon(h)\rVert.

As h→0h \to 0, the term C∥h∥→0C\lVert h \rVert \to 0, and ∥h∥∥ε(h)∥→0\lVert h \rVert \lVert \varepsilon(h) \rVert \to 0 since ε(h)→0\varepsilon(h) \to 0 and ∥h∥→0\lVert h \rVert \to 0 (a product of a bounded, in fact vanishing, quantity and a vanishing quantity). Hence

lim⁡h→0∥f(a+h)−f(a)∥=0,\lim_{h \to 0} \lVert f(a+h) - f(a) \rVert = 0,

which is precisely the statement that f(a+h)→f(a)f(a+h) \to f(a) as h→0h \to 0, i.e. ff is continuous at aa. ■\blacksquare

∎
CorollaryThe Jacobian identity

If f=(f1,…,fm):U→Rmf = (f_1, \dots, f_m) : U \to \mathbb{R}^m is differentiable at a∈U⊆Rna \in U \subseteq \mathbb{R}^n, then every partial derivative ∂fi/∂xj(a)\partial f_i/\partial x_j(a) exists, and the matrix of Df(a)Df(a) in the standard bases is the Jacobian matrix

Jf(a)=(∂fi∂xj(a))1≤i≤m, 1≤j≤n.Jf(a) = \left( \frac{\partial f_i}{\partial x_j}(a) \right)_{1 \le i \le m,\ 1 \le j \le n}.

In particular for m=1m=1, Df(a)(v)=∇f(a)⋅vDf(a)(v) = \nabla f(a) \cdot v for all v∈Rnv \in \mathbb{R}^n, where ∇f(a)=(∂f∂x1(a),…,∂f∂xn(a))\nabla f(a) = \left(\frac{\partial f}{\partial x_1}(a), \dots, \frac{\partial f}{\partial x_n}(a)\right).

Proof

Let L=Df(a)L = Df(a) with matrix (ℓij)(\ell_{ij}), so L(ej)=(ℓ1j,…,ℓmj)L(e_j) = (\ell_{1j}, \ldots, \ell_{mj}) for the standard basis vector eje_j. Apply the defining limit with h=tejh = t e_j, t→0t \to 0:

lim⁡t→0∥f(a+tej)−f(a)−tL(ej)∥∣t∣=0.\lim_{t \to 0} \frac{\lVert f(a + te_j) - f(a) - t L(e_j)\rVert}{|t|} = 0.

Looking at the ii-th coordinate (which is bounded above by the full norm, since ∣xi∣≤∥x∥|x_i| \le \lVert x \rVert for any vector xx), we get

lim⁡t→0∣fi(a+tej)−fi(a)t−ℓij∣=0,\lim_{t\to 0} \left| \frac{f_i(a+te_j) - f_i(a)}{t} - \ell_{ij} \right| = 0,

which says exactly that the one-variable difference quotient fi(a+tej)−fi(a)t\frac{f_i(a+te_j)-f_i(a)}{t} converges to ℓij\ell_{ij} as t→0t \to 0. That is precisely the definition of the partial derivative ∂fi/∂xj(a)\partial f_i/\partial x_j(a), and its value is ℓij\ell_{ij}. This holds for every i,ji,j, proving the claim. The gradient statement is the m=1m=1 case written as a dot product, since a 1×n1\times n matrix acting on vv by matrix multiplication is the dot product of its row with vv. ■\blacksquare

∎
TheoremSufficient condition: continuous partials imply differentiability

Let U⊆RnU \subseteq \mathbb{R}^n be open and let f:U→Rf : U \to \mathbb{R}. Suppose all partial derivatives ∂f/∂x1,…,∂f/∂xn\partial f/\partial x_1, \dots, \partial f/\partial x_n exist at every point of some open ball B(a,r)⊆UB(a,r) \subseteq U, and each is continuous at aa. Then ff is differentiable at aa, and

Df(a)(v)=∑j=1n∂f∂xj(a) vj.Df(a)(v) = \sum_{j=1}^n \frac{\partial f}{\partial x_j}(a)\, v_j.

(The vector-valued case f:U→Rmf : U \to \mathbb{R}^m follows by applying this componentwise, since a map into Rm\mathbb{R}^m is differentiable iff each component function is.)

Proof

We use a telescoping / mean value theorem argument, changing one coordinate at a time. Write h=(h1,…,hn)h = (h_1, \ldots, h_n) with ∥h∥<r\lVert h \rVert < r, so that a+h∈B(a,r)⊆Ua + h \in B(a,r) \subseteq U. Define the intermediate points

a(0)=a,a(k)=a+(h1,…,hk,0,…,0)(k=1,…,n),a^{(0)} = a, \qquad a^{(k)} = a + (h_1, \ldots, h_k, 0, \ldots, 0) \quad (k=1,\ldots,n),

so a(n)=a+ha^{(n)} = a+h. Each a(k)a^{(k)} lies in B(a,r)B(a,r): indeed the straight segment from aa to a+ha+h stays in the ball since B(a,r)B(a,r) is convex, and each a(k)a^{(k)} is a convex combination of coordinates of aa and a+ha+h lying on this path region — more directly, ∥a(k)−a∥=(∑i≤khi2)1/2≤∥h∥<r\lVert a^{(k)} - a\rVert = \left(\sum_{i\le k} h_i^2\right)^{1/2} \le \lVert h \rVert < r. Telescope the difference:

f(a+h)−f(a)=∑k=1n[f(a(k))−f(a(k−1))].f(a+h) - f(a) = \sum_{k=1}^n \left[ f(a^{(k)}) - f(a^{(k-1)}) \right].

The kk-th term changes only the kk-th coordinate: a(k)a^{(k)} and a(k−1)a^{(k-1)} agree in all coordinates except the kk-th, where they differ by hkh_k. Define the one-variable function

gk(t)=f(a1+h1,…,ak−1+hk−1, ak+t, ak+1,…,an)g_k(t) = f\big(a_1+h_1, \ldots, a_{k-1}+h_{k-1},\, a_k + t,\, a_{k+1}, \ldots, a_n\big)

for tt between 00 and hkh_k. Then f(a(k))−f(a(k−1))=gk(hk)−gk(0)f(a^{(k)}) - f(a^{(k-1)}) = g_k(h_k) - g_k(0). Since ∂f/∂xk\partial f/\partial x_k exists throughout B(a,r)B(a,r), gkg_k is differentiable on the relevant interval (a subset of (−r,r)(-r,r) shifted appropriately, staying inside B(a,r)B(a,r) by the convexity argument above), with gk′(t)=∂f∂xk(a(k−1)+tek)g_k'(t) = \frac{\partial f}{\partial x_k}(a^{(k-1)} + t e_k). By the (one-variable) Mean Value Theorem applied to gkg_k on the interval between 00 and hkh_k, there exists θk\theta_k strictly between 00 and 11 (or θk=\theta_k = anything if hk=0h_k=0, in which case the term is 00 and we may pick θk=0\theta_k=0) such that

gk(hk)−gk(0)=hk gk′(θkhk)=hk⋅∂f∂xk(a(k−1)+θkhkek).g_k(h_k) - g_k(0) = h_k\, g_k'(\theta_k h_k) = h_k \cdot \frac{\partial f}{\partial x_k}\big(a^{(k-1)} + \theta_k h_k e_k\big).

Call the point c(k):=a(k−1)+θkhkekc^{(k)} := a^{(k-1)} + \theta_k h_k e_k; note c(k)→ac^{(k)} \to a as h→0h \to 0, since ∥c(k)−a∥≤∥h∥\lVert c^{(k)} - a\rVert \le \lVert h\rVert (it is a point on the segment path within distance ∥h∥\lVert h \rVert of aa, by the same convexity bound as above, since c(k)c^{(k)} shares the first k−1k-1 shifted coordinates and interpolates the kk-th). Therefore

f(a+h)−f(a)=∑k=1nhk ∂f∂xk(c(k)).f(a+h) - f(a) = \sum_{k=1}^n h_k\, \frac{\partial f}{\partial x_k}(c^{(k)}).

Now subtract the candidate linear approximation ∑khk∂f∂xk(a)\sum_k h_k \frac{\partial f}{\partial x_k}(a):

f(a+h)−f(a)−∑k=1nhk∂f∂xk(a)=∑k=1nhk[∂f∂xk(c(k))−∂f∂xk(a)].f(a+h) - f(a) - \sum_{k=1}^n h_k \frac{\partial f}{\partial x_k}(a) = \sum_{k=1}^n h_k \left[ \frac{\partial f}{\partial x_k}(c^{(k)}) - \frac{\partial f}{\partial x_k}(a) \right].

Divide by ∥h∥\lVert h \rVert and use ∣hk∣≤∥h∥|h_k| \le \lVert h \rVert:

∣f(a+h)−f(a)−∑khk∂f∂xk(a)∣∥h∥≤∑k=1n∣∂f∂xk(c(k))−∂f∂xk(a)∣.\frac{\left| f(a+h)-f(a) - \sum_k h_k \frac{\partial f}{\partial x_k}(a)\right|}{\lVert h \rVert} \le \sum_{k=1}^n \left| \frac{\partial f}{\partial x_k}(c^{(k)}) - \frac{\partial f}{\partial x_k}(a) \right|.

As h→0h \to 0, we showed c(k)→ac^{(k)} \to a for each kk. Since each ∂f/∂xk\partial f/\partial x_k is continuous at aa by hypothesis, each term ∣∂f∂xk(c(k))−∂f∂xk(a)∣→0\left|\frac{\partial f}{\partial x_k}(c^{(k)}) - \frac{\partial f}{\partial x_k}(a)\right| \to 0. Hence the right-hand side, a finite sum of nn vanishing quantities, tends to 00. This shows precisely that

lim⁡h→0∣f(a+h)−f(a)−L(h)∣∥h∥=0,L(h):=∑j=1n∂f∂xj(a)hj,\lim_{h \to 0} \frac{\left| f(a+h) - f(a) - L(h)\right|}{\lVert h \rVert} = 0, \qquad L(h) := \sum_{j=1}^n \frac{\partial f}{\partial x_j}(a) h_j,

and LL is manifestly linear in hh. By definition, ff is differentiable at aa with Df(a)=LDf(a) = L, and by the uniqueness theorem this is the only possible total derivative, matching the Jacobian/gradient formula. ■\blacksquare

∎

Worked examples

Example 1 — a genuinely asymmetric differentiability check. Let f(x,y)=x2y+3xy2−y3f(x,y) = x^2 y + 3xy^2 - y^3, and let a=(2,−1)a = (2,-1). We verify differentiability at aa directly from partial derivatives, compute the total derivative, and use it to approximate ff near a nearby point. Compute partials everywhere:

∂f∂x=2xy+3y2,∂f∂y=x2+6xy−3y2.\frac{\partial f}{\partial x} = 2xy + 3y^2, \qquad \frac{\partial f}{\partial y} = x^2 + 6xy - 3y^2.

Both are polynomials in x,yx,y, hence continuous on all of R2\mathbb{R}^2 (a fact from single/multivariable continuity theory: polynomials are continuous everywhere). By the continuous partials theorem, ff is differentiable at every point of R2\mathbb{R}^2, in particular at a=(2,−1)a = (2,-1). Evaluate at a=(2,−1)a=(2,-1):

∂f∂x(2,−1)=2(2)(−1)+3(−1)2=−4+3=−1,\frac{\partial f}{\partial x}(2,-1) = 2(2)(-1) + 3(-1)^2 = -4 + 3 = -1,
∂f∂y(2,−1)=(2)2+6(2)(−1)−3(−1)2=4−12−3=−11.\frac{\partial f}{\partial y}(2,-1) = (2)^2 + 6(2)(-1) - 3(-1)^2 = 4 - 12 - 3 = -11.

So the total derivative is the linear map

Df(2,−1)(v1,v2)=−v1−11v2,Df(2,-1)(v_1,v_2) = -v_1 - 11 v_2,

with Jacobian (gradient, since m=1m=1) row vector ∇f(2,−1)=(−1,−11)\nabla f(2,-1) = (-1,-11). Also compute f(2,−1)=(2)2(−1)+3(2)(−1)2−(−1)3=−4+6+1=3f(2,-1) = (2)^2(-1) + 3(2)(-1)^2 - (-1)^3 = -4 + 6 + 1 = 3. Linear approximation near aa: for h=(h1,h2)h = (h_1,h_2) small,

f(2+h1, −1+h2)≈3−h1−11h2.f(2+h_1,\,-1+h_2) \approx 3 - h_1 - 11 h_2.

Test this at h=(0.1,−0.05)h = (0.1, -0.05) (an asymmetric, non-special perturbation), i.e. at the point (2.1,−1.05)(2.1, -1.05): Approximation: 3−(0.1)−11(−0.05)=3−0.1+0.55=3.453 - (0.1) - 11(-0.05) = 3 - 0.1 + 0.55 = 3.45. Exact value: f(2.1,−1.05)=(2.1)2(−1.05)+3(2.1)(−1.05)2−(−1.05)3f(2.1,-1.05) = (2.1)^2(-1.05) + 3(2.1)(-1.05)^2 - (-1.05)^3. Compute each term: (2.1)2=4.41(2.1)^2 = 4.41, so first term =4.41×(−1.05)=−4.6305= 4.41 \times(-1.05) = -4.6305. Second term: (−1.05)2=1.1025(-1.05)^2 = 1.1025, so 3(2.1)(1.1025)=6.3(1.1025)=6.945753(2.1)(1.1025) = 6.3(1.1025) = 6.94575. Third term: −(−1.05)3=−(−1.157625)=1.157625-(-1.05)^3 = -(-1.157625) = 1.157625. Sum: −4.6305+6.94575+1.157625=3.472875-4.6305 + 6.94575 + 1.157625 = 3.472875. The linear approximation gives 3.453.45, the true value is 3.4728753.472875 — an error of about 0.02290.0229, which is small compared to ∥h∥=0.12+0.052≈0.1118\lVert h \rVert = \sqrt{0.1^2+0.05^2} \approx 0.1118 (relative error ≈0.205\approx 0.205, consistent with a genuinely quadratic remainder O(∥h∥)O(\lVert h\rVert) relative size that shrinks as h→0h\to 0, since ff is a degree-3 polynomial and the next-order terms are quadratic in hh).

Example 2 — partials exist but differentiability fails (the boundary case made precise). Let

f(x,y)={x3−y3x2+y2(x,y)≠(0,0)0(x,y)=(0,0).f(x,y) = \begin{cases} \dfrac{x^3 - y^3}{x^2+y^2} & (x,y) \neq (0,0) \\ 0 & (x,y) = (0,0). \end{cases}

This is a genuinely asymmetric variant of the standard counterexample (using x3−y3x^3 - y^3 rather than xyxy), chosen so continuity actually holds here — making the failure purely about the linear approximation, a subtler and more instructive breakdown.

Continuity at (0,0)(0,0): using polar coordinates x=ρcos⁡θ,y=ρsin⁡θx = \rho\cos\theta, y = \rho\sin\theta,

f=ρ3(cos⁡3θ−sin⁡3θ)ρ2=ρ(cos⁡3θ−sin⁡3θ).f = \frac{\rho^3(\cos^3\theta - \sin^3\theta)}{\rho^2} = \rho(\cos^3\theta - \sin^3\theta).

Since ∣cos⁡3θ−sin⁡3θ∣≤2|\cos^3\theta - \sin^3\theta| \le 2 for all θ\theta, we get ∣f(x,y)∣≤2ρ=2∥(x,y)∥→0|f(x,y)| \le 2\rho = 2\lVert (x,y)\rVert \to 0 as (x,y)→(0,0)(x,y)\to(0,0). So ff is continuous at the origin, with f(0,0)=0f(0,0)=0.

Partial derivatives at the origin: by definition,

∂f∂x(0,0)=lim⁡t→0f(t,0)−f(0,0)t=lim⁡t→0t3/t2t=lim⁡t→01=1,\frac{\partial f}{\partial x}(0,0) = \lim_{t\to0} \frac{f(t,0)-f(0,0)}{t} = \lim_{t\to 0}\frac{t^3/t^2}{t} = \lim_{t\to0} 1 = 1,
∂f∂y(0,0)=lim⁡t→0f(0,t)−f(0,0)t=lim⁡t→0−t3/t2t=lim⁡t→0(−1)=−1.\frac{\partial f}{\partial y}(0,0) = \lim_{t\to0}\frac{f(0,t)-f(0,0)}{t} = \lim_{t\to0} \frac{-t^3/t^2}{t} = \lim_{t\to0}(-1) = -1.

Both partials exist. If ff were differentiable at (0,0)(0,0), uniqueness together with the Jacobian identity would force

Df(0,0)(v1,v2)=v1−v2.Df(0,0)(v_1,v_2) = v_1 - v_2.

Testing the defining limit directly. We must check whether

lim⁡(h1,h2)→(0,0)f(h1,h2)−0−(h1−h2)h12+h22=0.\lim_{(h_1,h_2)\to(0,0)} \frac{f(h_1,h_2) - 0 - (h_1 - h_2)}{\sqrt{h_1^2+h_2^2}} = 0.

Using polar coordinates again, the numerator is

ρ(cos⁡3θ−sin⁡3θ)−ρ(cos⁡θ−sin⁡θ)=ρ[(cos⁡3θ−sin⁡3θ)−(cos⁡θ−sin⁡θ)],\rho(\cos^3\theta-\sin^3\theta) - \rho(\cos\theta - \sin\theta) = \rho\big[(\cos^3\theta-\sin^3\theta) - (\cos\theta-\sin\theta)\big],

so the whole quotient equals

(cos⁡3θ−sin⁡3θ)−(cos⁡θ−sin⁡θ),(\cos^3\theta-\sin^3\theta) - (\cos\theta-\sin\theta),

which is independent of ρ\rho and depends only on the approach angle θ\theta. Along θ=π/2\theta = \pi/2 (i.e. approaching along the positive yy-axis, h1=0h_1=0): the quotient is (0−1)−(0−1)=0(0 - 1) - (0-1) = 0. But along θ=π/4\theta = \pi/4 (the diagonal h1=h2h_1=h_2): cos⁡θ=sin⁡θ=12\cos\theta=\sin\theta = \tfrac{1}{\sqrt2}, so both bracketed differences are 00, giving quotient 00 too — so we must probe further. Try θ=π/3\theta = \pi/3: cos⁡θ=1/2\cos\theta = 1/2, sin⁡θ=3/2≈0.8660\sin\theta = \sqrt3/2 \approx 0.8660.

cos⁡3θ−sin⁡3θ=0.125−0.6495=−0.5245,cos⁡θ−sin⁡θ=0.5−0.8660=−0.3660.\cos^3\theta - \sin^3\theta = 0.125 - 0.6495 = -0.5245, \qquad \cos\theta-\sin\theta = 0.5 - 0.8660 = -0.3660.

Quotient =−0.5245−(−0.3660)=−0.1585≠0= -0.5245 - (-0.3660) = -0.1585 \neq 0. Since the quotient takes the nonzero value ≈−0.1585\approx -0.1585 along rays with θ=π/3\theta = \pi/3 arbitrarily close to the origin, while the definition requires the quotient to tend to 00 along every path, the limit does not exist (or at least is not 00). Hence ff is not differentiable at (0,0)(0,0), 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 ∂f/∂x,∂f/∂y\partial f/\partial x, \partial f/\partial y can be computed to be discontinuous at the origin (direct computation shows their values depend on the approach angle in the same oscillatory way).

CounterexampleWhy continuity of the partials — not just their existence — is required

The sufficient condition theorem hypothesizes that the partial derivatives exist and are continuous at aa. 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:

∂f∂x(x,y)=3x2(x2+y2)−(x3−y3)(2x)(x2+y2)2(x,y)≠(0,0).\frac{\partial f}{\partial x}(x,y) = \frac{3x^2(x^2+y^2) - (x^3-y^3)(2x)}{(x^2+y^2)^2} \quad (x,y)\neq(0,0).

Along the path y=xy = x approaching the origin, x3−y3=0x^3-y^3=0, so this simplifies to 3x2(2x2)(2x2)2=6x44x4=32\frac{3x^2(2x^2)}{(2x^2)^2} = \frac{6x^4}{4x^4} = \frac32 for all x≠0x\neq0 on that path. But we computed ∂f∂x(0,0)=1\frac{\partial f}{\partial x}(0,0) = 1. Since 32≠1\tfrac32 \neq 1, ∂f/∂x\partial f/\partial x does not tend to its value at the origin as we approach along y=xy=x, so ∂f/∂x\partial f/\partial x is discontinuous at (0,0)(0,0). 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 ∂f∂xk(c(k))−∂f∂xk(a)\frac{\partial f}{\partial x_k}(c^{(k)}) - \frac{\partial f}{\partial x_k}(a) do not vanish as h→0h\to0, so the proof's key estimate breaks down, matching the failure of differentiability we exhibited directly.

Scope, edge cases & common traps

SituationWhat is trueWhat is not automatically true
All partials exist at aaNothing about continuity or differentiability at aaff need not be continuous at aa (e.g. f=xy/(x2+y2)f=xy/(x^2+y^2))
ff continuous at aa, partials exist at aaStill nothing guaranteed about differentiabilityDirectional limit of difference quotient may depend on direction (Example 2)
Partials exist near aa and continuous at aaff is differentiable at aa (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)
ff differentiable at aaff continuous at aa; unique total derivative; Jacobian formula holdsExistence of the total derivative does not require partials to be continuous everywhere near aa, only that some linear map works at aa itself

The mathematician behind it

Origins · 1 minMaurice René Fréchet and how this was discovered
MR
Maurice René Fréchet
1878–1973 · Founder of the abstract theory of differentiation in normed and metric spaces

Fréchet, a French mathematician trained under Jacques Hadamard, sought a definition of "derivative" general enough to apply not just in Rn\mathbb{R}^n 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 Rn\mathbb{R}^n. 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.

History
- 1872: Karl Weierstrass gives rigorous ε\varepsilon–δ\delta foundations to single-variable calculus, setting the standard of rigor later demanded of multivariable definitions.
- 1893: Otto Stolz gives an early precise formulation of differentiability for functions of two variables via a linear approximation with vanishing relative error.
- 1906: Maurice Fréchet's thesis lays groundwork for abstract metric and normed space analysis, enabling a fully general derivative concept.
- 1911–1913: Fréchet and later authors formalize the derivative of a map between normed vector spaces as a linear operator, the direct source of the modern total derivative.
- 1930s: The total derivative / Jacobian framework becomes standard in analysis textbooks, cementing the modern separation between partial derivatives and true (Fréchet) differentiability.
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 f(x,y)=xy/(x2+y2)f(x,y)=xy/(x^2+y^2) (extended by f(0,0)=0f(0,0)=0) has ∂f/∂x(0,0)=∂f/∂y(0,0)=0\partial f/\partial x(0,0)=\partial f/\partial y(0,0)=0, yet ff is not even continuous at the origin, since f(t,t)=1/2f(t,t)=1/2 for all t≠0t\neq0 while f(0,0)=0f(0,0)=0. 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 Df(a)Df(a) is a linear map Rn→Rm\mathbb{R}^n \to \mathbb{R}^m, an abstract object independent of any choice of coordinates. The Jacobian matrix Jf(a)Jf(a) 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 (i,j)(i,j) entry of the Jacobian is ∂fi/∂xj(a)\partial f_i/\partial x_j(a) — 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 aa is purely a local, pointwise statement about the limiting behavior of ff as h→0h\to 0, and it says nothing directly about points other than aa. It is entirely possible to construct functions differentiable at exactly one point and nowhere else nearby (analogous to one-variable examples like f(x)=x2f(x)=x^2 for rational xx and 00 for irrational xx, 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 f:R2→Rf:\mathbb{R}^2\to\mathbb{R} differentiable at a=(a1,a2)a=(a_1,a_2), the affine function z=f(a)+Df(a)(x−a1,y−a2)z = f(a) + Df(a)(x-a_1,y-a_2), written out using the gradient as z=f(a)+fx(a)(x−a1)+fy(a)(y−a2)z=f(a)+f_x(a)(x-a_1)+f_y(a)(y-a_2), is exactly the classical tangent plane formula. The defining limit condition says the graph of ff and this plane differ by an error that is o(∥h∥)o(\lVert h\rVert), 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 aa) is only a sufficient, not necessary, condition for differentiability at aa. There exist functions, built by scaling oscillatory terms like x2sin⁡(1/x)x^2\sin(1/x) 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 nn exact one-variable statements, and then using continuity of the partials to show the intermediate points can be replaced by aa itself in the limit, reconstructs the full multivariable linear approximation.

What goes wrong if UU is not assumed open in the definition?

Openness of UU guarantees that for every direction vv, the point a+tva+tv lies in UU for all sufficiently small tt, which is what allows the limit defining differentiability, and the uniqueness argument extracting LL from that limit, to make sense in every direction. If aa were a boundary point of UU, some directions might be entirely unavailable near aa, 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 Rn\mathbb{R}^n.

Before this

Where this leads