Taylor expansion in several variables
A single-variable Taylor series rebuilds a function near a point from its ordinary derivatives: . The moment a function depends on two variables, , the same idea survives almost unchanged — you just replace ordinary derivatives with partial derivatives, and the algebra of "how many ways can I distribute the increment between and " turns into a binomial-style pattern involving , , , , , and so on. This matters immediately in MA10001: the second-order Taylor terms about a point are exactly the ingredients of the discriminant test used in the very next topic to classify a critical point as a maximum, minimum, or saddle. Getting comfortable assembling the expansion here pays off directly there.
Near , is approximated by plus a linear term built from plus a quadratic term built from , all evaluated at — the two-variable analogue of the single-variable Taylor series.
The core idea
Set-up. Let and be the increments away from the expansion point . Assuming has continuous partial derivatives up to the needed order near , the full Taylor expansion is
where: are first partial derivatives, are second partial derivatives (with by equality of mixed partials for well-behaved ), and every derivative on the right is evaluated at the fixed base point , not at the moving point .
The compact operator form. Writing , the whole series is
where: the -th term is expanded formally as a binomial power with , then applied as a differential operator to . This is why the term picks up the binomial coefficient on the mixed derivative: , not .
The truncated form actually used. In MA10001 you almost always stop at second order:
Keeping only the first-order terms reproduces the familiar tangent-plane linear approximation from the total differential; adding the second-order terms captures the local curvature of the surface, which is exactly the information the discriminant test needs.
Maclaurin case. When , the same formula is called the two-variable Maclaurin expansion, directly paralleling in one variable.
Why bother with a two-variable version at all. A function of two variables cannot, in general, be evaluated exactly at every nearby point without repeating the (possibly hard) full calculation — the Taylor expansion lets you do all the hard work once, at a single convenient base point, and then reuse that derivative data to approximate cheaply at many nearby points, which is exactly what the worked example below does.
Second-order Taylor expansion for two variables
The goal, given all first and second partial derivatives of at a base point , is to assemble the second-order Taylor approximation correctly, with every term evaluated at and the binomial coefficient correctly placed on the mixed term.
Step 1. Start from the one-variable Taylor idea applied along the straight line for , so gives the base point and gives the target point . Define ; then and is exactly the value we want.
Step 2. Expand as an ordinary single-variable Maclaurin series in : , then set so that .
Step 3. Differentiate using the chain rule for two variables: , so — this produces the first-order term.
Step 4. Differentiate again: (using ), all evaluated along the line, so — this is exactly where the factor on the mixed term comes from, since both the and contributions collapse into one term.
Step 5. Substitute back into to recover , the second-order Taylor expansion.
Worked example
Expand about up to second order and use it to approximate .
Step 1. Compute and every needed partial derivative, then evaluate at : ; ; ; ; ; .
Step 2. Write the increments for the target point : , .
Step 3. Assemble the second-order approximation:
Step 4. Substitute the numbers: . So , computed entirely from derivative information at , without directly evaluating the (harder-to-handle-by-hand) original expression at the target point.
Competitive stretch
The Maclaurin case is worth memorizing as a shortcut: for about , the same machinery gives , , , , , , so the second-order Maclaurin approximation is near the origin — matching the product of the known one-variable series kept to total degree , a fast sanity check worth running whenever the base point is the origin.
Common traps
- Dropping the factor of on the mixed term. The correct second-order term is ; forgetting the multiplying is the single most common slip.
- Evaluating derivatives at the wrong point. Every partial derivative in the formula is evaluated at the fixed base point , never at the target point — mixing these up produces nonsense answers.
- Getting the sign of or wrong. If the target point lies "before" the base point in a coordinate, that increment is negative; a sign slip here silently corrupts every later term.
- Truncating inconsistently. Once you commit to "second order," every first- and second-order term must appear; dropping one because it looks small changes the accuracy in an uncontrolled way.
Ask the tutor: if assembling the second-order Taylor terms feels error-prone, or you want to see how this connects to the upcoming maxima/minima discriminant test, ask the AI tutor to walk through it step by step.
Why does the mixed second-order term get a factor of 2 but the pure terms h squared f xx and k squared f yy do not?
Because there is only one way to differentiate purely with respect to twice, or purely with respect to twice, but there are two equivalent routes to the mixed partial — differentiate with respect to then , or then — and since for well-behaved functions, those two equal contributions add up to give the coefficient . It is exactly the same reason the middle term of carries a factor of : the expansion is a binomial power in disguise, applied to derivatives instead of numbers.
Do I need to memorize the full infinite series, or is the second-order truncation enough for this course?
For MA10001 the second-order truncation is what you are expected to use and compute confidently; the full infinite operator series is there mainly so you understand where the pattern comes from and can extend it if a problem explicitly asks for a third-order term. In practice, almost every application here — local approximation, and the discriminant test for maxima and minima that follows this topic — only needs terms up to the quadratic ones, so memorize the second-order formula cold and treat the general series as background understanding.
How is this connected to the maxima and minima test coming up next?
The exact same second partial derivatives evaluated at a critical point are what feed the discriminant used to classify that point as a local maximum, local minimum, or saddle. The Taylor expansion is the reason that test works: near a critical point the first-order terms vanish, so the local behaviour of is governed entirely by the sign pattern of the quadratic (second-order) part of its Taylor expansion, which is precisely what the discriminant reads off.