Definition 1 (Equivalent norms). Let X be a vector space and let ∥⋅∥a and ∥⋅∥b be two norms on X. These norms are equivalent if there exist C1,C2>0 such that
C1∥x∥a≤∥x∥b≤C2∥x∥afor every x∈X.
The first inequality means that Br∥⋅∥b(0)⊂Br/C1∥⋅∥a(0), and the second means that Br∥⋅∥a(0)⊂BC2r∥⋅∥b(0), for every r>0. Here Br∥⋅∥a(0)={x∈X:∥x∥a<r} and BC2r∥⋅∥b(0)={x∈X:∥x∥b<C2r} are balls of the distances induced by the two norms.
Example 2.(i) Let N be a positive integer. One can prove that, for all p,q∈[1,+∞], the norms ∥⋅∥p and ∥⋅∥q on RN of Example 5 (ii) of the tenth post are equivalent. (ii) Let −∞<a<b<+∞ and p∈[1,+∞]. The norms ∥⋅∥W1,p and ∥⋅∥W01,p on W01,p((a,b)) of Examples 19 and 21 of the tenth post are equivalent, as in Remark 6 of the previous post.
Remark 3. Let X be a vector space and let ∥⋅∥a and ∥⋅∥b be two norms on X. The norm ∥⋅∥a induces a distance, as in Definition 1 of the tenth post, hence balls and a topology τa, as in Definition 19 of the first post. In the same way ∥⋅∥b induces a topology τb. If ∥⋅∥a is equivalent to ∥⋅∥b, then τa=τb. In particular: (i)(X,∥⋅∥a) and (X,∥⋅∥b) also have the same closed sets and the same compact sets; (ii) a function f:X→R is continuous as a map f:(X,∥⋅∥a)→R if and only if it is continuous as a map f:(X,∥⋅∥b)→R.
Proof (sketch). Only the inclusion τb⊂τa is proved, with C1,C2>0 as in Definition 1. Let U be open in τb. For every x∈U there exists r>0 such that Br∥⋅∥b(x)⊂U. Hence Br/C2∥⋅∥a(x)⊂Br∥⋅∥b(x)⊂U, and U is open in τa. Indeed, if ∥y−x∥a<r/C2, then ∥y−x∥b≤C2∥y−x∥a<r by Definition 1. ■
Example 4. Let X=C([−1,1]), with the norm ∥⋅∥∞ of Example 5 (iii) of the tenth post and the norm ∥⋅∥1.
(1) For every f∈C([−1,1]),
∥f∥1=∫−11∣f∣dλ≤2∥f∥∞.
(2) There exists no C>0 such that ∥f∥∞≤C∥f∥1 for every f∈C([−1,1]).
To prove Example 4 (2), for every integer n≥1 let fn∈C([−1,1]) be equal to 0 on [−1,0], linear on [0,1/n] and equal to 1 on [1/n,1], as in Figure 1. Let H be equal to 0 on [−1,0] and to 1 on (0,1].
Figure 1. The drawing of Example 4: on the left the function fn for the n of the slider and, dashed where it differs from fn, the function H, with the region between the two graphs shaded, of area ∥fn−H∥1; on the right the function H.
Then, as in Example 10 of the previous post, ∥fn−H∥1→0 as n→∞. Hence (fn) is Cauchy in L1, as in the proof of Remark 18 of the tenth post: for every ε>0 there exists N such that ∥fn−fm∥1<ε for all n,m≥N.
If there were C>0 such that ∥f∥∞≤C∥f∥1 for every f∈C([−1,1]), then (fn) would be Cauchy with respect to ∥⋅∥∞, and (fn) should converge uniformly to a continuous function.
This is false, so no such C exists. In detail, a uniform limit is also a pointwise limit, and fn(x) tends to H(x) at every x∈[−1,1], while H is not continuous at 0.
where the 1 is in the i-th place. The map ϕ is an isomorphism between X and RN, so any finite-dimensional vector space can be identified with RN.
Theorem 6. Let X be a vector space of finite dimension and let ∥⋅∥a and ∥⋅∥b be two norms on X. Then ∥⋅∥a and ∥⋅∥b are equivalent.
Corollary 7. Let X be a vector space of finite dimension and let ∥⋅∥ be a norm on X. Then a set K⊂X is compact if and only if K is closed and bounded.
Proof (sketch). By Theorem 6, ∥⋅∥ is equivalent to the Euclidean norm x↦∣ϕ(x)∣, with ϕ as in Remark 5. Hence, by Remark 3 (i), K is compact in (X,∥⋅∥) if and only if K is compact with respect to the Euclidean topology. In detail, by the Heine–Borel theorem, Theorem 15 of the first post, via ϕ, this holds if and only if K is closed and bounded for the Euclidean norm, hence for ∥⋅∥ by Remark 3 (i) and Definition 1. ■
Definition 8 (Dense subset). Let (X,d) be a metric space. A subset D⊂X is dense if, as in Figure 2,
∀x0∈X∀r>0∃x∈D such that d(x,x0)<r, that is, x∈Br(x0).
Figure 2. The drawing of Definition 8: the ball Br(x0) and a point x∈D in it.
Remark 9. Let (X,d) be a metric space and let D⊂X. The following are equivalent. (i)D is dense. (ii) For every x0∈X there exists (xn)⊂D such that xn→x0 in X. (iii)D=X, where D is the closure of D of Definition 12 (i) of the first post.
Example 10. The set Q is dense in R, with the distance d(x,y)=∣x−y∣.
Example 11. Let N be a positive integer and let V be a subspace of RN with V=RN. (i)V is closed in RN. (ii)(V,∥⋅∥2) is a Banach space. (iii)V is not dense. (iv) Let x∈RN∖V. Then d(x,V)=infv∈V∣x−v∣>0, and there exists vˉ∈V such that ∣x−vˉ∣=d(x,V), as in Figure 3: vˉ is the closest point to x in V.
Figure 3. The drawing of Example 11, an instance with N=2 and V a line: the point x of the sliders, the point vˉ of V closest to x, at distance ∣x−vˉ∣=d(x,V), and a ball around a point x0 that does not meet V.
Example 12. Consider C([0,1])⊂L1((0,1)), as in Remark 16 of the sixth post, that is, (C([0,1]),∥⋅∥1)⊂(L1((0,1)),∥⋅∥1). Here V=C([0,1]) is a subspace of L1, and V=L1. (i)(V,∥⋅∥1) is not a Banach space, as in Example 10 of the previous post. (ii)V⊂L1 is not closed. (iii)V is dense in L1, by Theorem 13.
Theorem 13. For every f∈L1((0,1)) there exists (fn)⊂V=C([0,1]) such that fn→f in L1((0,1)).
Proof (sketch). The idea is drawn in Figure 4. We know that f can be approximated by simple functions, as in Proposition 17 of the fourth post, and any simple function can be approximated by continuous functions. ■
Figure 4. The drawing of the proof of Theorem 13, an instance: a function f∈L1, below it a simple function constant on three intervals, and a continuous function fn close to the simple function.
In particular, by Theorem 13, if f∈L1∖V, then d(f,V)=infg∈V∥f−g∥1=0, and it makes no sense to speak of the closest point to f in V.
Remark 14. Let (X,∥⋅∥) be a normed space. (1) If V⊂X is a subspace and dimV<+∞, then V is closed. (2) If (X,∥⋅∥) is a Banach space and V⊂X is a subspace, then (V,∥⋅∥) is a Banach space if and only if V⊂X is closed.
Remark 15 (Dense subspaces).(1) (Stone–Weierstrass) Let −∞<a<b<+∞. The subspace V of the polynomials is dense in (C([a,b]),∥⋅∥∞). (2) Let 1≤p<+∞ and let U⊂RN be open, with the Lebesgue measure. Then the set of the simple functions that belong to Lp(U) is dense in Lp(U),Cc(U) is dense in Lp(U) and Cc∞(U) is dense in Lp(U). Here Cc(U) and Cc∞(U) are defined as in the notation of the fifth post, with U in place of (a,b).
Example 16.Remark 15 (2) is false for p=+∞:C([−1,1])⊂L∞((−1,1)) is not dense.
To prove Example 16, let H be the function of Example 4 and let B1/3(H)={f∈L∞((−1,1)):∥f−H∥∞<1/3}. We claim that f∈/C([−1,1]) for every f∈B1/3(H), as in Figure 5.
Figure 5. The drawing of Example 16: the function H, the dashed levels −1/3 and 1/3 over (−1,0) and 2/3 and 4/3 over (0,1), and between them a function f of B1/3(H), an instance. At 0 a bracket marks the gap between the levels 1/3 and 2/3.
If f∈B1/3(H), then
(i)(ii)−31≤f≤3132≤f≤34almost everywhere on (−1,0),almost everywhere on (0,1),
hence f∈/C([−1,1]).
Suppose that f has a continuous representative, still written f. Then
x→0−limf(x)=x→0+limf(x),
where the left-hand side is at most 1/3 and the right-hand side is at least 2/3, which is impossible.
Remark 17. Let ∥⋅∥ be a norm on RN, a space of finite dimension. Then a set K⊂RN is compact if and only if K is closed and bounded. In particular, the closed ball B1(0)={x∈RN:∥x∥≤1} is compact.
Theorem 18 (Riesz). Let (X,∥⋅∥) be a normed space and let B1(0)={x∈X:∥x∥≤1}. Then B1(0) is compact if and only if dimX<+∞. In particular, B1(0) is never compact in a normed space of infinite dimension.
Proof (complete). If dimX<+∞, then B1(0) is compact, as in Remark 17. Indeed, B1(0) is closed and bounded, hence compact by Corollary 7.
Conversely, let B1(0) be compact. For x∈X and a subspace M of X let d(x,M)=infm∈M∥x−m∥.
Step 1. Let M⊂X be a closed subspace with M=X. Then for every ε>0 there exists v∈X such that, as in Figure 6,
∥v∥=1andd(v,M)≥1−ε.
Figure 6. The drawing of Step 1 in the proof of Theorem 18, an instance in R2 with the Euclidean norm: a closed subspace M, a line, the dashed circle of the vectors of norm 1, and a vector v on it with d(v,M)=1.
Proof of Step 1. Since M=X, there exists x0∈X∖M. Notice that d(x0,M)>0. Suppose, by contradiction, that d(x0,M)=0. Then there exists (xn)⊂M such that d(x0,xn)→0, that is, (xn) converges to x0∈X. Since M is closed, x0∈M by Lemma 20 (i) of the first post, but x0∈X∖M, a contradiction.
Now fix ε∈(0,1). By the definition of the distance d(x0,M), there exists m0∈M such that
0<∥x0−m0∥≤1−ε1d(x0,M).
Indeed, the right-hand side is larger than the infimum d(x0,M)>0, because 1/(1−ε)>1, and ∥x0−m0∥>0 because x0 is not in M. Take, as in Figure 7,
v:=∥x0−m0∥x0−m0.
Figure 7. The drawing of the proof of Step 1, an instance in R2 with the Euclidean norm: the point x0∈/M, the thick part of M where ∥x0−m∥≤d(x0,M)/(1−ε), a point m0 in it, the vector v and the dashed line at distance 1−ε from M. The sliders set ε and the position of m0.
The first inequality holds because m0+m∥x0−m0∥ belongs to the subspace M, so the norm in the second line is that of x0 minus a vector of M, which is at least d(x0,M). The second inequality holds because ∥x0−m0∥≤d(x0,M)/(1−ε). We got ∥v−m∥≥1−ε for every m∈M, hence d(v,M)≥1−ε.
Step 2. We prove that dimX<+∞. Suppose, by contradiction, that dimX=+∞. We construct inductively a sequence of vectors.
(i) Fix v0∈X with ∥v0∥=1 and let M0=Span(v0)={αv0:α∈R}. Then M0=X, because M0 has dimension 1 and X has infinite dimension, and M0 is closed by Remark 14 (1), because it has finite dimension.
(ii) Apply Step 1 to M=M0 with ε=1/2. It gives v1∈X with ∥v1∥=1 and d(v1,M0)≥1−ε=1/2. Now consider M1=Span(v0,v1). Then M1=X, because M1 has dimension 2 and X has infinite dimension, and M1 is closed, because it has finite dimension. So the construction can be iterated.
(iii) Let Mn−1=Span(v0,v1,…,vn−1) be given, of finite dimension, closed and different from X. Then Step 1 gives vn∈X such that ∥vn∥=1 and d(vn,Mn−1)≥1/2.
In the end we found vectors vn of X such that ∥vn∥=1 for every n and d(vn,Mn−1)≥1/2 for every n≥1. However, ∥vn∥=1 for every n gives (vn)⊂B1(0), which is compact by assumption. Hence, by Lemma 20 (ii) of the first post, there exist a subsequence (vnk) and w∈X such that vnk→w in X as k→∞. That is, d(w,vnk)→0.
Therefore (vnk) is Cauchy in X: for every ε0>0 there exists N such that d(vnk,vnk−1)<ε0 for every k≥N. But, for every k≥1,
d(vnk,vnk−1)≥d(vnk,Mnk−1)≥21,
because vnk−1∈Mnk−1⊂Mnk−1. This is a contradiction for ε0<1/2.■
Let −∞<a<b<+∞. A family F of functions of C([a,b]) is bounded if there exists R>0 such that ∥f∥∞<R for every f∈F. It is uniformly equicontinuous if for every ε>0 there exists δ>0 such that
x,y∈[a,b],∣x−y∣<δ⟹∣f(x)−f(y)∣<εfor every f∈F.
Theorem 19 (Ascoli–Arzelà). Let −∞<a<b<+∞, consider (C([a,b]),∥⋅∥∞) and let F⊂C([a,b]). Then F is precompact, that is, F is compact, as in Definition 14 of the first post, if and only if F is bounded and uniformly equicontinuous.
In particular, let (fn)⊂C([a,b]) be such that supn∥fn∥∞<+∞ and F={fn:n∈N} is uniformly equicontinuous. Then there exist a subsequence (fnk) and g∈C([a,b]) such that fnk→g in ∥⋅∥∞ as k→∞.
Remark 20. Let −∞<a<b<+∞. (i) Let (fn)⊂C([a,b]) be equilipschitz: there exists L>0 such that, for every n and all x and y in [a,b],∣fn(x)−fn(y)∣≤L∣x−y∣. Then (fn) is uniformly equicontinuous. (ii) Let p∈(1,+∞] and let (fn)⊂W1,p((a,b)) be bounded in W1,p, that is, supn∥fn∥W1,p<+∞, with the norm of Example 19 of the tenth post. Then (fn) is bounded in ∥⋅∥∞ and uniformly equicontinuous, by estimates analogous to those of Example 4 and Remark 6 of the previous post, so there exists a subsequence (fnk) that converges uniformly, by Theorem 19. Here each fn is identified with its absolutely continuous representative, as in Example 21 of the tenth post.
Proof (sketch). Only (i) is proved. Let ε>0 and choose δ>0 with δ<ε/L. Then, for every n and all x,y∈[a,b] with ∣x−y∣<δ,