# Taylor's Expansion Revisited: A General Formula for the Remainder

Authors: José Juan Rodríguez Cano; Enrique de Amo
Journal: International Journal of Mathematics and Mathematical Sciences
 (2012)

---

## Abstract

We give a new approach to Taylor's remainder formula, via a generalization of Cauchy's generalized mean value theorem, which allows us
to include the well-known Schölomilch, Lebesgue, Cauchy, and the Euler
classic types, as particular cases.


---

## Body

## 1. Introduction

Taylor’s polynomial is a central tool in any elementary course in mathematical analysis. Nowadays, its importance is centred on its applications, for instance, to asymptotic analysis or to obtain satisfactory numerical or integral inequalities (see, e.g., [1–5]). The core of these results comes from manipulations on the explicit formula of the remainder, that is, the error estimation when considering the Taylor’s polynomial expansion instead of the function.In this paper, we provide a new explicit formula for the remainder that generalizes classic ones, namely, Schölomilch, Lebesgue, Cauchy, and Euler's remainders.Inspired by the explicit expression for an arbitrary polynomial(1.1)x⟶p(x),∀x∈R,
B. Taylor (1712) used to write
(1.2)p(x)=∑k=0nαk(x-a)k,
where a is a real parameter and the coefficients αk are given by their derivatives of k-order
(1.3)αk∶=p(k)(a)k!,k=0,1,…,n.
Therefore, in a heuristic way, he introduced, three centuries ago, the expression
(1.4)f(x)∶=∑k=0+∞f(k)(a)k!(x-a)k
for an arbitrary function f. Later, but during the same century, A. L. Cauchy gave the name of analytic to a type of functions which stands for their series expansions. (It is well known that Cauchy worked to introduce the concept of convergence of series.)An obvious problem is to calculate the formula for the remainder in an explicit form (not only to know that there exists a polynomialp such that
(1.5)f(x)-p(x)=o(|x-a|n)ifx⟶a,
that is, the function f has a contact of order greater that n in a neighborhood of a point a). It is also well known that this explicit expression provides an upper bound for the error when we consider p instead of f near to a.After Taylor, authors such as Euler, Lagrange, Cauchy, or Scholömilch have considered functions satisfying(1.6)f(x)=∑k=0n‍f(k)(a)k!(x-a)k+R(x),
where R(x) measures the error when it is not possible to represent f in an analytic form (e.g., when f has derivatives up to the n-order, but no further). If a=0, then the above expression is called the McLaurin series of f.In this paper, we are interested in Taylor’s polynomials to obtain a new and more general explicit form for the remainderR(x).In Section3.1, via slight modifications on Cauchy’s general mean value theorem (CGMVT) for functions f with continuous derivatives of order n on [a,b], we obtain a very general expression for each of the corresponding classic expressions for the remainder as particular cases (Section 3.2).


## 2. Notation and Preliminaries

Throughout the paper,ℝ denotes the set of real numbers and ℕ the set of the positive integers, [a,b] is a closed and bounded interval with endpoints a and b, 𝒞n([a,b]) denotes the class of all real functions with continuous derivative of n-order defined on [a,b], and the extreme cases: 𝒞0([a,b])∶=𝒞([a,b])= the class of all continuous functions defined on [a,b] and
(2.1)C∞([a,b])∶={f∈Cn([a,b]):∀n∈N}.
For given f∈𝒞n([a,b]) and x0∈]a,b[, we denote by
(2.2)pf,x0,n(x)∶=∑k=0n‍f(k)(x0)k!(x-x0)k,∀x∈[a,b]
for Taylor’s polynomial of n-order centred at x0 of the function f. For the sake of simplicity, we refer to it as p. A function f is said to be analytic at x0∈]a,b[ if there exists δ>0 such that
(2.3)f(x)∶=∑k=0+∞‍f(k)(x0)k!(x-x0)k,∀x∈]x0-δ,x0+δ[.


## 3. A General Formula for the Remainder

### 3.1. A General Taylor’s Theorem

The classic technique for obtaining Taylor’s polynomial with a remainder that consists of applying a more general result than the CGMVT is widely known.Proposition 3.1 (n-CGMVT).
Letf,g∈𝒞n([a,b]) such that f(n+1) and g(n+1) exist and are continuous on the open interval ]a,b[. Then, there exists ξ∈]a,b[ such that
(3.1)[f(b)-∑k=0n‍f(k)(a)k!(b-a)k]g(n+1)(ξ)=f(n+1)(ξ)[g(b)-∑k=0n‍g(k)(a)k!(b-a)k].Note that with this notation, the CGMVT is the corresponding0-CGMVT. Now, a slight modification in the hypothesis of the above proposition allows a more general statement.Lemma 3.2 (n-m-GMVCT).
Letf∈𝒞n([a,b]) and g∈𝒞m([a,b]). If f(n+1),g(m+1)∈𝒞(]a,b[), then there exists ξ∈]a,b[ such that
(3.2)[f(b)-∑k=0n‍f(k)(a)k!(b-a)k]g(m+1)(ξ)=f(n+1)(ξ)[g(b)-∑k=0m‍g(k)(a)k!(b-a)k].Proof.
We consider auxiliary functions(3.3)F(x)∶=∑k=0n‍f(k)(x)k!(b-x)k,G(x)∶=∑k=0m‍g(k)(x)k!(b-x)k,∀x∈[a,b].
They satisfy the CGMVT for functions in 𝒞1([a,b]). Moreover, we have the following identities:
(3.4)F(b)=f(b),G(b)=g(b),F′(x)=f(n+1)(x)n!(b-x)n,G′(x)=g(m+1)(x)m!(b-x)m.
Therefore, the result immediately follows.Theorem 3.3 (of Taylor).
Letf∈𝒞n([a,b]) and h∈𝒞([a,b]), having no zeros in [a,b] (i.e., h(x)≠0 for all x in [a,b]). Suppose that there exists f(n+1)∈𝒞(]a,b[). Then, there is ξ∈]a,b[ such that
[*]f(x)=∑k=0n‍f(k)(a)k!(x-a)k+f(n+1)(ξ)h(ξ)(x-ξ)n(x-ξ)mm!n!∫ax‍(x-s)mm!h(s)ds.Proof.
Putg:[a,b]→ℝ satisfying the following conditions:
(3.5)g(m+1)(x)∶=h(x)ifa≤x≤b,g(k)(a)=0if0≤k≤m.
Now, using the n-m-CGMVT, we obtain [*].


### 3.2. Particular Cases

In this subsection, we show how the remainder formula[*] can be reduced to each particular case. Firstly, if we define the function h with a constant real value, namely α∈ℝ, then Schölomilch’s version for the remainder follows (see [6]):
[S]R(x)=f(n+1)(ξ)(x-ξ)n(x-ξ)mm!n!(x-a)m+1(m+1)!.
(This formula is usually obtained directly from the n-CGMVT doing g(x)∶=(x-a)n+1, because g(k)(a)=0, 0≤k≤n, and g(n+1)(x)=(n+1)!).Whenn=m in [S], this formula gives the Lagrange remainder type (see [6–9]):
[L]R(x)=f(n+1)(ξ)(n+1)!(x-a)n+1.
Using newly [S], if we do m=0, the Cauchy formula appears for the remainder (see [10]):
[C]R(x)=f(n+1)(ξ)n!(x-ξ)n(x-a).
Now, we return to [*], and putting h(x)∶=f(n+1)(x) and n=m, we obtain Euler’s integral expression (see [11]):
[E]∫ax‍(x-s)nn!f(n+1)(s)ds.
Of course, doing a=0 in [*], we have a general McLaurin type series:
[*-McL]f(x)=∑k=0nf(k)(0)k!xk+f(n+1)(ξ)h(ξ)(x-ξ)n(x-ξ)mm!n!∫0x‍(x-s)mm!h(s)ds.


## 3.1. A General Taylor’s Theorem

The classic technique for obtaining Taylor’s polynomial with a remainder that consists of applying a more general result than the CGMVT is widely known.Proposition 3.1 (n-CGMVT).
Letf,g∈𝒞n([a,b]) such that f(n+1) and g(n+1) exist and are continuous on the open interval ]a,b[. Then, there exists ξ∈]a,b[ such that
(3.1)[f(b)-∑k=0n‍f(k)(a)k!(b-a)k]g(n+1)(ξ)=f(n+1)(ξ)[g(b)-∑k=0n‍g(k)(a)k!(b-a)k].Note that with this notation, the CGMVT is the corresponding0-CGMVT. Now, a slight modification in the hypothesis of the above proposition allows a more general statement.Lemma 3.2 (n-m-GMVCT).
Letf∈𝒞n([a,b]) and g∈𝒞m([a,b]). If f(n+1),g(m+1)∈𝒞(]a,b[), then there exists ξ∈]a,b[ such that
(3.2)[f(b)-∑k=0n‍f(k)(a)k!(b-a)k]g(m+1)(ξ)=f(n+1)(ξ)[g(b)-∑k=0m‍g(k)(a)k!(b-a)k].Proof.
We consider auxiliary functions(3.3)F(x)∶=∑k=0n‍f(k)(x)k!(b-x)k,G(x)∶=∑k=0m‍g(k)(x)k!(b-x)k,∀x∈[a,b].
They satisfy the CGMVT for functions in 𝒞1([a,b]). Moreover, we have the following identities:
(3.4)F(b)=f(b),G(b)=g(b),F′(x)=f(n+1)(x)n!(b-x)n,G′(x)=g(m+1)(x)m!(b-x)m.
Therefore, the result immediately follows.Theorem 3.3 (of Taylor).
Letf∈𝒞n([a,b]) and h∈𝒞([a,b]), having no zeros in [a,b] (i.e., h(x)≠0 for all x in [a,b]). Suppose that there exists f(n+1)∈𝒞(]a,b[). Then, there is ξ∈]a,b[ such that
[*]f(x)=∑k=0n‍f(k)(a)k!(x-a)k+f(n+1)(ξ)h(ξ)(x-ξ)n(x-ξ)mm!n!∫ax‍(x-s)mm!h(s)ds.Proof.
Putg:[a,b]→ℝ satisfying the following conditions:
(3.5)g(m+1)(x)∶=h(x)ifa≤x≤b,g(k)(a)=0if0≤k≤m.
Now, using the n-m-CGMVT, we obtain [*].


## 3.2. Particular Cases

In this subsection, we show how the remainder formula[*] can be reduced to each particular case. Firstly, if we define the function h with a constant real value, namely α∈ℝ, then Schölomilch’s version for the remainder follows (see [6]):
[S]R(x)=f(n+1)(ξ)(x-ξ)n(x-ξ)mm!n!(x-a)m+1(m+1)!.
(This formula is usually obtained directly from the n-CGMVT doing g(x)∶=(x-a)n+1, because g(k)(a)=0, 0≤k≤n, and g(n+1)(x)=(n+1)!).Whenn=m in [S], this formula gives the Lagrange remainder type (see [6–9]):
[L]R(x)=f(n+1)(ξ)(n+1)!(x-a)n+1.
Using newly [S], if we do m=0, the Cauchy formula appears for the remainder (see [10]):
[C]R(x)=f(n+1)(ξ)n!(x-ξ)n(x-a).
Now, we return to [*], and putting h(x)∶=f(n+1)(x) and n=m, we obtain Euler’s integral expression (see [11]):
[E]∫ax‍(x-s)nn!f(n+1)(s)ds.
Of course, doing a=0 in [*], we have a general McLaurin type series:
[*-McL]f(x)=∑k=0nf(k)(0)k!xk+f(n+1)(ξ)h(ξ)(x-ξ)n(x-ξ)mm!n!∫0x‍(x-s)mm!h(s)ds.



---

*Source: 645736-2012-07-09.xml*