Get AI summaries of any video or article — Sign up free
Multivariable Calculus 16 | Taylor's Theorem thumbnail

Multivariable Calculus 16 | Taylor's Theorem

4 min read

Based on The Bright Side of Mathematics's video on YouTube. If you like this content, support the original creators by watching, liking and subscribing to their content.

TL;DR

The linear approximation near x̃ uses the Jacobian: f(x̃ + h) ≈ f(x̃) + J_f(x̃)·h, with an error Φ(h) satisfying Φ(h)/||h|| → 0.

Briefing

Taylor’s theorem in multivariable calculus generalizes the familiar idea of approximating a smooth function near an expansion point with a polynomial whose coefficients come from derivatives. The practical payoff is that, for a function f: R^n → R (or more generally between Euclidean spaces), values near x̃ can be approximated by a kth-order Taylor polynomial in the displacement h, with a remainder term that quantifies how the approximation error shrinks as h → 0.

The construction starts with the linear approximation. For a small shift from the expansion point x̃ to x̃ + h, differentiability yields a first-order estimate: f(x̃ + h) is approximately f(x̃) plus a linear map applied to h. In multivariable form, that linear map is represented using the Jacobian matrix J_f, so the linear term becomes the matrix-vector product J_f(x̃)·h. The quality of this approximation is measured by an error term Φ(h) that satisfies Φ(h)/||h|| → 0 as ||h|| → 0, ensuring the error is of smaller order than the linear part.

Next comes the quadratic approximation, where the second-order behavior is captured by a polynomial involving second partial derivatives. The quadratic term uses the Hessian matrix H (often denoted with a capital H), and the displacement h enters twice through the bilinear form h^T H h. As with the linear case, a remainder term Ψ(h) accounts for the leftover error, with the requirement that Ψ(h)/||h||^2 → 0 as ||h|| → 0 so the quadratic approximation improves at the expected rate.

With these pieces in place, the full kth-order Taylor theorem is stated under smoothness assumptions: if f has continuous partial derivatives up to order k+1 (written as f ∈ C^{k+1}(R^n)), then for x̃ and h in R^n, f(x̃ + h) equals the kth-order Taylor polynomial T_k(x̃, h) plus a remainder term R_k. The Taylor polynomial is expressed using multi-index notation. For each multi-index α with |α| ≤ k, the coefficient involves the partial derivative D^α f evaluated at x̃, divided by α!; the corresponding term multiplies by h^α, where h^α denotes the product of the components of h raised to the powers given by α. Summing over all such α produces a polynomial whose highest degree is k.

The remainder term R_k has a “last-order derivatives” structure similar in form to the polynomial itself, but it uses derivatives of order k+1 evaluated at an intermediate point c. That point c lies on the line segment between x̃ and x̃ + h, generalizing the one-dimensional intermediate-point idea. When n = 1, the multivariable statement collapses back to the standard Taylor theorem from real analysis, confirming the consistency of the generalization. The next step is to work through examples to make these formulas concrete.

Cornell Notes

Multivariable Taylor’s theorem approximates f(x̃ + h) by a polynomial in h whose coefficients come from partial derivatives of f at the expansion point x̃. Under the smoothness condition f ∈ C^{k+1}(R^n), the approximation takes the form f(x̃ + h) = T_k(x̃, h) + R_k, where T_k is the kth-order Taylor polynomial and R_k is a remainder term that becomes small as ||h|| → 0. The polynomial uses multi-index notation: terms look like (D^α f(x̃)/α!) h^α summed over all multi-indices α with |α| ≤ k. The remainder R_k depends on (k+1)st-order derivatives evaluated at an intermediate point c on the line segment between x̃ and x̃ + h. This framework matches the one-variable Taylor theorem when n = 1.

How does the linear approximation of f(x̃ + h) look in multivariable calculus, and what controls its accuracy?

The linear approximation is f(x̃ + h) ≈ f(x̃) + J_f(x̃)·h, where J_f is the Jacobian matrix and the term J_f(x̃)·h is the matrix-vector product. Accuracy is measured by an error term Φ(h) such that Φ(h)/||h|| → 0 as ||h|| → 0, meaning the leftover error shrinks faster than the linear scale ||h||.

What role does the Hessian matrix play in the quadratic approximation?

The quadratic approximation uses the Hessian matrix H of second partial derivatives. The second-order term is written as h^T H h, which is a scalar bilinear form capturing curvature in all directions. The associated remainder Ψ(h) satisfies Ψ(h)/||h||^2 → 0 as ||h|| → 0, so the error becomes negligible compared with the quadratic scale ||h||^2.

What smoothness condition is required to state the kth-order Taylor theorem in R^n?

The theorem assumes f has continuous partial derivatives up to order k+1, summarized as f ∈ C^{k+1}(R^n). This ensures the derivatives needed for both the kth-order polynomial and the (k+1)st-order remainder term exist and behave continuously.

How is the kth-order Taylor polynomial written using multi-index notation?

The Taylor polynomial is T_k(x̃, h) = Σ_{|α|≤k} (D^α f(x̃)/α!) h^α. Here α is a multi-index, D^α denotes the corresponding mixed partial derivative, α! is the product of factorials of the components of α, and h^α means ∏ h_i^{α_i}. The sum over all |α| ≤ k guarantees the highest degree in h is k.

Where is the intermediate point c located in the remainder term, and why does that matter?

In the remainder term R_k, the (k+1)st-order derivatives are evaluated at an intermediate point c that lies on the line segment between x̃ and x̃ + h. Concretely, c is on the path x̃ + t h for some t between 0 and 1. This mirrors the one-dimensional “between the endpoints” idea and determines where the higher-order behavior is sampled.

Review Questions

  1. In the multivariable linear approximation, what condition must the error term Φ(h) satisfy relative to ||h||?
  2. Write the general form of the kth-order Taylor polynomial T_k(x̃, h) using multi-index notation, including the roles of D^α f(x̃), α!, and h^α.
  3. In the remainder term R_k, what is the geometric description of the intermediate point c relative to x̃ and x̃ + h?

Key Points

  1. 1

    The linear approximation near x̃ uses the Jacobian: f(x̃ + h) ≈ f(x̃) + J_f(x̃)·h, with an error Φ(h) satisfying Φ(h)/||h|| → 0.

  2. 2

    The quadratic approximation uses the Hessian: the second-order term is h^T H h, with remainder Ψ(h) satisfying Ψ(h)/||h||^2 → 0.

  3. 3

    A kth-order Taylor theorem in R^n requires f ∈ C^{k+1}(R^n), ensuring derivatives up to order k+1 exist and are continuous.

  4. 4

    The kth-order Taylor polynomial is built from multi-indices: T_k(x̃, h) = Σ_{|α|≤k} (D^α f(x̃)/α!) h^α.

  5. 5

    The remainder term R_k depends on (k+1)st-order derivatives evaluated at an intermediate point c on the line segment between x̃ and x̃ + h.

  6. 6

    When n = 1, the multivariable formulation reduces to the standard one-variable Taylor theorem from real analysis.

Highlights

The quadratic term in multivariable Taylor expansions is the Hessian bilinear form h^T H h, capturing curvature in every direction.
Taylor polynomials in multiple variables are compactly expressed with multi-index notation: Σ_{|α|≤k} (D^α f(x̃)/α!) h^α.
The remainder uses derivatives of order k+1 evaluated at a point c lying between x̃ and x̃ + h, generalizing the one-dimensional intermediate-point idea.

Topics

  • Taylor's Theorem
  • Multivariable Approximation
  • Jacobian Linearization
  • Hessian Quadratic Term
  • Multi-Index Notation