Mean value theorem (divided differences)

From testwiki
Revision as of 11:14, 3 July 2024 by imported>Asbjornholk (Changed the somewhat ambiguous wording of "highest term" to "highest order term". Also, while <math>f[x_0,\dots,x_n](x-x_{n-1})\dots(x-x_1)(x-x_0)</math> indeed contains the highest order term <math>x^n</math>, it is not itself the highest order term, so this has been changed as well. This does not meaningfully alter the proof nor its validity, but perhaps makes it more clear.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In mathematical analysis, the mean value theorem for divided differences generalizes the mean value theorem to higher derivatives.[1]

Statement of the theorem

For any n + 1 pairwise distinct points x0, ..., xn in the domain of an n-times differentiable function f there exists an interior point

ξ(min{x0,,xn},max{x0,,xn})

where the nth derivative of f equals n ! times the nth divided difference at these points:

f[x0,,xn]=f(n)(ξ)n!.

For n = 1, that is two function points, one obtains the simple mean value theorem.

Proof

Let P be the Lagrange interpolation polynomial for f at x0, ..., xn. Then it follows from the Newton form of P that the highest order term of P is f[x0,,xn]xn.

Let g be the remainder of the interpolation, defined by g=fP. Then g has n+1 zeros: x0, ..., xn. By applying Rolle's theorem first to g, then to g, and so on until g(n1), we find that g(n) has a zero ξ. This means that

0=g(n)(ξ)=f(n)(ξ)f[x0,,xn]n!,
f[x0,,xn]=f(n)(ξ)n!.

Applications

The theorem can be used to generalise the Stolarsky mean to more than two variables.

References

Template:Reflist