Suppose f has n+1 continuous derivatives on an interval containing a and x. If
Pn(x)=k=0∑nk!f(k)(a)(x−a)k,
then
f(x)=Pn(x)+Rn+1(x),
where the integral remainder is
Rn+1(x)=n!1∫axf(n+1)(t)(x−t)ndt.
For x=a, there is also a point c between a and x for which the Lagrange remainder is
Rn+1(x)=(n+1)!f(n+1)(c)(x−a)n+1.
The integral form accumulates the first omitted derivative. The Lagrange form replaces the
integral by one unknown derivative value. If
∣f(n+1)(t)∣≤M
throughout the interval between a and x, then
∣f(x)−Pn(x)∣=∣Rn+1(x)∣≤(n+1)!M∣x−a∣n+1.
The bound depends on the distance ∣x−a∣ from the centre and the size of the first omitted
derivative. The factorial often dominates the numerator for large n, but this must be
checked for the interval and degree in use.
The t=x endpoint vanishes because (x−x)k=0 and the penultimate line
uses the induction hypothesis Rk(x)=f(x)−Pk−1(x). Each induction step
removes one Taylor term, which proves the integral form for every n.
To obtain the Lagrange form, apply the mean value theorem for integrals to the continuous
function f(n+1) with the non-negative weight ∣x−t∣n between a and x.
Accounting for the orientation when x<a gives
∫axf(n+1)(t)(x−t)ndt=f(n+1)(c)(x−a)n+1/(n+1) for some intermediate c.
To prove that Pn(x) approximates f(x) within a tolerance ε:
identify f(n+1);
find a bound M for ∣f(n+1)(t)∣ between a and the relevant values of x;
use
∣f(x)−Pn(x)∣≤(n+1)!M∣x−a∣n+1;
choose n or the interval so that the right-hand side is at most ε.
The estimate is uniform on an interval when one M and one distance bound work throughout
that interval. It bounds the error from above; it is not the actual error.
At a stationary point the linear term vanishes, so the first nonzero higher derivative
decides whether values rise, fall or change sign on each side. The remainder is of strictly
higher order, so close to the centre it is too small to reverse that sign.
if k is odd, the leading term changes sign across a, giving a horizontal point of
inflection.
Here O(∣x−a∣k+1) means an error bounded by a constant times
∣x−a∣k+1 near a and o(∣x−a∣k) means an error whose ratio to ∣x−a∣k
tends to zero.
The test requires k≥2, a genuinely first nonzero derivative and enough continuity
to ensure that the remainder is o(∣x−a∣k). If all derivatives examined vanish,
those terms give no classification.
because the lower-order terms vanish. Since f(k+1) is continuous near a, it is
bounded on a smaller neighbourhood, so the remainder estimate gives
Rk+1(x)=O(∣x−a∣k+1) and hence
Rk+1(x)=o(∣x−a∣k). Therefore the first nonzero term determines
the sign of f(x)−f(a) sufficiently close to a.
When k is even, (x−a)k is positive on both sides of a, so the sign of
f(k)(a) determines a minimum or maximum. When k is odd, then k≥3 and the
same expansion applied to f′′ gives
f′′(x)=(k−2)!f(k)(a)(x−a)k−2+o(∣x−a∣k−2).
Since k−2 is odd, f′′ changes sign across a; together with f′(a)=0, this gives
a horizontal point of inflection.
Suppose m≥1, f and g are m times differentiable near a,
f(j)(a)=g(j)(a)=0 for 0≤j<m and
f(m)(a),g(m)(a)=0. Then
x→alimg(x)f(x)=g(m)(a)f(m)(a).
The leading expansions are
f(x)=m!f(m)(a)(x−a)m+o((x−a)m),
and
g(x)=m!g(m)(a)(x−a)m+o((x−a)m).
The common power (x−a)m cancels in the quotient. This explains why repeated L'Hôpital
differentiation can work, but the hypotheses of that rule must still be checked.
For a fixed x, the Taylor polynomials of degree 0,1,2,… form a sequence of approximations. Two questions decide its limit: the convergence tests settle whether the series converges and the remainder decides whether the sum is f(x). The Taylor series page combines the two and power series adds termwise calculus inside the radius.