Module 30: Taylor approximation, series, and remainder control
On this page
- A. Prerequisites and observable goals
- B. The central idea: match a function’s local derivative data
- C. A theorem that quantifies what is omitted
- D. Why the coefficients have factorial denominators
- E. A practical approximation procedure
- F. Worked examples
- Computing bridge: Local polynomial models and controlled extrapolation
- G. Independent practice
- H. Complete solutions: Module 30
- I. Retention and readiness
A. Prerequisites and observable goals#
Higher derivatives, power series, factorials, and error bounds.
Construct Taylor polynomials, distinguish approximation from equality to an infinite series, and choose a justified remainder bound.
B. The central idea: match a function’s local derivative data#
A tangent line matches a function’s value and first derivative at one input. A Taylor polynomial matches more derivatives:
The center is ; gives a Maclaurin polynomial. The polynomial is an exact algebraic object. Its use as is an approximation that needs an error discussion. The infinite Taylor series equals only where its remainders tend to zero.
C. A theorem that quantifies what is omitted#
If has continuous derivatives through order on an interval containing and , Taylor’s theorem gives
for some intermediate when . Therefore if throughout the intervening interval,
The unknown is not a freely selected point and is not generally the endpoint. The notation , used later in the solutions, means a remainder whose magnitude is at most for some fixed constant in a neighborhood of . It abbreviates a bound, not a claim that the remainder is zero. This is the Lagrange remainder form under convenient sufficient hypotheses. [O2Taylor]
Useful Maclaurin series are
valid for all real . The logarithmic series is for , with endpoint value justified separately. The geometric series has . Substituting into these identities requires checking their resulting domains.
D. Why the coefficients have factorial denominators#
At the center, derivatives of vanish until the th derivative, which equals . Thus a coefficient contributes to the th derivative at . To match , one must choose . The coefficients are forced by derivative matching, not guessed to fit a plotted curve.
The remainder theorem can be proved using repeated Rolle-type reasoning or repeated integration of the fundamental theorem. It isolates the first derivative order not already matched by the polynomial. For sine and cosine, derivatives stay bounded by one, while factorial denominators beat fixed powers; hence the remainders tend to zero. Smoothness alone is insufficient in general. The optional example for , , has all derivatives zero at zero but is positive elsewhere. Its Taylor series is identically zero, so it does not represent the function away from the center.
E. A practical approximation procedure#
Choose a center with easy derivative values near the desired input. Build enough terms to meet the requested order, noting that a degree-three polynomial may have no cubic term. Choose an error method: Lagrange’s bound for a derivative-controlled interval, an alternating next-term bound when its hypotheses hold, or a geometric remainder for a geometric expansion. Keep exact expressions until the end and distinguish the certified error from the actual observed error. To evaluate a limit, enough leading terms plus a remainder estimate can justify which terms dominate.
F. Worked examples#
A logarithmic estimate. Using , the three-term polynomial gives . The alternating remainder magnitude is at most , and the next term is negative, so this is an overestimate. The decimal itself is not an accuracy guarantee; the omitted-tail theorem is.
A shifted polynomial. For at , , , and . Hence . The quadratic coefficient is , not just .
Computing bridge: Local polynomial models and controlled extrapolation#
A Taylor polynomial is a local model whose domain of useful accuracy depends on the omitted terms. It can support finite-difference error estimates, local optimization, or a small-motion approximation, but it is not automatically reliable far from its center. In A05, truncation error competes with floating-point error; in T05, discretization error accumulates over time. The transferable habit is to state a region, an error measure, and a bound or convergence experiment before trusting a polynomial surrogate.
G. Independent practice#
F foundation C standard course work T transfer S optional stretch L runnable lab or project. Attempt the complete set before opening its solutions.
Find the degree-four Maclaurin polynomial for .
Use to estimate and give a bound using the first omitted nonzero term.
Find the degree-three Taylor polynomial of about . Bound its error at using Lagrange’s form.
Use the sine series to evaluate , explaining why the remainder disappears.
Choose a sufficient degree to approximate by its degree- Maclaurin polynomial with error below , using on .
Find a series for and use its first three nonzero terms to approximate . Bound the error by an alternating term.
Find the degree-two Taylor polynomial of at , and use it to estimate .
Explain why matching every derivative at a point need not imply two smooth functions agree near that point. For the flat function described above, justify directly and describe why its higher derivatives also vanish.
Optional small hints
For M30.03, . For M30.04, use a sine expansion through degree five with a higher-order remainder. For M30.06, integrate the series term by term on an interval strictly within its infinite radius.
H. Complete solutions: Module 30#
Compare the first step where your work differs. A corrected answer is not yet an independent success.
M30.01Show solution
Substitute into a known entire series
From , put . The polynomial is
The degree counts powers of , not how many terms were written. The exponential equals its infinite series, while this finite polynomial is an approximation away from zero.
Back to M30.01M30.02Show solution
Use the first omitted nonzero term
The estimate is . The cosine series at this input alternates with decreasing magnitudes, so the error is at most . The next term is positive, so the true cosine lies between and . Treating the zero cubic coefficient as a zero error would be invalid.
Back to M30.02M30.03Show solution
A derivative bound across the whole interval
At , the first three derivatives are and the value is zero. Thus . On , . The remainder at is bounded by . The polynomial value is . The bound, not the number of displayed decimals, specifies its guaranteed accuracy.
Back to M30.03M30.04Show solution
Cancellation exposes the first surviving term
Taylor’s theorem gives near zero; the bound follows from bounded sine/cosine derivatives using the degree-six polynomial. Subtracting the displayed linear and cubic terms leaves . Division by for gives . The remainder statement justifies dropping higher powers rather than treating an approximation as an exact equality.
Back to M30.04M30.05Show solution
Solve a factorial error inequality
The bound is . At it is , too large. At it is , below the target. Therefore is a sufficient degree using this bound. No claim is made that the actual degree-five error necessarily exceeds the target without calculating it.
Back to M30.05M30.06Show solution
Substitute, multiply, integrate, then bound the new series
The representation is , valid for all real . Integrating the first three terms gives
The integrated series alternates with decreasing magnitudes. Its next term magnitude is . It is negative, so the estimate is above the true integral. The validity of termwise integration follows from convergence on this compact interval inside the infinite radius.
Back to M30.06M30.07Show solution
A shifted geometric pattern provides a check
For , , , and . Thus . At , this gives . Independently, has a geometric expansion whose first three terms match this polynomial. The exact reciprocal is , so the observed error is about .
Back to M30.07M30.08Show solution
Infinite smoothness is not analyticity
For the flat function, the difference quotient at zero is . Its magnitude tends to zero because exponential decay in dominates the power ; hence . Away from zero, repeated derivatives have the form a polynomial in times . Every such expression tends to zero as , and its divided-by- versions do too, allowing an induction that all derivatives at zero exist and vanish. Thus its Taylor coefficients agree with the zero function’s coefficients, but for . Derivative matching alone is not equality to the Taylor series; the remainder must tend to zero at the input in question.
Back to M30.08I. Retention and readiness#
Revisit M13.01, M23.03, and M29.08. Explain whether a displayed equality is a finite polynomial identity, a convergent infinite-series identity, or an approximation with a remainder. Advance when you can justify how many terms are enough for a requested accuracy.