Continuously Differentiable Functions of Many Variables
A function is called (continuously differentiable) if all partial derivative functions exist and are continuous everywhere on the domain.
This is a stronger condition than merely having all partial derivatives exist. A function can have all partial derivatives at a point without being differentiable or even continuous there — but if the partial derivatives are continuous near a point, then is automatically differentiable (and in fact has a well-defined local linear approximation) at that point.
The set of all functions on a domain forms a vector space. Compositions, sums, products, and quotients (away from zeros) of functions are . This makes the class much easier to work with in practice than the bare "differentiable" class.
Formal View
The converse is false: a function can be differentiable without having continuous partial derivatives.
Why This Matters
The class is the standard regularity assumption in optimization theory and numerical analysis.
- Guaranteeing gradient descent converges by ensuring gradients vary smoothly
- Applying the inverse function theorem and implicit function theorem (both require )
- Ensuring that numerical differentiation (finite differences) converges to the true gradient
Quiz
If all partial derivatives of exist at a point, then is at that point.
Which condition is the strongest?
Common Mistakes
- Confusing "all partials exist" with "" — existence is much weaker than continuity of the partials.
- Thinking and differentiability are the same — is strictly stronger.
- Forgetting that the implication goes one way: gives differentiability, but differentiability does not give .