Multivariable approximation
Read tangent planes as first-order models and construct higher-order Taylor polynomials.
This page reads the tangent plane as the first-order Taylor approximation of a function and then adds terms of higher degree. The tangent plane captures change that is linear in the displacement from the base point. It is usually enough for a nearby estimate, but a higher-order Taylor polynomial is needed when the first-order change cancels or when curvature controls the error.
The construction extends the one-variable Taylor polynomial: the term becomes the quadratic form , so the Hessian is the multivariable curvature matrix.
Linear approximation and the tangent-plane model
Approximate a function linearly
For a differentiable and a base point , approximate nearby values by
To use the approximation, evaluate and its first partial derivatives at , then substitute the displacement .
The expression is the equation of the tangent plane with the output written as a function of the input. Differentiability means that the omitted error, divided by , tends to zero as . Thus one linear model works for changes in every direction, not just along the coordinate axes.
Linearise
Let
At ,
so
The tangent-plane approximation is
Thus, close to ,
Writing and shows exactly what the linear model omits:
The approximation keeps the constant and first-degree terms and discards the quadratic error . This also shows why the estimate improves faster than the displacement as .
[routine]
Higher-order terms record curvature
To record curvature and interactions between coordinate changes, we keep monomials up to a chosen total degree and collect the second-order derivatives in a matrix.
Total degree
The total degree of the monomial is . The total degree of a polynomial is the largest total degree among its monomial terms.
For example, in
the term has total degree , so . This is the degree used when deciding which terms belong in a multivariable Taylor polynomial.
Hessian matrix
For , the Hessian at is
When the mixed partials are continuous, , so the Hessian is symmetric. It records the second-order changes omitted by the linear approximation and its determinant classifies stationary points through the quadratic part of the local Taylor model.
Taylor polynomial through degree three
Let , and . If has continuous partial derivatives through order three near , its Taylor polynomial through total degree three is
The degree-two part can be written with the Hessian as
The quadratic and cubic parts refine the tangent-plane model by the terms of total degree two and three.
To see where the mixed coefficients come from, apply the one-variable Taylor formula to . Then ; the two mixed terms arise by differentiating once in each coordinate. The cubic coefficients count the three orders in which two -derivatives and one -derivative can occur, or vice versa.
Under the stated assumption, the omitted remainder satisfies
If is near , the remainder improves to for sufficiently small .
Construct multivariable Taylor polynomials
Construct a multivariable Taylor polynomial
To construct the Taylor polynomial through degree about :
- choose the centre and the required total degree;
- calculate the partial derivatives through that order;
- evaluate them at ;
- retain the terms through total degree in the formula above.
The result agrees with at and matches the relevant partial derivatives there. It is a local approximation, not generally an identity on the whole domain.
near the origin
Let
Set . The one-variable exponential expansion in gives
Each power has total degree , so truncating the series in after keeps exactly the terms of total degree at most three.
[routine]
A function that is already a polynomial
For
the function has total degree three. Hence its Taylor polynomial through degree three about is exact:
The derivative construction gives the same result: all lower-degree terms vanish at the origin and the third-order term reproduces .
[routine]
An exponential of three variables
For
near , set . The degree-two Taylor polynomial is
The total degree counts the total number of factors drawn from all coordinate increments, so the same construction works in any number of variables.
[routine]
Like the one-variable Taylor polynomials, this construction matches derivatives at one centre; interpolation instead matches values at distinct nodes. When the gradient vanishes, the quadratic part above becomes the leading term that classifies stationary points.