Math 2.0

Functional analysis Proof

Proof of the Heine–Borel theorem in finite-dimensional normed spaces

Builds on Heine–Borel theoremEquivalence of norms in finite dimensionEquivalent normsFinite-dimensional vector spaceEvery spanning set contains a basisIsomorphism with the coordinate spaceEuclidean metricLipschitz mapContinuity via open setsContinuity via closed setsContinuous image of a compact set is compactCompact setClosed setBounded setHomeomorphism

Proof

We transport the problem to ℝm\mathbb{R}^m by a map that distorts distances by at most constant factors.

  1. Let 𝕂\mathbb{K} be ℝ\mathbb{R} or ℂ\mathbb{C}. If V={0}V = \{0\}, its subsets are ∅\varnothing and VV. Both are finite, so compact, and both are closed and bounded. Let V≠{0}V \neq \{0\}.
  2. Take a basis e1,…,ene_1, \ldots, e_n of the finite-dimensional space VV, with coordinates aja_j as in this result, and let ∥x∥∞=max⁡j∣aj(x)∣\|x\|_\infty = \max_j |a_j(x)|. It is a norm: it vanishes only at 00, it is homogeneous, and ∣aj(x+y)∣≤∣aj(x)∣+∣aj(y)∣|a_j(x + y)| \le |a_j(x)| + |a_j(y)|.
  3. By the equivalence of norms in finite dimension, there are c,C>0c, C > 0 with c∥x∥∞≤∥x∥≤C∥x∥∞c \|x\|_\infty \le \|x\| \le C \|x\|_\infty for all x∈Vx \in V.
  4. Let m=nm = n if 𝕂=ℝ\mathbb{K} = \mathbb{R} and m=2nm = 2n if 𝕂=ℂ\mathbb{K} = \mathbb{C}. Let Λ ⁣:ℝm→V\Lambda \colon \mathbb{R}^m \to V be Λ(t)=∑jtjej\Lambda(t) = \sum_j t_j e_j, or Λ(t)=∑j(t2j−1+i t2j)ej\Lambda(t) = \sum_j (t_{2j-1} + \mathrm{i} \, t_{2j}) e_j in the complex case. It is an additive bijection.
  5. Let ∥t∥2\|t\|_2 be the Euclidean length, so that d2(t,s)=∥t−s∥2d_2(t, s) = \|t - s\|_2 is the Euclidean metric. Each coordinate aj(Λ(t))a_j(\Lambda(t)) is tjt_j, or t2j−1+i t2jt_{2j-1} + \mathrm{i} \, t_{2j}. Its modulus is at most ∥t∥2\|t\|_2, and at least each ∣tk∣|t_k| that appears in it.
  6. Hence ∥t∥2/m≤max⁡k∣tk∣≤∥Λ(t)∥∞≤∥t∥2\|t\|_2 / \sqrt{m} \le \max_k |t_k| \le \|\Lambda(t)\|_\infty \le \|t\|_2. With step 3, α∥t∥2≤∥Λ(t)∥≤C∥t∥2\alpha \|t\|_2 \le \|\Lambda(t)\| \le C \|t\|_2, where α=c/m>0\alpha = c / \sqrt{m} > 0.
  7. As Λ\Lambda is additive, α d2(t,s)≤∥Λ(t)−Λ(s)∥≤C d2(t,s)\alpha \, d_2(t, s) \le \|\Lambda(t) - \Lambda(s)\| \le C \, d_2(t, s) for all t,s∈ℝmt, s \in \mathbb{R}^m.
  8. So Λ\Lambda and Λ−1\Lambda^{-1} are Lipschitz, with constants CC and 1/α1 / \alpha. They satisfy the epsilon-delta condition, so they are continuous by continuity via open sets, and Λ\Lambda is a homeomorphism.
  9. Let K⊆VK \subseteq V and L=Λ−1(K)L = \Lambda^{-1}(K), so that K=Λ(L)K = \Lambda(L).
  10. KK is closed if and only if LL is closed. If KK is closed, LL is the preimage of KK under Λ\Lambda. If LL is closed, KK is the preimage of LL under Λ−1\Lambda^{-1}. Use continuity via closed sets.
  11. KK is bounded if and only if LL is bounded. By step 7, distances in KK are at most CC times distances in LL. Distances in LL are at most 1/α1 / \alpha times distances in KK.
  12. KK is compact if and only if LL is compact. Each is the image of the other under a continuous map, so continuous image of a compact set is compact applies both ways.
  13. By the Heine–Borel theorem in ℝm\mathbb{R}^m, LL is compact if and only if it is closed and bounded.
  14. By steps 10 to 13, KK is compact if and only if KK is closed and bounded.

Idea

Choosing a basis identifies VV with ℝn\mathbb{R}^n or ℝ2n\mathbb{R}^{2n}. By the equivalence of norms, this identification changes distances by at most fixed factors. Such a map preserves closed sets, bounded sets and compact sets, so the classical Heine–Borel theorem carries over.

Reading path

To understand this page from the ground up, read these 197 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 that open sets are the sets that are neighbourhoods of all their points, Proof of the commutativity of addition by induction, Proof of the Lebesgue number lemma by a finite cover of balls, Proof of the triangle inequality for norms, Proof of the Heine–Borel theorem by sequential compactness, Proof that a function is bijective iff it has a two-sided inverse, Proof that the reals form an ordered field, with the Cauchy sequence construction, Proof of continuity via closed sets, 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 that the coordinate map is a linear isomorphism, Proof of strong induction from ordinary induction, Proof of the existence of square roots of nonnegative reals, Proof that a continuous image of a compact set is compact, 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 equivalence of norms in finite dimension by compactness of the unit sphere, Proof that every spanning set contains a basis, by Zorn's lemma, Proof that closed sets contain their limits, Proof of Zorn's lemma, 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 of the monotone convergence theorem for sequences, Proof that open balls are open, Proof that a set is open if and only if its complement is closed, Proof of continuity via open sets in metric spaces.

  1. Basis concept
  2. Complex numbers object
  3. Construction of the reals from Cauchy sequences concept
  4. Coordinate space object
  5. Coordinate vector concept
  6. Definition by recursion concept
  7. Element definition
  8. Euclidean metric example
  9. Extended real number line object
  10. Integers object
  11. Linear isomorphism concept
  12. Linear map concept
  13. Mathematical induction concept
  14. Natural numbers object
  15. Norm concept
  16. Ordered field definition
  17. Peano axioms concept
  18. Proof of Zorn's lemma proof
  19. Proposition concept
  20. Rational numbers object
  21. Real numbers object
  22. Sequence definition
  23. Set bounded above definition
  24. Vector space definition
  25. p-metric on R^n example
  26. Real and imaginary parts definition
  27. Set definition
  28. Ring of integers statement
  29. Successor function definition
  30. Conjunction definition
  31. Disjunction definition
  32. Implication definition
  33. Predicate definition
  34. The reals form a field statement
  35. Real sequence definition
  36. Subsequence definition
  37. Infimum definition
  38. Supremum definition
  39. Linear combination definition
  40. Linear map definition
  41. Linear subspace definition
  42. Norm definition
  43. p-norm on R^n example
  44. Empty set object
  45. Family of sets definition
  46. Ordered pair definition
  47. Intersection definition
  48. Union definition
  49. Addition of natural numbers definition
  50. Existential quantifier definition
  51. Universal quantifier definition
  52. Bounded sequence definition
  53. Limit of a sequence definition
  54. Monotone sequence definition
  55. The successor function is injective statement
  56. Zero is not a successor statement
  57. The rationals form a field statement
  58. Linear independence definition
  59. Linear isomorphism definition
  60. Linear span definition
  61. Completeness axiom statement
  62. Cartesian product definition
  63. Union of a family of sets definition
  64. Subset definition
  65. Uniqueness quantifier definition
  66. Proof of the commutativity of addition by induction proof
  67. Convergent sequence definition
  68. Order on the natural numbers definition
  69. The rationals form an ordered field statement
  70. Spanning set definition
  71. Binary relation definition
  72. Topological space definition
  73. Universal set definition
  74. Order on the reals definition
  75. Commutativity of addition statement
  76. Finite-dimensional vector space definition
  77. Proof of strong induction from ordinary induction proof
  78. Basis definition
  79. Antisymmetric relation definition
  80. Reflexive relation definition
  81. Transitive relation definition
  82. Sequential compactness definition
  83. Function definition
  84. Subspace topology definition
  85. Complement definition
  86. Coordinate vector definition
  87. Strong induction statement
  88. Preorder definition
  89. Choice function definition
  90. Image of a set definition
  91. Preimage of a set definition
  92. Codomain definition
  93. Function composition definition
  94. Identity function definition
  95. Injective function definition
  96. Proof of the well-ordering principle from strong induction proof
  97. Metric space definition
  98. Partial order definition
  99. Axiom of choice statement
  100. Surjective function definition
  101. Left inverse definition
  102. Right inverse definition
  103. Well-ordering principle statement
  104. Closed ball definition
  105. Convergence of a sequence in a metric space definition
  106. Lipschitz map definition
  107. Open ball definition
  108. Triangle inequality for a metric statement
  109. Diameter of a set definition
  110. Maximal element definition
  111. Total order definition
  112. Upper bound definition
  113. Bijective function definition
  114. Metric topology definition
  115. Bounded set definition
  116. Proof that every sequence has a monotone subsequence, by peaks proof
  117. Chain definition
  118. Open set definition
  119. Inverse function definition
  120. Proof that a function is bijective iff it has a two-sided inverse proof
  121. Proof that the reals form an ordered field, with the Cauchy sequence construction proof
  122. Every sequence has a monotone subsequence statement
  123. Hausdorff space definition
  124. Open cover definition
  125. Proof that open sets are the sets that are neighbourhoods of all their points proof
  126. Continuous map of topological spaces definition
  127. Closed set definition
  128. Bijective iff it has a two-sided inverse statement
  129. Zorn's lemma statement
  130. Equivalent metrics definition
  131. Proof of the description of the open sets of a metric space proof
  132. The reals form an ordered field statement
  133. Compact space definition
  134. Open sets characterised by neighbourhoods statement
  135. Homeomorphism definition
  136. Proof that a set is open if and only if its complement is closed proof
  137. Equivalent norms definition
  138. Proof that the coordinate map is a linear isomorphism proof
  139. Open sets of a metric space statement
  140. Proof that every spanning set contains a basis, by Zorn's lemma proof
  141. Absolute value definition
  142. Proof of the existence of the infimum by negation proof
  143. Proof of the approximation property of the supremum proof
  144. Proof of the existence of square roots of nonnegative reals proof
  145. Continuity at a point of a topological space definition
  146. Compact set definition
  147. Complement of an open set is closed statement
  148. Proof that closed sets contain their limits proof
  149. Every spanning set contains a basis statement
  150. Proof of the epsilon-N definition of the limit of a sequence proof
  151. Proof that open balls are open proof
  152. Isomorphism with the coordinate space statement
  153. Existence of the infimum statement
  154. Approximation property of the supremum statement
  155. Existence of square roots of nonnegative reals statement
  156. Proof that compactness of a subset can be tested with open sets of the ambient space proof
  157. Proof of continuity via closed sets proof
  158. Closed sets contain their limits statement
  159. Epsilon-N definition of the limit of a sequence statement
  160. Open balls are open statement
  161. Square root definition
  162. Compactness via open covers statement
  163. Modulus of a complex number definition
  164. Continuity via closed sets statement
  165. Proof of epsilon-delta continuity at a point in metric spaces proof
  166. Proof of continuity via open sets in metric spaces proof
  167. Proof of the Lebesgue number lemma by a finite cover of balls proof
  168. Proof that metric spaces are Hausdorff proof
  169. Proof that subsequences of a convergent sequence converge to the same limit proof
  170. Proof of the monotone convergence theorem for sequences proof
  171. Proof that compact subsets of a Hausdorff space are closed proof
  172. Proof that a continuous image of a compact set is compact proof
  173. Lebesgue number lemma statement
  174. Epsilon-delta continuity in metric spaces statement
  175. Proof that compact subsets of a metric space are bounded proof
  176. Metric spaces are Hausdorff statement
  177. Proof that compactness and sequential compactness agree in metric spaces proof
  178. Subsequences of a convergent sequence converge to the same limit statement
  179. Proof of the triangle inequality for norms proof
  180. Monotone convergence theorem for sequences statement
  181. Compact subsets of a Hausdorff space are closed statement
  182. Continuous image of a compact set is compact statement
  183. Compactness and sequential compactness agree in metric spaces statement
  184. Continuity via open sets statement
  185. Compact subsets of a metric space are bounded statement
  186. Proof that a decreasing sequence bounded below converges proof
  187. Triangle inequality for norms statement
  188. Decreasing sequence bounded below converges statement
  189. Proof of the Bolzano–Weierstrass theorem by a monotone subsequence proof
  190. Bolzano–Weierstrass theorem statement
  191. Proof of the Heine–Borel theorem by sequential compactness proof
  192. Heine–Borel theorem statement
  193. Proof that a continuous real function on a compact set attains its bounds proof
  194. Continuous real function on a compact set attains its bounds statement
  195. Proof of the equivalence of norms in finite dimension by compactness of the unit sphere proof
  196. Equivalence of norms in finite dimension statement
  197. Proof of the Heine–Borel theorem in finite-dimensional normed spaces proof

Where this leads

10 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Heine%E2%80%93Borel_theorem, In the theory of topological vector spaces
About this page
TagG0485GZA7Y
URIm2://G0485GZA7Y
Kindproof
WritingW0 stub
MSC46B20
ProvesHeine–Borel theorem in finite-dimensional normed spaces
UsesHeine–Borel theorem, Equivalence of norms in finite dimension, Equivalent norms, Finite-dimensional vector space, Every spanning set contains a basis, Isomorphism with the coordinate space, Euclidean metric, Lipschitz map, Continuity via open sets, Continuity via closed sets, Continuous image of a compact set is compact, Compact set, Closed set, Bounded set, Homeomorphism
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.