Why a line segment matters
A derivative is local information. To compare values at two points or quantify an approximation, join the points by a segment and apply one-variable calculus to the resulting composite. The segment must remain inside the domain; a derivative bound on a disconnected domain alone gives no comparison between components. In this unit , is scalar-valued unless stated otherwise, and denotes the entire segment.
Mean value theorem and estimates
Theorem
One-dimensional mean value theorem
If is continuous on and differentiable on , some satisfies .
For differentiable on an open set containing , set . The chain rule gives
for some . In particular, if on the segment, then
The same-point equality above is a scalar theorem. Do not assume that one common intermediate point gives for a vector-valued ; its components may require different intermediate points. A bound along the segment does imply , for example by integrating when is .
Proof
Scalar segment estimate
The composition is continuous on and differentiable inside. Apply the one-variable theorem and chain rule, then Cauchy–Schwarz. A uniform gradient bound over a convex domain therefore makes Lipschitz there, because every joining segment stays inside.
Worked example
A bound without finding an intermediate point
Let on . Here , so . For and , the entire segment is in the square and
The bound is safe, not necessarily sharp; it also avoids assuming a specific intermediate point.
Taylor polynomials
Definition
Hessian and second-order Taylor polynomial
For a function near , its Hessian is . Writing the displacement as , the second-order Taylor polynomial at is
In two variables , the quadratic term is with derivatives evaluated at .
Theorem
Second-order Taylor expansion
If is near , then, as ,
If is on a neighbourhood of the segment, then for some the remainder equals , where . In particular, if along the segment, its absolute value is at most .
The Hessian is symmetric because mixed second partials agree under the hypothesis. For the third derivative, is a sum over indices of ; a bound on each coordinate derivative needs the corresponding sum accounted for. The little- result asserts the error divided by tends to zero. The stronger cubic estimate requires additional control. Neither statement by itself says the full Taylor series converges to the function.
Proof
Reduce to one variable
With , the chain rule gives and . Apply one-variable Taylor's theorem to . For the little- form, continuity of the Hessian makes the quadratic error uniformly small as ; for the Lagrange remainder use the hypothesis and the one-variable third derivative formula.
Worked example
Quadratic approximation and a rigorous error bound
For at , , , and . Hence
Take . The approximation is . Along , . Since is the real part of ,
Thus . The approximation and the bound are different objects: the actual error can be much smaller.
Taylor series versus a finite Taylor polynomial
For smooth near , one can formally assemble its derivatives into Taylor polynomials of every order. The resulting series represents at a particular point only if its remainders tend to zero there. Infinite differentiability alone does not ensure this: define for and . All derivatives at zero vanish, yet when . Its Taylor series at zero is identically zero and does not equal away from zero. This one-variable example also defines a multivariable counterexample by ignoring the other coordinates.
Choosing a method
- Compare two values: use the segment mean value estimate when a gradient bound is available and the segment stays in the domain.
- Predict a small change: use the linear term if only first-order accuracy is needed; use the Hessian when curvature or second-order accuracy matters.
- Certify numerical error: prove a remainder bound, not just a displayed approximation.
- Classify a stationary point: use the quadratic form and its definiteness, with the hypotheses and inconclusive cases explained in the next unit.
Practice
- On , show that is Lipschitz and find a valid constant using the gradient.
- Find at for , and use it to approximate .
- Explain why is not equal to its second-order Taylor polynomial at the origin, although the polynomial is a valid second-order approximation.
- Let on . Show that no satisfies , even though the scalar mean value theorem holds for each component separately.
Full solutions
- , so its norm is at most on the square. The square is convex, so the segment estimate gives .
- At the base point, , and . With , . At this is .
- The value, gradient and Hessian at zero all vanish, so . The difference is , which is not identically zero but satisfies .
- , while . The first coordinate forces , but the second then gives . The scalar components require different intermediate points.
Synthesis
The chain rule transports a multivariable problem onto a segment. The mean value theorem controls a finite change; the Taylor polynomial refines the local linear approximation by retaining curvature. Every conclusion depends on the domain and regularity assumptions, and the quality of a numerical approximation is a separate question from the polynomial formula.