Math 2.0

Sequences, series, summability Proof

Proof of Dini's theorem by compactness

Builds on Pointwise convergenceUniform convergenceLimits preserve non-strict inequalitiesProduct of continuous functions is continuousEpsilon-delta definition of continuityOpen setOpen coverCompact setHeine–Borel theorem

Proof

We cover [a,b][a, b] by open sets on which the error is small, and use compactness to pick one index.

  1. Let a<ba < b, and let fnf_n and ff be as in the statement. For each nn, let gn=f−fng_n = f - f_n.
  2. Fix x∈[a,b]x \in [a, b] and nn. For m≥nm \ge n, we have fn(x)≤fm(x)f_n(x) \le f_m(x). Letting m→∞m \to \infty gives fn(x)≤f(x)f_n(x) \le f(x), since limits preserve non-strict inequalities. So gn(x)≥0g_n(x) \ge 0.
  3. Since fn(x)≤fn+1(x)f_n(x) \le f_{n+1}(x), we get gn(x)≥gn+1(x)g_n(x) \ge g_{n+1}(x) for all nn and xx.
  4. Since fn→ff_n \to f pointwise, gn(x)→0g_n(x) \to 0 for each x∈[a,b]x \in [a, b].
  5. Each gn=f+(−1)⋅fng_n = f + (-1) \cdot f_n is continuous on [a,b][a, b], since sums and products of continuous functions are continuous and constants are continuous.
  6. Fix ε>0\varepsilon > 0. For each nn, let UnU_n be the union of all open intervals VV such that gn(x)<εg_n(x) < \varepsilon for every x∈V∩[a,b]x \in V \cap [a, b].
  7. Each UnU_n is a union of open intervals, so it is an open set of ℝ\R. By its definition, gn(x)<εg_n(x) < \varepsilon for each x∈Un∩[a,b]x \in U_n \cap [a, b].
  8. Let x∈[a,b]x \in [a, b] with gn(x)<εg_n(x) < \varepsilon. By step 5 and the epsilon-delta form of continuity with tolerance ε−gn(x)>0\varepsilon - g_n(x) > 0, there is δ>0\delta > 0 with gn(t)<εg_n(t) < \varepsilon for all t∈[a,b]t \in [a, b] with ∣t−x∣<δ|t - x| < \delta. So (x−δ,x+δ)(x - \delta, x + \delta) is one of the intervals in step 6, and x∈Unx \in U_n.
  9. Let x∈[a,b]x \in [a, b]. By step 4, there is nn with gn(x)<εg_n(x) < \varepsilon. By step 8, x∈Unx \in U_n. So the family (Un)n≥1(U_n)_{n \ge 1} is an open cover of [a,b][a, b].
  10. The interval [a,b][a, b] is closed and bounded. By the Heine–Borel theorem, it is compact.
  11. By step 10, finitely many of the sets cover [a,b][a, b], say Un1,…,UnkU_{n_1}, \dots, U_{n_k}. Let N=max⁡(n1,…,nk)N = \max(n_1, \dots, n_k).
  12. Let x∈[a,b]x \in [a, b]. Then x∈Unix \in U_{n_i} for some ii, so gni(x)<εg_{n_i}(x) < \varepsilon by step 7.
  13. Let n≥Nn \ge N. Since n≥N≥nin \ge N \ge n_i, steps 2 and 3 give 0≤gn(x)≤gni(x)<ε0 \le g_n(x) \le g_{n_i}(x) < \varepsilon.
  14. So ∣fn(x)−f(x)∣=gn(x)<ε|f_n(x) - f(x)| = g_n(x) < \varepsilon for all n≥Nn \ge N and all x∈[a,b]x \in [a, b]. As ε>0\varepsilon > 0 was arbitrary, fn→ff_n \to f uniformly on [a,b][a, b].

Idea

The set where f−fn<εf - f_n < \varepsilon is open, by continuity, and it grows with nn, by monotonicity. Pointwise convergence makes these sets cover [a,b][a, b]. Compactness reduces the cover to finitely many sets, and the largest of them is already all of [a,b][a, b].

Reading path

To understand this page from the ground up, read these 163 pages in order. The foundations come first. The path takes the proofs Proof of the limit of a sum of sequences, 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 Lebesgue number lemma by a finite cover of balls, Proof of the epsilon-delta form of continuity, Proof of the Heine–Borel theorem by sequential compactness, Proof that there is a natural number n with 1/n below any positive epsilon, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of the double negation law by a truth table, Proof that compact subsets of a metric space are bounded, Proof that compactness and sequential compactness agree in metric spaces, Proof that subsequences of a convergent sequence converge to the same limit, Proof of strong induction from ordinary induction, Proof of the limit of a product of sequences, Proof that the absolute value is multiplicative, Proof that compact subsets of a Hausdorff space are closed, Proof of the description of the open sets of a metric space, Proof of the triangle inequality for real numbers, Proof of the epsilon-N definition of the limit of a sequence, Proof that compactness of a subset can be tested with open sets of the ambient space, Proof that limits preserve non-strict inequalities, Proof that closed sets contain their limits, Proof that metric spaces are Hausdorff, Proof of the well-ordering principle from strong induction, Proof of the Bolzano–Weierstrass theorem by a monotone subsequence, 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 that open balls are open, Proof that sums and products of continuous functions are continuous.

  1. Construction of the reals from Cauchy sequences concept
  2. Definition by recursion concept
  3. Element definition
  4. Euclidean metric example
  5. Extended real number line object
  6. Integers object
  7. Limit point of a set definition
  8. Mathematical induction concept
  9. Natural numbers object
  10. Ordered field definition
  11. Peano axioms concept
  12. Proposition concept
  13. Rational numbers object
  14. Real numbers object
  15. Sequence definition
  16. Set bounded above definition
  17. Set definition
  18. Ring of integers statement
  19. Limit of a function 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. Empty set object
  33. Family of sets definition
  34. Ordered pair definition
  35. Continuity at a point definition
  36. Intersection definition
  37. Union definition
  38. Addition of natural numbers definition
  39. Biconditional definition
  40. The rationals form a field statement
  41. Truth table concept
  42. Modus ponens concept
  43. The successor function is injective statement
  44. Zero is not a successor statement
  45. Existential quantifier definition
  46. Universal quantifier definition
  47. Bounded sequence definition
  48. Limit of a sequence definition
  49. Monotone sequence definition
  50. Completeness axiom statement
  51. Cartesian product definition
  52. Continuous function definition
  53. Proof of the commutativity of addition by induction proof
  54. Subset definition
  55. Union of a family of sets definition
  56. Order on the natural numbers definition
  57. Propositional logic concept
  58. The rationals form an ordered field statement
  59. Mathematical proof concept
  60. Uniqueness quantifier definition
  61. Convergent sequence definition
  62. Pointwise convergence definition
  63. Sequential continuity definition
  64. Binary relation definition
  65. Universal set definition
  66. Topological space definition
  67. Order on the reals definition
  68. Commutativity of addition statement
  69. Proof of strong induction from ordinary induction proof
  70. Tautology definition
  71. Uniform convergence definition
  72. Antisymmetric relation definition
  73. Reflexive relation definition
  74. Transitive relation definition
  75. Complement definition
  76. Sequential compactness definition
  77. Interval definition
  78. Subspace topology definition
  79. Function definition
  80. Strong induction statement
  81. Logical equivalence definition
  82. Preorder definition
  83. Proof of the epsilon-delta form of continuity proof
  84. Proof of the well-ordering principle from strong induction proof
  85. Metric space definition
  86. Proof of the double negation law by a truth table proof
  87. Partial order definition
  88. Epsilon-delta definition of continuity statement
  89. Closed ball definition
  90. Convergence of a sequence in a metric space definition
  91. Open ball definition
  92. Triangle inequality for a metric statement
  93. Well-ordering principle statement
  94. Diameter of a set definition
  95. Double negation law statement
  96. Total order definition
  97. Bounded set definition
  98. Metric topology definition
  99. Proof by contradiction concept
  100. Proof that every sequence has a monotone subsequence, by peaks proof
  101. Open set definition
  102. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  103. Every sequence has a monotone subsequence statement
  104. Hausdorff space definition
  105. Closed set definition
  106. Open cover definition
  107. Proof of the description of the open sets of a metric space proof
  108. The reals form an ordered field statement
  109. Compact space definition
  110. Open sets of a metric space statement
  111. Absolute value definition
  112. Proof of the approximation property of the supremum proof
  113. Proof that closed sets contain their limits proof
  114. Compact set definition
  115. Proof of the triangle inequality for real numbers proof
  116. Proof that the absolute value is multiplicative proof
  117. Proof that open balls are open proof
  118. Proof of the epsilon-N definition of the limit of a sequence proof
  119. Approximation property of the supremum statement
  120. Closed sets contain their limits statement
  121. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  122. Triangle inequality statement
  123. Absolute value is multiplicative statement
  124. Open balls are open statement
  125. Proof that the reals are Archimedean from the completeness axiom proof
  126. Epsilon-N definition of the limit of a sequence statement
  127. Compactness via open covers statement
  128. Proof that metric spaces are Hausdorff proof
  129. Proof of the Lebesgue number lemma by a finite cover of balls proof
  130. Proof that limits preserve non-strict inequalities proof
  131. Proof of the limit of a sum of sequences proof
  132. The reals are Archimedean statement
  133. Proof that convergent sequences are bounded proof
  134. Proof that subsequences of a convergent sequence converge to the same limit proof
  135. Proof of the monotone convergence theorem for sequences proof
  136. Proof that compact subsets of a Hausdorff space are closed proof
  137. Metric spaces are Hausdorff statement
  138. Proof that compact subsets of a metric space are bounded proof
  139. Lebesgue number lemma statement
  140. Proof that compactness and sequential compactness agree in metric spaces proof
  141. Proof that there is a natural number n with 1/n below any positive epsilon proof
  142. Limits preserve non-strict inequalities statement
  143. Limit of a sum of sequences statement
  144. Convergent sequences are bounded statement
  145. Subsequences of a convergent sequence converge to the same limit statement
  146. Monotone convergence theorem for sequences statement
  147. Compact subsets of a Hausdorff space are closed statement
  148. Compact subsets of a metric space are bounded statement
  149. Compactness and sequential compactness agree in metric spaces statement
  150. Proof of the limit of a product of sequences proof
  151. There is a natural number n with 1/n below any positive epsilon statement
  152. Proof that a decreasing sequence bounded below converges proof
  153. Proof that continuity is equivalent to sequential continuity proof
  154. Decreasing sequence bounded below converges statement
  155. Limit of a product of sequences statement
  156. Continuity is equivalent to sequential continuity statement
  157. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  158. Proof that sums and products of continuous functions are continuous proof
  159. Bolzano–Weierstrass theorem statement
  160. Product of continuous functions is continuous statement
  161. Proof of the Heine–Borel theorem by sequential compactness proof
  162. Heine–Borel theorem statement
  163. Proof of Dini's theorem by compactness proof

Where this leads

3 pages build on this one.

Further reading

  1. Web https://proofwiki.org/wiki/Dini%27s_Theorem, Proof
About this page
TagPTER4CQT32
URIm2://PTER4CQT32
Kindproof
WritingW0 stub
MSC40A30
ProvesDini's theorem
UsesPointwise convergence, Uniform convergence, Limits preserve non-strict inequalities, Product of continuous functions is continuous, Epsilon-delta definition of continuity, Open set, Open cover, Compact set, Heine–Borel theorem
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.