Math 2.0

Sequences, series, summability Proof

Proof that uniform convergence of derivatives allows term-by-term differentiation

Builds on Uniform convergenceUniformly Cauchy sequence of functionsDerivativeOne-sided derivativeEpsilon-delta definition of a limitEpsilon-delta definition of continuityMean value theoremLinearity of differentiationConvergent sequences are CauchyCauchy criterion for sequencesLimits preserve non-strict inequalitiesTriangle inequality

Proof

We use the mean value theorem twice: once to show that (fn)(f_n) is uniformly Cauchy, and once to control difference quotients uniformly. No continuity of the derivatives is needed.

Setup.

  1. Let a<ba < b. At an interior point, fn′f_n' is the derivative. At aa and bb, it is the one-sided derivative. So for each y∈[a,b]y \in [a, b], fn′(y)f_n'(y) is the limit of fn(t)−fn(y)t−y\frac{f_n(t) - f_n(y)}{t - y} as t→yt \to y with t∈[a,b]t \in [a, b], t≠yt \ne y.
  2. Each fnf_n is continuous on [a,b][a, b]. Indeed, fix yy and put K=∣fn′(y)∣+1K = |f_n'(y)| + 1. By the limit in step 1 with tolerance 11, there is δ0>0\delta_0 > 0 such that the quotient has absolute value at most KK when 0<∣t−y∣<δ00 < |t - y| < \delta_0. So ∣fn(t)−fn(y)∣≤K∣t−y∣|f_n(t) - f_n(y)| \le K |t - y| for these tt. Given ε>0\varepsilon > 0, this is less than ε\varepsilon when ∣t−y∣<min⁡(δ0,ε/K)|t - y| < \min(\delta_0, \varepsilon / K). By the epsilon-delta form, fnf_n is continuous at yy.
  3. Let n,m≥1n, m \ge 1, put h=fn−fmh = f_n - f_m, and let s≠ts \ne t in [a,b][a, b]. By step 2, hh is continuous on the closed interval between ss and tt. By linearity of differentiation, hh is differentiable inside it with h′=fn′−fm′h' = f_n' - f_m'.
  4. By the mean value theorem, there is ξ\xi strictly between ss and tt with h(t)−h(s)=(fn′(ξ)−fm′(ξ))(t−s)h(t) - h(s) = (f_n'(\xi) - f_m'(\xi))(t - s).
  5. Let η>0\eta > 0. Since fn′→gf_n' \to g uniformly, there is N(η)N(\eta) with ∣fn′(x)−g(x)∣<η2|f_n'(x) - g(x)| < \frac{\eta}{2} for all n≥N(η)n \ge N(\eta) and all x∈[a,b]x \in [a, b].
  6. By step 5 and the triangle inequality, ∣fn′(x)−fm′(x)∣<η|f_n'(x) - f_m'(x)| < \eta for all n,m≥N(η)n, m \ge N(\eta) and all x∈[a,b]x \in [a, b].

The sequence (fn)(f_n) converges uniformly.

  1. Let ε>0\varepsilon > 0. The sequence (fn(x0))(f_n(x_0)) converges, so it is Cauchy, since convergent sequences are Cauchy.
  2. By steps 6 and 7, there is NN such that for all n,m≥Nn, m \ge N, we have ∣fn(x0)−fm(x0)∣<ε2|f_n(x_0) - f_m(x_0)| < \frac{\varepsilon}{2} and ∣fn′−fm′∣<ε2(b−a)|f_n' - f_m'| < \frac{\varepsilon}{2(b - a)} on [a,b][a, b].
  3. Let n,m≥Nn, m \ge N, h=fn−fmh = f_n - f_m, and x∈[a,b]x \in [a, b]. By step 4 with s=x0s = x_0 and t=xt = x (if x≠x0x \ne x_0), and step 8, ∣h(x)∣≤∣h(x)−h(x0)∣+∣h(x0)∣<ε2(b−a)∣x−x0∣+ε2≤ε.|h(x)| \le |h(x) - h(x_0)| + |h(x_0)| < \frac{\varepsilon}{2(b - a)} |x - x_0| + \frac{\varepsilon}{2} \le \varepsilon.
  4. So (fn)(f_n) is uniformly Cauchy on [a,b][a, b].
  5. For each xx, the sequence (fn(x))(f_n(x)) is Cauchy by step 9. By the Cauchy criterion, it converges. Let f(x)f(x) be its limit.
  6. Fix n≥Nn \ge N and xx. Letting m→∞m \to \infty in ∣fn(x)−fm(x)∣<ε|f_n(x) - f_m(x)| < \varepsilon gives ∣fn(x)−f(x)∣≤ε|f_n(x) - f(x)| \le \varepsilon, since limits preserve non-strict inequalities.
  7. Since ε\varepsilon was arbitrary and NN does not depend on xx, step 12 shows that fn→ff_n \to f uniformly on [a,b][a, b].

The limit ff is differentiable with f′=gf' = g.

  1. Fix y∈[a,b]y \in [a, b]. For t∈[a,b]t \in [a, b] with t≠yt \ne y, let φn(t)=fn(t)−fn(y)t−y\varphi_n(t) = \frac{f_n(t) - f_n(y)}{t - y} and φ(t)=f(t)−f(y)t−y\varphi(t) = \frac{f(t) - f(y)}{t - y}. By step 11, φn(t)→φ(t)\varphi_n(t) \to \varphi(t) for each such tt.
  2. Let η>0\eta > 0 and n,m≥N(η)n, m \ge N(\eta). By step 4 with s=ys = y, and step 6, ∣φn(t)−φm(t)∣=∣fn′(ξ)−fm′(ξ)∣<η|\varphi_n(t) - \varphi_m(t)| = |f_n'(\xi) - f_m'(\xi)| < \eta for each t≠yt \ne y.
  3. Letting m→∞m \to \infty in step 15 gives ∣φn(t)−φ(t)∣≤η|\varphi_n(t) - \varphi(t)| \le \eta for all n≥N(η)n \ge N(\eta) and all t≠yt \ne y, again since limits preserve non-strict inequalities.
  4. Let ε>0\varepsilon > 0, put η=ε3\eta = \frac{\varepsilon}{3}, and fix n=N(η)n = N(\eta). By step 5, ∣fn′(y)−g(y)∣<η|f_n'(y) - g(y)| < \eta.
  5. By step 1 and the epsilon-delta form of a limit, there is δ>0\delta > 0 with ∣φn(t)−fn′(y)∣<η|\varphi_n(t) - f_n'(y)| < \eta for all t∈[a,b]t \in [a, b] with 0<∣t−y∣<δ0 < |t - y| < \delta.
  6. For such tt, steps 16 to 18 and the triangle inequality give ∣φ(t)−g(y)∣≤∣φ(t)−φn(t)∣+∣φn(t)−fn′(y)∣+∣fn′(y)−g(y)∣<3η=ε.|\varphi(t) - g(y)| \le |\varphi(t) - \varphi_n(t)| + |\varphi_n(t) - f_n'(y)| + |f_n'(y) - g(y)| < 3\eta = \varepsilon.
  7. So φ(t)→g(y)\varphi(t) \to g(y) as t→yt \to y within [a,b][a, b]. This means that ff is differentiable at yy, one-sided if yy is an endpoint, with f′(y)=g(y)f'(y) = g(y).
  8. Since yy was arbitrary, fn→ff_n \to f uniformly on [a,b][a, b], ff is differentiable, and f′=gf' = g.

Idea

The mean value theorem turns a uniform bound on fn′−fm′f_n' - f_m' into a bound on the differences of fn−fmf_n - f_m, both between two points and in difference quotients. Convergence at one point x0x_0 anchors the functions, so they converge uniformly. The difference quotients converge uniformly too, which lets us swap the limit in nn with the limit t→yt \to y.

Reading path

To understand this page from the ground up, read these 149 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 that convergent sequences are Cauchy, Proof that there is a natural number n with 1/n below any positive epsilon, Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem, 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 that Cauchy sequences are bounded, 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 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 decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof that convergent sequences are bounded, 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. Cauchy sequence definition
  47. Limit of a sequence definition
  48. Monotone sequence definition
  49. Completeness axiom statement
  50. Cartesian product definition
  51. Continuous function definition
  52. Differentiable function definition
  53. One-sided derivative definition
  54. Archimedean property statement
  55. Proof of the commutativity of addition by induction proof
  56. Order on the natural numbers definition
  57. Subset definition
  58. The rationals form an ordered field statement
  59. Propositional logic concept
  60. Mathematical proof concept
  61. Convergent sequence definition
  62. Pointwise convergence definition
  63. Sequential continuity 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. Uniform convergence definition
  70. Antisymmetric relation definition
  71. Reflexive relation definition
  72. Transitive relation definition
  73. Interval definition
  74. Strong induction statement
  75. Uniform convergence on a set definition
  76. Logical equivalence 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. 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 limits preserve non-strict inequalities proof
  107. The reals are Archimedean statement
  108. Proof that convergent sequences are bounded proof
  109. Proof that convergent sequences are Cauchy proof
  110. Proof that Cauchy sequences are bounded proof
  111. Proof of the monotone convergence theorem for sequences proof
  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. Convergent sequences are bounded statement
  117. Squeeze theorem statement
  118. Convergent sequences are Cauchy statement
  119. Cauchy sequences are bounded statement
  120. Monotone convergence theorem for sequences statement
  121. Proof of the limit of a product of sequences proof
  122. There is a natural number n with 1/n below any positive epsilon statement
  123. Proof that a decreasing sequence bounded below converges proof
  124. Proof of the sequential characterization of limits proof
  125. Decreasing sequence bounded below converges statement
  126. Proof that continuity is equivalent to sequential continuity proof
  127. Limit of a product of sequences statement
  128. Continuity is equivalent to sequential continuity statement
  129. Sequential characterization of limits statement
  130. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  131. Proof of the linearity of differentiation proof
  132. Bolzano–Weierstrass theorem statement
  133. Linearity of differentiation statement
  134. Proof of the boundedness theorem by Bolzano–Weierstrass proof
  135. Proof of the Cauchy criterion for sequences by the Bolzano–Weierstrass theorem proof
  136. Proof of the constant multiple rule proof
  137. Boundedness theorem statement
  138. Cauchy criterion for sequences statement
  139. Constant multiple rule statement
  140. Proof of the extreme value theorem by the Bolzano–Weierstrass theorem proof
  141. Uniformly Cauchy sequence of functions definition
  142. Extreme value theorem statement
  143. Proof of Fermat's theorem on stationary points proof
  144. Fermat's theorem on stationary points statement
  145. Proof of Rolle's theorem proof
  146. Rolle's theorem statement
  147. Proof of the mean value theorem from Rolle's theorem proof
  148. Mean value theorem statement
  149. Proof that uniform convergence of derivatives allows term-by-term differentiation proof

Where this leads

440 pages build on this one.

Further reading

  1. Web https://dec41.user.srcf.net/notes/IB_M/analysis_ii_thm_proof.pdf, Section 1, Uniform convergence
About this page
TagCW8S9TN77Q
URIm2://CW8S9TN77Q
Kindproof
WritingW0 stub
MSC40A30, 26A24
ProvesUniform convergence of derivatives allows term-by-term differentiation
UsesUniform convergence, Uniformly Cauchy sequence of functions, Derivative, One-sided derivative, Epsilon-delta definition of a limit, Epsilon-delta definition of continuity, Mean value theorem, Linearity of differentiation, Convergent sequences are Cauchy, Cauchy criterion for sequences, Limits preserve non-strict inequalities, Triangle inequality
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.