Math 2.0

Approximations and expansions Proof

Proof of Taylor's theorem with the Lagrange remainder by the Cauchy mean value theorem

Builds on Taylor polynomialCauchy mean value theoremHigher derivativeOne-sided derivativeDifferentiable functions are continuousProduct rulePower ruleChain rule

Proof

We expand f(x)f(x) around a moving point tt and apply the Cauchy mean value theorem in tt.

  1. Let α<β\alpha < \beta be the endpoints of JJ, so {α,β}={a,x}\set{\alpha, \beta} = \set{a, x}. The hypothesis means that f,f′,…,f(k)f, f', \dots, f^{(k)} exist on JJ, with one-sided derivatives at α\alpha and β\beta.
  2. For t∈Jt \in J define F(t)=∑j=0kf(j)(t)j!(x−t)jF(t) = \sum_{j=0}^{k} \dfrac{f^{(j)}(t)}{j!} (x - t)^j and G(t)=(x−t)k+1G(t) = (x - t)^{k+1}.
  3. For j<kj < k, f(j)f^{(j)} is differentiable on JJ, so it is continuous on JJ. Inside JJ this is differentiability implies continuity.
  4. At an endpoint, write f(j)(s)−f(j)(α)=(s−α)⋅f(j)(s)−f(j)(α)s−αf^{(j)}(s) - f^{(j)}(\alpha) = (s - \alpha) \cdot \dfrac{f^{(j)}(s) - f^{(j)}(\alpha)}{s - \alpha}. The quotient has a finite limit, so the product tends to 00. The endpoint β\beta is similar.
  5. Also f(k)f^{(k)} is continuous on JJ by hypothesis. So FF and GG are continuous on JJ, as sums of products of continuous functions.
  6. By the power rule and the chain rule, ddt(x−t)jj!=−(x−t)j−1(j−1)!\dfrac{d}{dt} \dfrac{(x - t)^j}{j!} = -\dfrac{(x - t)^{j-1}}{(j-1)!} for j≥1j \ge 1. Also G′(t)=−(k+1)(x−t)kG'(t) = -(k + 1)(x - t)^k.
  7. For 0≤j≤k0 \le j \le k and t∈(α,β)t \in (\alpha, \beta) let Aj(t)=f(j+1)(t)j!(x−t)jA_j(t) = \dfrac{f^{(j+1)}(t)}{j!} (x - t)^j. This uses the hypothesis that f(k+1)f^{(k+1)} exists on (α,β)(\alpha, \beta).
  8. By the product rule and step 6, the jj-th term of FF has derivative Aj−Aj−1A_j - A_{j-1} for j≥1j \ge 1. The term with j=0j = 0 is ff, with derivative A0A_0.
  9. Adding, the sum telescopes: F′(t)=A0+∑j=1k(Aj−Aj−1)=Ak=f(k+1)(t)k!(x−t)kF'(t) = A_0 + \sum_{j=1}^{k} (A_j - A_{j-1}) = A_k = \dfrac{f^{(k+1)}(t)}{k!} (x - t)^k on (α,β)(\alpha, \beta).
  10. By the Cauchy mean value theorem, there is ξ∈(α,β)\xi \in (\alpha, \beta) with (F(β)−F(α))G′(ξ)=(G(β)−G(α))F′(ξ)(F(\beta) - F(\alpha)) G'(\xi) = (G(\beta) - G(\alpha)) F'(\xi).
  11. Exchanging α\alpha and β\beta multiplies both sides by −1-1. So (F(x)−F(a))G′(ξ)=(G(x)−G(a))F′(ξ)(F(x) - F(a)) G'(\xi) = (G(x) - G(a)) F'(\xi), and ξ\xi lies strictly between aa and xx.
  12. At t=xt = x, every term of FF with j≥1j \ge 1 vanishes, so F(x)=f(x)F(x) = f(x). At t=at = a, F(a)=Pk(x)F(a) = P_k(x), the value at xx of the Taylor polynomial of ff at aa.
  13. Also G(x)=0G(x) = 0 and G(a)=(x−a)k+1G(a) = (x - a)^{k+1}.
  14. Substituting steps 6, 9, 12 and 13 into step 11 gives −(k+1)(x−ξ)k(f(x)−Pk(x))=−(x−a)k+1f(k+1)(ξ)k!(x−ξ)k-(k + 1)(x - \xi)^k (f(x) - P_k(x)) = -(x - a)^{k+1} \dfrac{f^{(k+1)}(\xi)}{k!} (x - \xi)^k.
  15. Since ξ≠x\xi \ne x, we have (x−ξ)k≠0(x - \xi)^k \ne 0. Dividing by −(k+1)(x−ξ)k-(k + 1)(x - \xi)^k gives f(x)=Pk(x)+f(k+1)(ξ)(k+1)!(x−a)k+1f(x) = P_k(x) + \dfrac{f^{(k+1)}(\xi)}{(k + 1)!} (x - a)^{k+1}.

Idea

The function F(t)F(t) is the Taylor polynomial of degree kk at tt, evaluated at xx. It moves from Pk(x)P_k(x) at t=at = a to f(x)f(x) at t=xt = x, and its derivative collapses to one term. Comparing FF with (x−t)k+1(x - t)^{k+1} through the Cauchy mean value theorem produces the factor (x−a)k+1/(k+1)!(x - a)^{k+1}/(k + 1)!.

Reading path

To understand this page from the ground up, read these 153 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, Proof of Rolle's theorem, Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the commutativity of addition by induction, Proof of the epsilon-delta form of continuity, Proof of the power rule by induction, Proof that there is a natural number n with 1/n below any positive epsilon, Proof of the chain rule with an auxiliary difference quotient, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof of the extreme value theorem by the Bolzano–Weierstrass theorem, Proof of the uniqueness of limits, Proof of strong induction from ordinary induction, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof of the squeeze theorem for sequences, Proof of the linearity of differentiation, Proof of the sequential characterization of limits, Proof of the Cauchy mean value theorem from Rolle's theorem, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof of Fermat's theorem on stationary points, Proof that limits preserve non-strict inequalities, Proof that differentiable functions are continuous, Proof of the epsilon-delta form of the limit of a function, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, Proof of the Archimedean property in an Archimedean ordered field, Proof that a composition of continuous functions is continuous, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, Proof of the product rule, Proof of the monotone convergence theorem for sequences, Proof that continuity is equivalent to sequential continuity, Proof of the boundedness theorem by Bolzano–Weierstrass, Proof of the mean value theorem from Rolle's theorem, Proof of the constant multiple rule.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Integers object
  5. Limit point of a set definition
  6. Local maximum definition
  7. Mathematical induction concept
  8. Natural numbers object
  9. Ordered field definition
  10. Peano axioms concept
  11. Proposition concept
  12. Rational numbers object
  13. Real numbers object
  14. Sequence definition
  15. Set bounded above definition
  16. Set definition
  17. Ring of integers statement
  18. Limit of a function definition
  19. Local minimum definition
  20. Archimedean ordered field definition
  21. Successor function definition
  22. Conjunction definition
  23. Disjunction definition
  24. Implication definition
  25. Negation definition
  26. Predicate definition
  27. The reals form a field statement
  28. Real sequence definition
  29. Subsequence definition
  30. Infimum definition
  31. Supremum definition
  32. Ordered pair definition
  33. Continuity at a point definition
  34. Derivative definition
  35. One-sided limit definition
  36. Addition of natural numbers definition
  37. Proof of the Archimedean property in an Archimedean ordered field proof
  38. The rationals form a field statement
  39. Biconditional definition
  40. The successor function is injective statement
  41. Zero is not a successor statement
  42. Truth table concept
  43. Modus ponens concept
  44. Universal quantifier definition
  45. Bounded sequence definition
  46. Limit of a sequence definition
  47. Monotone sequence definition
  48. Completeness axiom statement
  49. Cartesian product definition
  50. Continuous function definition
  51. Differentiable function definition
  52. One-sided derivative definition
  53. Archimedean property statement
  54. Proof of the commutativity of addition by induction proof
  55. Order on the natural numbers definition
  56. Subset definition
  57. The rationals form an ordered field statement
  58. Propositional logic concept
  59. Mathematical proof concept
  60. Convergent sequence definition
  61. Sequential continuity definition
  62. Proof that a composition of continuous functions is continuous proof
  63. Derivative function definition
  64. Binary relation definition
  65. Order on the reals definition
  66. Commutativity of addition statement
  67. Proof of strong induction from ordinary induction proof
  68. Tautology definition
  69. Higher derivative definition
  70. Antisymmetric relation definition
  71. Reflexive relation definition
  72. Transitive relation definition
  73. Interval definition
  74. Strong induction statement
  75. Logical equivalence definition
  76. Taylor polynomial definition
  77. Preorder definition
  78. Proof of the epsilon-delta form of continuity proof
  79. Proof of the epsilon-delta form of the limit of a function proof
  80. Proof of the well-ordering principle from strong induction proof
  81. Proof of the double negation law by a truth table proof
  82. Partial order definition
  83. Epsilon-delta definition of continuity statement
  84. Epsilon-delta definition of a limit statement
  85. Well-ordering principle statement
  86. Double negation law statement
  87. Total order definition
  88. Composition of continuous functions is continuous statement
  89. Proof by contradiction concept
  90. Proof that every sequence has a monotone subsequence, by peaks proof
  91. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  92. Every sequence has a monotone subsequence statement
  93. The reals form an ordered field statement
  94. Absolute value definition
  95. Proof of the approximation property of the supremum proof
  96. Proof of the triangle inequality for real numbers proof
  97. Proof that the absolute value is multiplicative proof
  98. Proof of the epsilon-N definition of the limit of a sequence proof
  99. Approximation property of the supremum statement
  100. Triangle inequality statement
  101. Absolute value is multiplicative statement
  102. Epsilon-N definition of the limit of a sequence statement
  103. Proof that the reals are Archimedean from the completeness axiom proof
  104. Proof of the limit of a sum of sequences proof
  105. Proof of the squeeze theorem for sequences proof
  106. Proof of the uniqueness of limits proof
  107. Proof that differentiable functions are continuous proof
  108. Proof that limits preserve non-strict inequalities proof
  109. The reals are Archimedean statement
  110. Proof that convergent sequences are bounded proof
  111. Proof of the monotone convergence theorem for sequences proof
  112. Differentiable functions are continuous statement
  113. Proof that there is a natural number n with 1/n below any positive epsilon proof
  114. Limit of a sum of sequences statement
  115. Uniqueness of limits statement
  116. Limits preserve non-strict inequalities statement
  117. Squeeze theorem statement
  118. Convergent sequences are bounded statement
  119. Monotone convergence theorem for sequences statement
  120. Proof of the limit of a product of sequences proof
  121. There is a natural number n with 1/n below any positive epsilon statement
  122. Proof that a decreasing sequence bounded below converges proof
  123. Proof of the sequential characterization of limits proof
  124. Decreasing sequence bounded below converges statement
  125. Proof that continuity is equivalent to sequential continuity proof
  126. Limit of a product of sequences statement
  127. Continuity is equivalent to sequential continuity statement
  128. Sequential characterization of limits statement
  129. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  130. Proof of the chain rule with an auxiliary difference quotient proof
  131. Proof of the product rule proof
  132. Proof of the linearity of differentiation proof
  133. Bolzano–Weierstrass theorem statement
  134. Chain rule statement
  135. Product rule statement
  136. Linearity of differentiation statement
  137. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  138. Proof of the power rule by induction proof
  139. Proof of the constant multiple rule proof
  140. Boundedness theorem statement
  141. Power rule statement
  142. Constant multiple rule statement
  143. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  144. Extreme value theorem statement
  145. Proof of Fermat's theorem on stationary points proof
  146. Fermat's theorem on stationary points statement
  147. Proof of Rolle's theorem proof
  148. Rolle's theorem statement
  149. Proof of the Cauchy mean value theorem from Rolle's theorem proof
  150. Proof of the mean value theorem from Rolle's theorem proof
  151. Mean value theorem statement
  152. Cauchy mean value theorem statement
  153. Proof of Taylor's theorem with the Lagrange remainder by the Cauchy mean value theorem proof

Where this leads

26 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Taylor%27s_theorem, Derivation for the mean value forms of the remainder
About this page
TagP9HSZF8CH1
URIm2://P9HSZF8CH1
Kindproof
WritingW0 stub
MSC41A80
ProvesTaylor's theorem with the Lagrange remainder
UsesTaylor polynomial, Cauchy mean value theorem, Higher derivative, One-sided derivative, Differentiable functions are continuous, Product rule, Power rule, Chain rule
Changed4 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.