Math 2.0

General topology Proof

Proof of the Arzelà–Ascoli theorem by total boundedness

Builds on Compact iff complete and totally boundedEpsilon-net characterisation of total boundednessTotally bounded setEquicontinuityUniform metric on bounded functionsContinuous real function on a compact set attains its boundsCompleteness of the space of bounded continuous functionsCompleteness of the real numbersClosure is the smallest closed supersetClosure is closedClosure in a metric spaceClosed sets contain their limitsContinuity via open setsCompact spaceOpen balls are openThe reals are ArchimedeanFloor functionDiameter of a set

Proof

We show that the closure is complete and totally bounded, and use compact iff complete and totally bounded. Write dd for the metric of XX, ∥f−g∥=d∞(f,g)\norm{f - g} = d_\infty(f, g), and GG for the closure of ℱ\mathcal{F} in C(X)C(X).

Setting up.

  1. If XX is empty, C(X)C(X) has one element. Then GG is finite, hence compact, and ℱ\mathcal{F} is vacuously equicontinuous and bounded with M=0M = 0. From now on let XX be nonempty.
  2. Let f∈C(X)f \in C(X). Since XX is compact, ff attains its bounds, so ff is bounded. Thus d∞d_\infty is the uniform metric restricted to C(X)C(X), a metric.
  3. The space ℝ\R is complete by the completeness of the real numbers. By step 2, C(X)C(X) is the space of bounded continuous functions X→ℝX \to \R. So C(X)C(X) is complete.
  4. By the closure is the smallest closed superset, ℱ⊆G\mathcal{F} \subseteq G. By closure is closed, GG is closed in C(X)C(X).
  5. If ℱ\mathcal{F} is empty, then GG is empty and both sides hold. From now on let ℱ\mathcal{F} be nonempty.

First, let GG be compact.

  1. By compact iff complete and totally bounded, GG is totally bounded. By the epsilon-net characterisation, for each ε>0\varepsilon > 0 there are finitely many g1,…,gm∈Gg_1, \ldots, g_m \in G such that each h∈Gh \in G has ∥h−gk∥<ε\norm{h - g_k} < \varepsilon for some kk.
  2. Uniform bound. Take ε=1\varepsilon = 1 in step 6. By step 2, choose MkM_k with ∣gk(x)∣≤Mk\abs{g_k(x)} \le M_k for all xx, and let M=max⁡kMk+1M = \max_k M_k + 1.
  3. Let f∈ℱf \in \mathcal{F} and x∈Xx \in X. Since f∈Gf \in G, some kk has ∥f−gk∥<1\norm{f - g_k} < 1. Then ∣f(x)∣≤∣f(x)−gk(x)∣+∣gk(x)∣<1+Mk≤M\abs{f(x)} \le \abs{f(x) - g_k(x)} + \abs{g_k(x)} < 1 + M_k \le M.
  4. Equicontinuity. Let a∈Xa \in X and ε>0\varepsilon > 0. Take g1,…,gmg_1, \ldots, g_m as in step 6 for ε/3\varepsilon / 3.
  5. Each gkg_k is a continuous map X→ℝX \to \R. By continuity via open sets at the point aa, there is δk>0\delta_k > 0 with ∣gk(x)−gk(a)∣<ε/3\abs{g_k(x) - g_k(a)} < \varepsilon / 3 when d(x,a)<δkd(x, a) < \delta_k. Let δ=min⁡kδk>0\delta = \min_k \delta_k > 0.
  6. Let f∈ℱf \in \mathcal{F} and d(x,a)<δd(x, a) < \delta. Choose kk with ∥f−gk∥<ε/3\norm{f - g_k} < \varepsilon / 3. Then ∣f(x)−f(a)∣≤∣f(x)−gk(x)∣+∣gk(x)−gk(a)∣+∣gk(a)−f(a)∣<ε\abs{f(x) - f(a)} \le \abs{f(x) - g_k(x)} + \abs{g_k(x) - g_k(a)} + \abs{g_k(a) - f(a)} < \varepsilon.
  7. The number δ\delta does not depend on ff. So ℱ\mathcal{F} is equicontinuous at aa, for each a∈Xa \in X.

Conversely, let ℱ\mathcal{F} be equicontinuous, with ∣f(x)∣≤M\abs{f(x)} \le M for all f∈ℱf \in \mathcal{F} and x∈Xx \in X.

  1. We first show that ℱ\mathcal{F} is totally bounded. Fix ε>0\varepsilon > 0 and let η=ε/5\eta = \varepsilon / 5.
  2. For each a∈Xa \in X, equicontinuity gives δa>0\delta_a > 0 with ∣f(x)−f(a)∣<η\abs{f(x) - f(a)} < \eta for all f∈ℱf \in \mathcal{F} and all xx with d(x,a)<δad(x, a) < \delta_a.
  3. The balls B(a,δa)B(a, \delta_a) are open and cover XX. By compactness, there are a1,…,ap∈Xa_1, \ldots, a_p \in X with X=B(a1,δa1)∪⋯∪B(ap,δap)X = B(a_1, \delta_{a_1}) \cup \cdots \cup B(a_p, \delta_{a_p}).
  4. Since the reals are Archimedean, choose an integer N≥0N \ge 0 with Nη≥MN \eta \ge M. Let Λ={jη:j∈ℤ, ∣j∣≤N}\Lambda = \set{j \eta : j \in \Z, \ \abs{j} \le N}, a finite set.
  5. Let t∈[−M,M]t \in [-M, M] and j=⌊t/η⌋j = \floor{t / \eta}, the floor. Since −N≤t/η≤N-N \le t / \eta \le N, we get −N≤j≤N-N \le j \le N. Also jη≤t<jη+ηj \eta \le t < j \eta + \eta, so ∣t−jη∣<η\abs{t - j \eta} < \eta with jη∈Λj \eta \in \Lambda.
  6. For each map φ ⁣:{1,…,p}→Λ\varphi \colon \set{1, \ldots, p} \to \Lambda, let ℱφ\mathcal{F}_\varphi be the set of f∈ℱf \in \mathcal{F} with ∣f(ak)−φ(k)∣<η\abs{f(a_k) - \varphi(k)} < \eta for each kk. There are finitely many maps φ\varphi.
  7. Each f∈ℱf \in \mathcal{F} lies in some ℱφ\mathcal{F}_\varphi. Indeed, f(ak)∈[−M,M]f(a_k) \in [-M, M], so step 17 gives φ(k)∈Λ\varphi(k) \in \Lambda with ∣f(ak)−φ(k)∣<η\abs{f(a_k) - \varphi(k)} < \eta.
  8. Let f,g∈ℱφf, g \in \mathcal{F}_\varphi and x∈Xx \in X. By step 15, d(x,ak)<δakd(x, a_k) < \delta_{a_k} for some kk.
  9. Then ∣f(x)−g(x)∣\abs{f(x) - g(x)} is at most ∣f(x)−f(ak)∣+∣f(ak)−φ(k)∣+∣φ(k)−g(ak)∣+∣g(ak)−g(x)∣\abs{f(x) - f(a_k)} + \abs{f(a_k) - \varphi(k)} + \abs{\varphi(k) - g(a_k)} + \abs{g(a_k) - g(x)}. By steps 14 and 18, this is less than 4η4 \eta.
  10. Taking the supremum over xx, ∥f−g∥≤4η<ε\norm{f - g} \le 4 \eta < \varepsilon. So each nonempty ℱφ\mathcal{F}_\varphi has diameter less than ε\varepsilon.
  11. By steps 19 and 22, the finitely many nonempty sets ℱφ\mathcal{F}_\varphi cover ℱ\mathcal{F}. So ℱ\mathcal{F} is totally bounded.
  12. Next, GG is totally bounded. Let ε>0\varepsilon > 0. By step 23 and the epsilon-net characterisation, there is a finite H⊆ℱH \subseteq \mathcal{F} with each f∈ℱf \in \mathcal{F} within ε/2\varepsilon / 2 of some h∈Hh \in H.
  13. Let g∈Gg \in G. By closure in a metric space, some f∈ℱf \in \mathcal{F} has ∥g−f∥<ε/2\norm{g - f} < \varepsilon / 2. Choose h∈Hh \in H with ∥f−h∥<ε/2\norm{f - h} < \varepsilon / 2. Then ∥g−h∥<ε\norm{g - h} < \varepsilon.
  14. Since H⊆ℱ⊆GH \subseteq \mathcal{F} \subseteq G, step 25 gives a finite ε\varepsilon-net of GG inside GG. By the epsilon-net characterisation, GG is totally bounded.
  15. Next, GG is complete. Let (gn)(g_n) be a Cauchy sequence in GG. By step 3, gn→gg_n \to g for some g∈C(X)g \in C(X).
  16. Since GG is closed, closed sets contain their limits, so g∈Gg \in G. Thus GG is complete.
  17. By steps 26 and 28 and compact iff complete and totally bounded, GG is compact.

Idea

In the complete space C(X)C(X), a closed set is compact exactly when it is totally bounded. Equicontinuity lets finitely many sample points control a function everywhere, up to a small error. Uniform boundedness lets finitely many grid values control the samples, so finitely many small groups cover the family. Conversely, a finite net of continuous functions passes its boundedness and its continuity to the whole family.

Reading path

To understand this page from the ground up, read these 180 pages in order. The foundations come first. The path takes the proofs Proof of the approximation property of the supremum, Proof that every sequence has a monotone subsequence, by peaks, Proof of the epsilon-net characterisation of total boundedness, Proof that open sets are the sets that are neighbourhoods of all their points, Proof of the diameter characterisation of Cauchy sequences, Proof of the completeness of the space of bounded continuous functions, Proof of the commutativity of addition by induction, Proof of the Lebesgue number lemma by a finite cover of balls, Proof of De Morgan's laws for sets, Proof of De Morgan's laws by truth tables, Proof of the Heine–Borel theorem by sequential compactness, Proof that a union of open sets of a metric space is open, Proof that an intersection of closed sets of a metric space is closed, Proof that the reals form an ordered field, with the Cauchy sequence construction, 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 that a continuous image of a compact set is compact, Proof that the closure is the smallest closed superset, Proof that compact subsets of a Hausdorff space are closed, Proof of epsilon-delta continuity at a point in metric spaces, Proof of the description of the open sets of a metric space, 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 of the existence of the infimum by negation, Proof of the description of the closure in a metric space, 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 continuous real function on a compact set attains its bounds, Proof that a decreasing sequence bounded below converges, Proof that the reals are Archimedean from the completeness axiom, Proof of the monotone convergence theorem for sequences, Proof that open balls are open, Proof that a set is compact iff it is complete and totally bounded, Proof that the closure is closed, Proof of continuity via open sets in metric spaces.

  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. 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. Uniform metric on bounded functions example
  17. Set definition
  18. Ring of integers statement
  19. Archimedean ordered field definition
  20. Successor function definition
  21. Conjunction definition
  22. Disjunction definition
  23. Implication definition
  24. Negation definition
  25. Predicate definition
  26. The reals form a field statement
  27. Real sequence definition
  28. Subsequence definition
  29. Infimum definition
  30. Supremum definition
  31. Empty set object
  32. Family of sets definition
  33. Ordered pair definition
  34. Intersection definition
  35. Union definition
  36. Addition of natural numbers definition
  37. Biconditional definition
  38. Truth table concept
  39. The rationals form a field statement
  40. The successor function is injective statement
  41. Zero is not a successor statement
  42. Existential quantifier definition
  43. Universal quantifier definition
  44. Bounded sequence definition
  45. Cauchy sequence definition
  46. Limit of a sequence definition
  47. Monotone sequence definition
  48. Completeness axiom statement
  49. Cartesian product definition
  50. Proof of the commutativity of addition by induction proof
  51. Axiom of extensionality statement
  52. Subset definition
  53. Intersection of a family of sets definition
  54. Union of a family of sets definition
  55. Order on the natural numbers definition
  56. Propositional logic concept
  57. The rationals form an ordered field statement
  58. Uniqueness quantifier definition
  59. Convergent sequence definition
  60. Binary relation definition
  61. Universal set definition
  62. Topological space definition
  63. Commutativity of addition statement
  64. Order on the reals definition
  65. Proof of strong induction from ordinary induction proof
  66. Tautology definition
  67. Antisymmetric relation definition
  68. Reflexive relation definition
  69. Transitive relation definition
  70. Complement definition
  71. Sequential compactness definition
  72. Subspace topology definition
  73. Function definition
  74. Strong induction statement
  75. Logical equivalence definition
  76. Preorder definition
  77. Image of a set definition
  78. Preimage of a set definition
  79. Restriction of a function definition
  80. Proof of the well-ordering principle from strong induction proof
  81. Metric space definition
  82. Proof of De Morgan's laws by truth tables proof
  83. Partial order definition
  84. Subspace metric definition
  85. Closed ball definition
  86. Convergence of a sequence in a metric space definition
  87. Open ball definition
  88. Triangle inequality for a metric statement
  89. Well-ordering principle statement
  90. De Morgan's laws statement
  91. Diameter of a set definition
  92. Total order definition
  93. Proof of De Morgan's laws for sets proof
  94. Bounded set definition
  95. Metric topology definition
  96. Totally bounded set definition
  97. Proof of the diameter characterisation of Cauchy sequences proof
  98. Proof that every sequence has a monotone subsequence, by peaks proof
  99. Open set definition
  100. De Morgan's laws for sets statement
  101. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  102. Proof of the epsilon-net characterisation of total boundedness proof
  103. Epsilon characterisation of Cauchy sequences statement
  104. Every sequence has a monotone subsequence statement
  105. Hausdorff space definition
  106. Continuous map of topological spaces definition
  107. Closed set definition
  108. Proof that open sets are the sets that are neighbourhoods of all their points proof
  109. Open cover definition
  110. Proof of the description of the open sets of a metric space proof
  111. Epsilon-net characterisation of total boundedness statement
  112. Complete metric space definition
  113. The reals form an ordered field statement
  114. Open sets characterised by neighbourhoods statement
  115. Closure definition
  116. Open sets of a metric space statement
  117. Compact space definition
  118. Absolute value definition
  119. Proof of the approximation property of the supremum proof
  120. Proof of the existence of the infimum by negation proof
  121. Continuity at a point of a topological space definition
  122. Proof that the closure is closed proof
  123. Proof that a union of open sets of a metric space is open proof
  124. Proof that closed sets contain their limits proof
  125. Compact set definition
  126. Proof that open balls are open proof
  127. Proof of the epsilon-N definition of the limit of a sequence proof
  128. Approximation property of the supremum statement
  129. Existence of the infimum statement
  130. Closed sets contain their limits statement
  131. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  132. Union of open sets is open statement
  133. Open balls are open statement
  134. Proof that the reals are Archimedean from the completeness axiom proof
  135. Epsilon-N definition of the limit of a sequence statement
  136. Proof of epsilon-delta continuity at a point in metric spaces proof
  137. Proof of continuity via open sets in metric spaces proof
  138. Proof of the description of the closure in a metric space proof
  139. Proof that metric spaces are Hausdorff proof
  140. Compactness via open covers statement
  141. Proof that an intersection of closed sets of a metric space is closed proof
  142. Proof of the completeness of the space of bounded continuous functions proof
  143. Proof of the Lebesgue number lemma by a finite cover of balls proof
  144. Proof that subsequences of a convergent sequence converge to the same limit proof
  145. The reals are Archimedean statement
  146. Proof of the monotone convergence theorem for sequences proof
  147. Epsilon-delta continuity in metric spaces statement
  148. Proof that compact subsets of a Hausdorff space are closed proof
  149. Closure in a metric space statement
  150. Proof that a continuous image of a compact set is compact proof
  151. Intersection of closed sets is closed statement
  152. Metric spaces are Hausdorff statement
  153. Proof that compact subsets of a metric space are bounded proof
  154. Proof that compactness and sequential compactness agree in metric spaces proof
  155. Proof that a set is compact iff it is complete and totally bounded proof
  156. Lebesgue number lemma statement
  157. Floor function definition
  158. Completeness of the space of bounded continuous functions statement
  159. Subsequences of a convergent sequence converge to the same limit statement
  160. Monotone convergence theorem for sequences statement
  161. Continuity via open sets statement
  162. Compact subsets of a Hausdorff space are closed statement
  163. Closure is closed statement
  164. Equicontinuity definition
  165. Continuous image of a compact set is compact statement
  166. Compact subsets of a metric space are bounded statement
  167. Compactness and sequential compactness agree in metric spaces statement
  168. Proof that a decreasing sequence bounded below converges proof
  169. Proof that the closure is the smallest closed superset proof
  170. Compact iff complete and totally bounded statement
  171. Decreasing sequence bounded below converges statement
  172. Closure is the smallest closed superset statement
  173. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  174. Bolzano–Weierstrass theorem statement
  175. Proof of the Heine–Borel theorem by sequential compactness proof
  176. Completeness of the real numbers statement
  177. Heine–Borel theorem statement
  178. Proof that a continuous real function on a compact set attains its bounds proof
  179. Continuous real function on a compact set attains its bounds statement
  180. Proof of the Arzelà–Ascoli theorem by total boundedness proof

Where this leads

24 pages build on this one.

Further reading

  1. Web https://www.mileshwheeler.com/ma30252/sec-aa.html, Theorem 4.29
About this page