Math 2.0

Functional analysis Proof

Proof of the equivalence of norms in finite dimension by compactness of the unit sphere

Builds on Equivalent normsFinite-dimensional vector spaceEvery spanning set contains a basisIsomorphism with the coordinate spaceTriangle inequality for normsEuclidean metricLipschitz mapContinuity via open setsContinuity via closed setsHeine–Borel theoremBounded setContinuous real function on a compact set attains its bounds

Proof

We compare each norm with the sup norm of the coordinates in a basis, and use compactness of the unit sphere of that norm.

  1. Let 𝕂\mathbb{K} be ℝ\mathbb{R} or ℂ\mathbb{C}. If V={0}V = \{0\}, each norm is the zero function, and any two norms are equivalent with c=C=1c = C = 1. Let V≠{0}V \neq \{0\}.
  2. VV is finite-dimensional, so a finite spanning set contains a basis e1,…,ene_1, \ldots, e_n, with n≥1n \ge 1. Write x=∑jaj(x)ejx = \sum_{j} a_j(x) e_j. The coordinates aj ⁣:V→𝕂a_j \colon V \to \mathbb{K} are linear, by the isomorphism with the coordinate space.
  3. Let ∥x∥∞=max⁡j∣aj(x)∣\|x\|_\infty = \max_j |a_j(x)|. This is a norm. It vanishes only when all coordinates vanish, that is, at x=0x = 0. Also ∥λx∥∞=∣λ∣∥x∥∞\|\lambda x\|_\infty = |\lambda| \|x\|_\infty, and ∣aj(x+y)∣≤∣aj(x)∣+∣aj(y)∣|a_j(x + y)| \le |a_j(x)| + |a_j(y)| gives the triangle inequality.
  4. Equivalence of norms is symmetric and transitive. If ca∥x∥∞≤∥x∥a≤Ca∥x∥∞c_a \|x\|_\infty \le \|x\|_a \le C_a \|x\|_\infty and cb∥x∥∞≤∥x∥b≤Cb∥x∥∞c_b \|x\|_\infty \le \|x\|_b \le C_b \|x\|_\infty, then (cb/Ca)∥x∥a≤∥x∥b≤(Cb/ca)∥x∥a(c_b / C_a) \|x\|_a \le \|x\|_b \le (C_b / c_a) \|x\|_a.
  5. So it suffices to fix a norm ∥⋅∥\|\cdot\| on VV and find 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.
  6. Upper bound. Let C=∑j∥ej∥>0C = \sum_j \|e_j\| > 0. By the triangle inequality, ∥x∥≤∑j∣aj(x)∣ ∥ej∥≤C∥x∥∞\|x\| \le \sum_j |a_j(x)| \, \|e_j\| \le C \|x\|_\infty.
  7. Let m=nm = n if 𝕂=ℝ\mathbb{K} = \mathbb{R} and m=2nm = 2n if 𝕂=ℂ\mathbb{K} = \mathbb{C}. Define Λ ⁣:ℝm→V\Lambda \colon \mathbb{R}^m \to V by Λ(t)=∑jtjej\Lambda(t) = \sum_j t_j e_j in the real case, and Λ(t)=∑j(t2j−1+i t2j)ej\Lambda(t) = \sum_j (t_{2j-1} + \mathrm{i} \, t_{2j}) e_j in the complex case.
  8. Λ\Lambda is a bijection and is additive. Let d2d_2 be the Euclidean metric on ℝm\mathbb{R}^m. Each coordinate of Λ(t)\Lambda(t) has modulus at most d2(t,0)d_2(t, 0), so ∥Λ(t)∥∞≤d2(t,0)\|\Lambda(t)\|_\infty \le d_2(t, 0).
  9. Let g(t)=∥Λ(t)∥g(t) = \|\Lambda(t)\| and h(t)=∥Λ(t)∥∞h(t) = \|\Lambda(t)\|_\infty. By the reverse triangle inequality in this result and steps 6 and 8, ∣g(t)−g(s)∣≤∥Λ(t−s)∥≤Cd2(t,s)|g(t) - g(s)| \le \|\Lambda(t - s)\| \le C d_2(t, s).
  10. In the same way, ∣h(t)−h(s)∣≤∥Λ(t−s)∥∞≤d2(t,s)|h(t) - h(s)| \le \|\Lambda(t - s)\|_\infty \le d_2(t, s). So gg and hh are Lipschitz.
  11. A Lipschitz function satisfies the epsilon-delta condition with δ=ε/(C+1)\delta = \varepsilon / (C + 1). By continuity via open sets, gg and hh are continuous on ℝm\mathbb{R}^m.
  12. Let Σ=h−1({1})\Sigma = h^{-1}(\{1\}). The set {1}\{1\} is closed in ℝ\mathbb{R}, so Σ\Sigma is closed, by continuity via closed sets.
  13. Σ\Sigma is bounded. For t∈Σt \in \Sigma, each ∣tk∣|t_k| is at most the modulus of a coordinate of Λ(t)\Lambda(t), so ∣tk∣≤1|t_k| \le 1. Then d2(t,0)≤md_2(t, 0) \le \sqrt{m} and d2(t,s)≤2md_2(t, s) \le 2\sqrt{m} for t,s∈Σt, s \in \Sigma.
  14. By the Heine–Borel theorem, Σ\Sigma is compact. It is nonempty, since Λ−1(e1)∈Σ\Lambda^{-1}(e_1) \in \Sigma.
  15. By this result, gg attains a minimum cc on Σ\Sigma, at some t∗∈Σt^\ast \in \Sigma. As h(t∗)=1h(t^\ast) = 1, Λ(t∗)≠0\Lambda(t^\ast) \neq 0, so c=∥Λ(t∗)∥>0c = \|\Lambda(t^\ast)\| > 0.
  16. Lower bound. Let x∈Vx \in V with x≠0x \neq 0, and let y=x/∥x∥∞y = x / \|x\|_\infty. Then ∥y∥∞=1\|y\|_\infty = 1, so y=Λ(t)y = \Lambda(t) with t∈Σt \in \Sigma, and ∥y∥=g(t)≥c\|y\| = g(t) \ge c.
  17. Multiplying by ∥x∥∞\|x\|_\infty gives ∥x∥≥c∥x∥∞\|x\| \ge c \|x\|_\infty. This also holds for x=0x = 0.
  18. With step 6, ∥⋅∥\|\cdot\| is equivalent to ∥⋅∥∞\|\cdot\|_\infty. By steps 4 and 5, any two norms on VV are equivalent.

Idea

Every norm is bounded above by a multiple of the sup norm of the coordinates, by the triangle inequality. The lower bound needs compactness: the unit sphere of the sup norm is closed and bounded in ℝm\mathbb{R}^m, so the continuous positive function ∥⋅∥\|\cdot\| has a positive minimum on it. Scaling then gives the bound everywhere.

Reading path

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

Where this leads

601 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Norm_(mathematics), Equivalence
About this page
TagKH1EAVWHQG
URIm2://KH1EAVWHQG
Kindproof
WritingW0 stub
MSC46B20
ProvesEquivalence of norms in finite dimension
UsesEquivalent norms, Finite-dimensional vector space, Every spanning set contains a basis, Isomorphism with the coordinate space, Triangle inequality for norms, Euclidean metric, Lipschitz map, Continuity via open sets, Continuity via closed sets, Heine–Borel theorem, Bounded set, Continuous real function on a compact set attains its bounds
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.