Math 2.0

Approximations and expansions Proof

Proof of Taylor's theorem by repeated use of L'Hôpital's rule

Builds on Taylor polynomialHigher derivativeDerivativeL'Hôpital's ruleDifferentiable functions are continuousPower ruleChain ruleConstant multiple rule

Proof

We show that (f(x)−Pk(x))/(x−a)k→0(f(x) - P_k(x))/(x - a)^k \to 0, using L'Hôpital's rule k−1k - 1 times and then the definition of f(k)(a)f^{(k)}(a).

  1. That ff is kk times differentiable at aa means the following. The higher derivatives f′,…,f(k−1)f', \dots, f^{(k-1)} exist on an open interval U⊆IU \subseteq I containing aa, and f(k−1)f^{(k-1)} is differentiable at aa. For k=1k = 1 this says only that ff is differentiable at aa, and we take U=IU = I.
  2. For i≥0i \ge 0 let qi(x)=(x−a)i/i!q_i(x) = (x - a)^i / i!. By the power rule, the chain rule and the constant multiple rule, qi′=qi−1q_i' = q_{i-1} for i≥1i \ge 1, and q0′=0q_0' = 0.
  3. So the jj-th derivative of qiq_i is qi−jq_{i-j} if j≤ij \le i, and 00 if j>ij > i. Also q0(a)=1q_0(a) = 1, and qm(a)=0q_m(a) = 0 for m≥1m \ge 1.
  4. The Taylor polynomial is Pk=∑i=0kf(i)(a) qiP_k = \sum_{i=0}^{k} f^{(i)}(a) \, q_i. By step 3, Pk(j)(a)=f(j)(a)P_k^{(j)}(a) = f^{(j)}(a) for 0≤j≤k0 \le j \le k.
  5. Let R(x)=f(x)−Pk(x)R(x) = f(x) - P_k(x) for x∈Ix \in I. By step 1, R(j)R^{(j)} exists on UU for j≤k−1j \le k - 1, and R(k−1)R^{(k-1)} is differentiable at aa.
  6. By step 4, R(j)(a)=0R^{(j)}(a) = 0 for 0≤j≤k0 \le j \le k.
  7. We prove by backward induction on jj, from j=k−1j = k - 1 down to j=0j = 0, that R(j)(x)/(x−a)k−j→0R^{(j)}(x) / (x - a)^{k - j} \to 0 as x→ax \to a.
  8. Case j=k−1j = k - 1. The quotient is (R(k−1)(x)−R(k−1)(a))/(x−a)(R^{(k-1)}(x) - R^{(k-1)}(a))/(x - a), since R(k−1)(a)=0R^{(k-1)}(a) = 0. By the definition of the derivative, it tends to R(k)(a)=0R^{(k)}(a) = 0.
  9. Step. Let 0≤j≤k−20 \le j \le k - 2, and assume the claim for j+1j + 1. Put φ=R(j)\varphi = R^{(j)} and ψ(x)=(x−a)k−j\psi(x) = (x - a)^{k - j} on UU.
  10. Both φ\varphi and ψ\psi are differentiable on U∖{a}U \setminus \set{a}, since j+1≤k−1j + 1 \le k - 1. Also ψ′(x)=(k−j)(x−a)k−j−1≠0\psi'(x) = (k - j)(x - a)^{k-j-1} \ne 0 for x≠ax \ne a.
  11. The function φ\varphi is differentiable at aa, hence continuous there. So φ(x)→φ(a)=0\varphi(x) \to \varphi(a) = 0. Also ψ(x)→0\psi(x) \to 0, since k−j≥2k - j \ge 2.
  12. By the induction hypothesis, φ′(x)/ψ′(x)=1k−j⋅R(j+1)(x)(x−a)k−j−1→0\varphi'(x)/\psi'(x) = \dfrac{1}{k - j} \cdot \dfrac{R^{(j+1)}(x)}{(x - a)^{k - j - 1}} \to 0 as x→ax \to a.
  13. By L'Hôpital's rule on UU at aa, φ(x)/ψ(x)→0\varphi(x)/\psi(x) \to 0. This is the claim for jj.
  14. The case j=0j = 0 of step 7 says R(x)/(x−a)k→0R(x)/(x - a)^k \to 0 as x→ax \to a.
  15. Define hk ⁣:I→ℝh_k \colon I \to \R by hk(x)=R(x)/(x−a)kh_k(x) = R(x)/(x - a)^k for x≠ax \ne a, and hk(a)=0h_k(a) = 0. By step 14, hk(x)→0h_k(x) \to 0 as x→ax \to a.
  16. For x≠ax \ne a, f(x)=Pk(x)+R(x)=Pk(x)+hk(x)(x−a)kf(x) = P_k(x) + R(x) = P_k(x) + h_k(x)(x - a)^k.
  17. For x=ax = a, f(a)=Pk(a)f(a) = P_k(a) by step 4 with j=0j = 0. Also (a−a)k=0(a - a)^k = 0, since k≥1k \ge 1. So the formula holds at aa too.

Idea

The remainder R=f−PkR = f - P_k and its first kk derivatives all vanish at aa, because PkP_k is built to match them. Each use of L'Hôpital's rule removes one power of x−ax - a and one derivative of RR. After k−1k - 1 steps we reach a difference quotient of R(k−1)R^{(k-1)}, whose limit is R(k)(a)=0R^{(k)}(a) = 0.

Reading path

To understand this page from the ground up, read these 154 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 L'Hôpital's rule from the Cauchy mean value theorem, 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. Indeterminate form concept
  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. Archimedean property statement
  53. Proof of the commutativity of addition by induction proof
  54. Order on the natural numbers definition
  55. Subset definition
  56. The rationals form an ordered field statement
  57. Propositional logic concept
  58. Mathematical proof concept
  59. Convergent sequence definition
  60. Sequential continuity definition
  61. Proof that a composition of continuous functions is continuous proof
  62. Derivative function definition
  63. Binary relation definition
  64. Order on the reals definition
  65. Commutativity of addition statement
  66. Proof of strong induction from ordinary induction proof
  67. Tautology definition
  68. Higher derivative definition
  69. Antisymmetric relation definition
  70. Reflexive relation definition
  71. Transitive relation definition
  72. Interval definition
  73. Strong induction statement
  74. Logical equivalence definition
  75. Taylor polynomial definition
  76. Preorder definition
  77. Proof of the epsilon-delta form of continuity proof
  78. Proof of the epsilon-delta form of the limit of a function proof
  79. Proof of the well-ordering principle from strong induction proof
  80. Proof of the double negation law by a truth table proof
  81. Partial order definition
  82. Epsilon-delta definition of continuity statement
  83. Epsilon-delta definition of a limit statement
  84. Well-ordering principle statement
  85. Double negation law statement
  86. Total order definition
  87. Composition of continuous functions is continuous statement
  88. Proof by contradiction concept
  89. Proof that every sequence has a monotone subsequence, by peaks proof
  90. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  91. Every sequence has a monotone subsequence statement
  92. The reals form an ordered field statement
  93. Absolute value definition
  94. Proof of the approximation property of the supremum proof
  95. Proof of the triangle inequality for real numbers proof
  96. Proof that the absolute value is multiplicative proof
  97. Proof of the epsilon-N definition of the limit of a sequence proof
  98. Approximation property of the supremum statement
  99. Triangle inequality statement
  100. Absolute value is multiplicative statement
  101. Epsilon-N definition of the limit of a sequence statement
  102. Proof that the reals are Archimedean from the completeness axiom proof
  103. Proof of the limit of a sum of sequences proof
  104. Proof of the squeeze theorem for sequences proof
  105. Proof of the uniqueness of limits proof
  106. Proof that differentiable functions are continuous proof
  107. Proof that limits preserve non-strict inequalities proof
  108. The reals are Archimedean statement
  109. Proof that convergent sequences are bounded proof
  110. Proof of the monotone convergence theorem for sequences proof
  111. Differentiable functions are continuous statement
  112. Proof that there is a natural number n with 1/n below any positive epsilon proof
  113. Limit of a sum of sequences statement
  114. Uniqueness of limits statement
  115. Limits preserve non-strict inequalities statement
  116. Squeeze theorem statement
  117. Convergent sequences are bounded statement
  118. Monotone convergence theorem for sequences statement
  119. Proof of the limit of a product of sequences proof
  120. There is a natural number n with 1/n below any positive epsilon statement
  121. Proof that a decreasing sequence bounded below converges proof
  122. Proof of the sequential characterization of limits proof
  123. Decreasing sequence bounded below converges statement
  124. Proof that continuity is equivalent to sequential continuity proof
  125. Limit of a product of sequences statement
  126. Continuity is equivalent to sequential continuity statement
  127. Sequential characterization of limits statement
  128. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  129. Proof of the chain rule with an auxiliary difference quotient proof
  130. Proof of the product rule proof
  131. Proof of the linearity of differentiation proof
  132. Bolzano–Weierstrass theorem statement
  133. Chain rule statement
  134. Product rule statement
  135. Linearity of differentiation statement
  136. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  137. Proof of the power rule by induction proof
  138. Proof of the constant multiple rule proof
  139. Boundedness theorem statement
  140. Power rule statement
  141. Constant multiple rule statement
  142. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  143. Extreme value theorem statement
  144. Proof of Fermat's theorem on stationary points proof
  145. Fermat's theorem on stationary points statement
  146. Proof of Rolle's theorem proof
  147. Rolle's theorem statement
  148. Proof of the Cauchy mean value theorem from Rolle's theorem proof
  149. Proof of the mean value theorem from Rolle's theorem proof
  150. Mean value theorem statement
  151. Cauchy mean value theorem statement
  152. Proof of L'Hôpital's rule from the Cauchy mean value theorem proof
  153. L'Hôpital's rule statement
  154. Proof of Taylor's theorem by repeated use of L'Hôpital's rule proof

Where this leads

6 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Taylor%27s_theorem, Proof for Taylor's theorem in one real variable
About this page
Tag11G4Z2V789
URIm2://11G4Z2V789
Kindproof
WritingW0 stub
MSC41A58
ProvesTaylor's theorem
UsesTaylor polynomial, Higher derivative, Derivative, L'Hôpital's rule, Differentiable functions are continuous, Power rule, Chain rule, Constant multiple 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.