Alessandro Palliccia

Real and Functional Analysis

Equivalent norms, density and compactness in infinite dimensions

1,751 words, , published

The lecture studies the topology of normed spaces of infinite dimension.

Equivalent norms

Definition 1 (Equivalent norms). Let XX be a vector space and let ∥⋅∥a\|\cdot\|_a and ∥⋅∥b\|\cdot\|_b be two norms on X.{X.} These norms are equivalent if there exist C1,C2>0{C_1, C_2 > 0} such that

C1∥x∥a≤∥x∥b≤C2∥x∥afor every x∈X.C_1 \|x\|_a \le \|x\|_b \le C_2 \|x\|_a \qquad \text{for every } x \in X.

The first inequality means that Br∥⋅∥b(0)⊂Br/C1∥⋅∥a(0),{B_r^{\|\cdot\|_b}(0) \subset B_{r/C_1}^{\|\cdot\|_a}(0),} and the second means that Br∥⋅∥a(0)⊂BC2r∥⋅∥b(0),{B_r^{\|\cdot\|_a}(0) \subset B_{C_2 r}^{\|\cdot\|_b}(0),} for every r>0.{r > 0.} Here Br∥⋅∥a(0)={x∈X:∥x∥a<r}{B_r^{\|\cdot\|_a}(0) = \{ x \in X : \|x\|_a < r \}} and BC2r∥⋅∥b(0)={x∈X:∥x∥b<C2r}{B_{C_2 r}^{\|\cdot\|_b}(0) = \{ x \in X : \|x\|_b < C_2 r \}} are balls of the distances induced by the two norms.

Example 2. (i) Let NN be a positive integer. One can prove that, for all p,q∈[1,+∞],{p, q \in [1, +\infty],} the norms ∥⋅∥p\|\cdot\|_p and ∥⋅∥q\|\cdot\|_q on RN\mathbb{R}^N of Example 5 (ii) of the tenth post are equivalent.
(ii) Let −∞<a<b<+∞{-\infty < a < b < +\infty} and p∈[1,+∞].{p \in [1, +\infty].} The norms ∥⋅∥W1,p\|\cdot\|_{W^{1,p}} and ∥⋅∥W01,p\|\cdot\|_{W_0^{1,p}} on W01,p((a,b)){W_0^{1,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 XX be a vector space and let ∥⋅∥a\|\cdot\|_a and ∥⋅∥b\|\cdot\|_b be two norms on X.{X.} The norm ∥⋅∥a\|\cdot\|_a induces a distance, as in Definition 1 of the tenth post, hence balls and a topology τa,{\tau_a,} as in Definition 19 of the first post. In the same way ∥⋅∥b\|\cdot\|_b induces a topology τb.{\tau_b.} If ∥⋅∥a\|\cdot\|_a is equivalent to ∥⋅∥b,{\|\cdot\|_b,} then τa=τb.{\tau_a = \tau_b.} In particular:
(i) (X,∥⋅∥a){(X, \|\cdot\|_a)} and (X,∥⋅∥b){(X, \|\cdot\|_b)} also have the same closed sets and the same compact sets;
(ii) a function f ⁣:X→R{f \colon X \to \mathbb{R}} is continuous as a map f ⁣:(X,∥⋅∥a)→R{f \colon (X, \|\cdot\|_a) \to \mathbb{R}} if and only if it is continuous as a map f ⁣:(X,∥⋅∥b)→R.{f \colon (X, \|\cdot\|_b) \to \mathbb{R}.}

Proof (sketch). Only the inclusion τb⊂τa{\tau_b \subset \tau_a} is proved, with C1,C2>0{C_1, C_2 > 0} as in Definition 1. Let UU be open in τb.{\tau_b.} For every x∈U{x \in U} there exists r>0{r > 0} such that Br∥⋅∥b(x)⊂U.{B_r^{\|\cdot\|_b}(x) \subset U.} Hence Br/C2∥⋅∥a(x)⊂Br∥⋅∥b(x)⊂U,{B_{r/C_2}^{\|\cdot\|_a}(x) \subset B_r^{\|\cdot\|_b}(x) \subset U,} and UU is open in τa.{\tau_a.} Indeed, if ∥y−x∥a<r/C2,{\|y - x\|_a < r/C_2,} then ∥y−x∥b≤C2∥y−x∥a<r{\|y - x\|_b \le C_2 \|y - x\|_a < r} by Definition 1. ■\blacksquare

Two norms on C([−1,1])C([-1, 1])

Example 4. Let X=C([−1,1]),{X = C([-1, 1]),} with the norm ∥⋅∥∞\|\cdot\|_\infty of Example 5 (iii) of the tenth post and the norm ∥⋅∥1.{\|\cdot\|_1.}

(1) For every f∈C([−1,1]),{f \in C([-1, 1]),}

∥f∥1=∫−11∣f∣ dλ≤2∥f∥∞.\|f\|_1 = \int_{-1}^{1} |f| \, d\lambda \le 2 \|f\|_\infty.

(2) There exists no C>0{C > 0} such that ∥f∥∞≤C∥f∥1{\|f\|_\infty \le C \|f\|_1} for every f∈C([−1,1]).{f \in C([-1, 1]).}

To prove Example 4 (2), for every integer n≥1{n \ge 1} let fn∈C([−1,1]){f_n \in C([-1, 1])} be equal to 0 on [−1,0],{[-1, 0],} linear on [0,1/n][0, 1/n] and equal to 1 on [1/n,1],{[1/n, 1],} as in Figure 1. Let HH be equal to 0 on [−1,0][-1, 0] and to 1 on (0,1].{(0, 1].}

−1101−11011/nfnH

Figure 1. The drawing of Example 4: on the left the function fnf_n for the nn of the slider and, dashed where it differs from fn,{f_n,} the function H,{H,} with the region between the two graphs shaded, of area ∥fn−H∥1;{\|f_n - H\|_1;} on the right the function H.{H.}

Then, as in Example 10 of the previous post, ∥fn−H∥1→0{\|f_n - H\|_1 \to 0} as n→∞.{n \to \infty.} Hence (fn)(f_n) is Cauchy in L1,{L^1,} as in the proof of Remark 18 of the tenth post: for every ε>0{\varepsilon > 0} there exists NN such that ∥fn−fm∥1<ε{\|f_n - f_m\|_1 < \varepsilon} for all n,m≥N.{n, m \ge N.}

If there were C>0{C > 0} such that ∥f∥∞≤C∥f∥1{\|f\|_\infty \le C \|f\|_1} for every f∈C([−1,1]),{f \in C([-1, 1]),} then (fn)(f_n) would be Cauchy with respect to ∥⋅∥∞,{\|\cdot\|_\infty,} and (fn)(f_n) should converge uniformly to a continuous function.

This is false, so no such CC exists. In detail, a uniform limit is also a pointwise limit, and fn(x)f_n(x) tends to H(x)H(x) at every x∈[−1,1],{x \in [-1, 1],} while HH is not continuous at 0.

Spaces of finite dimension

Remark 5. Let XX be a vector space of finite dimension, that is, with a basis B={e1,…,eN}⊂X.{\mathcal{B} = \{ e_1, \dots, e_N \} \subset X.} Then one can consider

ϕ ⁣:X→RN,ei↦(0,…,0,1,0,…,0),ϕ(a1e1+⋯+aNeN)=(a1,…,aN)∈RN,\begin{aligned} \phi \colon X &\to \mathbb{R}^N, \\ e_i &\mapsto (0, \dots, 0, 1, 0, \dots, 0), \\ \phi(a_1 e_1 + \dots + a_N e_N) &= (a_1, \dots, a_N) \in \mathbb{R}^N, \end{aligned}

where the 1 is in the ii-th place. The map ϕ\phi is an isomorphism between XX and RN,{\mathbb{R}^N,} so any finite-dimensional vector space can be identified with RN.{\mathbb{R}^N.}

Theorem 6. Let XX be a vector space of finite dimension and let ∥⋅∥a\|\cdot\|_a and ∥⋅∥b\|\cdot\|_b be two norms on X.{X.} Then ∥⋅∥a\|\cdot\|_a and ∥⋅∥b\|\cdot\|_b are equivalent.

Corollary 7. Let XX be a vector space of finite dimension and let ∥⋅∥\|\cdot\| be a norm on X.{X.} Then a set K⊂X{K \subset X} is compact if and only if KK is closed and bounded.

Proof (sketch). By Theorem 6, ∥⋅∥\|\cdot\| is equivalent to the Euclidean norm x↦∣ϕ(x)∣,{x \mapsto |\phi(x)|,} with ϕ\phi as in Remark 5. Hence, by Remark 3 (i), KK is compact in (X,∥⋅∥){(X, \|\cdot\|)} if and only if KK is compact with respect to the Euclidean topology. In detail, by the Heine–Borel theorem, Theorem 15 of the first post, via ϕ,{\phi,} this holds if and only if KK is closed and bounded for the Euclidean norm, hence for ∥⋅∥\|\cdot\| by Remark 3 (i) and Definition 1. ■\blacksquare

Subspaces and density

Definition 8 (Dense subset). Let (X,d){(X, d)} be a metric space. A subset D⊂X{D \subset 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).\forall x_0 \in X \quad \forall r > 0 \quad \exists x \in D \ \text{ such that } \ d(x, x_0) < r, \ \text{ that is, } \ x \in B_r(x_0).
rx0x ∈ DBr(x0)

Figure 2. The drawing of Definition 8: the ball Br(x0)B_r(x_0) and a point x∈D{x \in D} in it.

Remark 9. Let (X,d){(X, d)} be a metric space and let D⊂X.{D \subset X.} The following are equivalent.
(i) DD is dense.
(ii) For every x0∈X{x_0 \in X} there exists (xn)⊂D{(x_n) \subset D} such that xn→x0{x_n \to x_0} in X.{X.}
(iii) D‾=X,{\overline{D} = X,} where D‾\overline{D} is the closure of DD of Definition 12 (i) of the first post.

Example 10. The set Q\mathbb{Q} is dense in R,{\mathbb{R},} with the distance d(x,y)=∣x−y∣.{d(x, y) = |x - y|.}

Example 11. Let NN be a positive integer and let VV be a subspace of RN\mathbb{R}^N with V≠RN.{V \neq \mathbb{R}^N.}
(i) VV is closed in RN.{\mathbb{R}^N.}
(ii) (V,∥⋅∥2){(V, \|\cdot\|_2)} is a Banach space.
(iii) VV is not dense.
(iv) Let x∈RN∖V.{x \in \mathbb{R}^N \setminus V.} Then d(x,V)=inf⁡v∈V∣x−v∣>0,{d(x, V) = \inf_{v \in V} |x - v| > 0,} and there exists vˉ∈V{\bar{v} \in V} such that ∣x−vˉ∣=d(x,V),{|x - \bar{v}| = d(x, V),} as in Figure 3: vˉ\bar{v} is the closest point to xx in V.{V.}

Vx0xvd(x, V)

Figure 3. The drawing of Example 11, an instance with N=2{N = 2} and VV a line: the point xx of the sliders, the point vˉ\bar{v} of VV closest to x,{x,} at distance ∣x−vˉ∣=d(x,V),{|x - \bar{v}| = d(x, V),} and a ball around a point x0x_0 that does not meet V.{V.}

The continuous functions in L1((0,1))L^1((0, 1))

Example 12. Consider C([0,1])⊂L1((0,1)),{C([0, 1]) \subset L^1((0, 1)),} as in Remark 16 of the sixth post, that is, (C([0,1]),∥⋅∥1)⊂(L1((0,1)),∥⋅∥1).{(C([0, 1]), \|\cdot\|_1) \subset (L^1((0, 1)), \|\cdot\|_1).} Here V=C([0,1]){V = C([0, 1])} is a subspace of L1,{L^1,} and V≠L1.{V \neq L^1.}
(i) (V,∥⋅∥1){(V, \|\cdot\|_1)} is not a Banach space, as in Example 10 of the previous post.
(ii) V⊂L1{V \subset L^1} is not closed.
(iii) VV is dense in L1,{L^1,} by Theorem 13.

Theorem 13. For every f∈L1((0,1)){f \in L^1((0, 1))} there exists (fn)⊂V=C([0,1]){(f_n) \subset V = C([0, 1])} such that fn→f{f_n \to f} in L1((0,1)).{L^1((0, 1)).}

Proof (sketch). The idea is drawn in Figure 4. We know that ff can be approximated by simple functions, as in Proposition 17 of the fourth post, and any simple function can be approximated by continuous functions. ■\blacksquare

f ∈ L1fn

Figure 4. The drawing of the proof of Theorem 13, an instance: a function f∈L1,{f \in L^1,} below it a simple function constant on three intervals, and a continuous function fnf_n close to the simple function.

In particular, by Theorem 13, if f∈L1∖V,{f \in L^1 \setminus V,} then d(f,V)=inf⁡g∈V∥f−g∥1=0,{d(f, V) = \inf_{g \in V} \|f - g\|_1 = 0,} and it makes no sense to speak of the closest point to ff in V.{V.}

Closed and dense subspaces

Remark 14. Let (X,∥⋅∥){(X, \|\cdot\|)} be a normed space.
(1) If V⊂X{V \subset X} is a subspace and dim⁡V<+∞,{\dim V < +\infty,} then VV is closed.
(2) If (X,∥⋅∥){(X, \|\cdot\|)} is a Banach space and V⊂X{V \subset X} is a subspace, then (V,∥⋅∥){(V, \|\cdot\|)} is a Banach space if and only if V⊂X{V \subset X} is closed.

Remark 15 (Dense subspaces). (1) (Stone–Weierstrass) Let −∞<a<b<+∞.{-\infty < a < b < +\infty.} The subspace VV of the polynomials is dense in (C([a,b]),∥⋅∥∞).{(C([a, b]), \|\cdot\|_\infty).}
(2) Let 1≤p<+∞{1 \le p < +\infty} and let U⊂RN{U \subset \mathbb{R}^N} be open, with the Lebesgue measure. Then the set of the simple functions that belong to Lp(U)L^p(U) is dense in Lp(U),{L^p(U),} Cc(U)C_c(U) is dense in Lp(U)L^p(U) and Cc∞(U)C_c^\infty(U) is dense in Lp(U).{L^p(U).} Here Cc(U)C_c(U) and Cc∞(U)C_c^\infty(U) are defined as in the notation of the fifth post, with UU in place of (a,b).{(a, b).}

The continuous functions in L∞((−1,1))L^\infty((-1, 1))

Example 16. Remark 15 (2) is false for p=+∞:{p = +\infty{:}} C([−1,1])⊂L∞((−1,1)){C([-1, 1]) \subset L^\infty((-1, 1))} is not dense.

To prove Example 16, let HH be the function of Example 4 and let B1/3(H)={f∈L∞((−1,1)):∥f−H∥∞<1/3}.{B_{1/3}(H) = \{ f \in L^\infty((-1, 1)) : \|f - H\|_\infty < 1/3 \}.} We claim that f∉C([−1,1]){f \notin C([-1, 1])} for every f∈B1/3(H),{f \in B_{1/3}(H),} as in Figure 5.

1/3−1/34/32/3−111Hf

Figure 5. The drawing of Example 16: the function H,{H,} the dashed levels −1/3-1/3 and 1/31/3 over (−1,0){(-1, 0)} and 2/32/3 and 4/34/3 over (0,1),{(0, 1),} and between them a function ff of B1/3(H),{B_{1/3}(H),} an instance. At 0 a bracket marks the gap between the levels 1/31/3 and 2/3.{2/3.}

If f∈B1/3(H),{f \in B_{1/3}(H),} then

(i)−13≤f≤13almost everywhere on (−1,0),(ii)23≤f≤43almost everywhere on (0,1),\begin{aligned} &\text{(i)} && {-\tfrac{1}{3}} \le f \le \tfrac{1}{3} && \text{almost everywhere on } (-1, 0), \\ &\text{(ii)} && \tfrac{2}{3} \le f \le \tfrac{4}{3} && \text{almost everywhere on } (0, 1), \end{aligned}

hence f∉C([−1,1]).{f \notin C([-1, 1]).}

Suppose that ff has a continuous representative, still written f.{f.} Then

lim⁡x→0−f(x)=lim⁡x→0+f(x),\lim_{x \to 0^-} f(x) = \lim_{x \to 0^+} f(x),

where the left-hand side is at most 1/31/3 and the right-hand side is at least 2/3,{2/3,} which is impossible.

Compactness

Remark 17. Let ∥⋅∥\|\cdot\| be a norm on RN,{\mathbb{R}^N,} a space of finite dimension. Then a set K⊂RN{K \subset \mathbb{R}^N} is compact if and only if KK is closed and bounded. In particular, the closed ball B‾1(0)={x∈RN:∥x∥≤1}{\overline{B}_1(0) = \{ x \in \mathbb{R}^N : \|x\| \le 1 \}} is compact.

Theorem 18 (Riesz). Let (X,∥⋅∥){(X, \|\cdot\|)} be a normed space and let B‾1(0)={x∈X:∥x∥≤1}.{\overline{B}_1(0) = \{ x \in X : \|x\| \le 1 \}.} Then B‾1(0)\overline{B}_1(0) is compact if and only if dim⁡X<+∞.{\dim X < +\infty.} In particular, B‾1(0)\overline{B}_1(0) is never compact in a normed space of infinite dimension.

Proof (complete). If dim⁡X<+∞,{\dim X < +\infty,} then B‾1(0)\overline{B}_1(0) is compact, as in Remark 17. Indeed, B‾1(0)\overline{B}_1(0) is closed and bounded, hence compact by Corollary 7.

Conversely, let B‾1(0)\overline{B}_1(0) be compact. For x∈X{x \in X} and a subspace MM of XX let d(x,M)=inf⁡m∈M∥x−m∥.{d(x, M) = \inf_{m \in M} \|x - m\|.}

Step 1. Let M⊂X{M \subset X} be a closed subspace with M≠X.{M \neq X.} Then for every ε>0{\varepsilon > 0} there exists v∈X{v \in X} such that, as in Figure 6,

∥v∥=1andd(v,M)≥1−ε.\|v\| = 1 \qquad \text{and} \qquad d(v, M) \ge 1 - \varepsilon.
Mv

Figure 6. The drawing of Step 1 in the proof of Theorem 18, an instance in R2\mathbb{R}^2 with the Euclidean norm: a closed subspace M,{M,} a line, the dashed circle of the vectors of norm 1,{1,} and a vector vv on it with d(v,M)=1.{d(v, M) = 1.}

Proof of Step 1. Since M≠X,{M \neq X,} there exists x0∈X∖M.{x_0 \in X \setminus M.} Notice that d(x0,M)>0.{d(x_0, M) > 0.} Suppose, by contradiction, that d(x0,M)=0.{d(x_0, M) = 0.} Then there exists (xn)⊂M{(x_n) \subset M} such that d(x0,xn)→0,{d(x_0, x_n) \to 0,} that is, (xn)(x_n) converges to x0∈X.{x_0 \in X.} Since MM is closed, x0∈M{x_0 \in M} by Lemma 20 (i) of the first post, but x0∈X∖M,{x_0 \in X \setminus M,} a contradiction.

Now fix ε∈(0,1).{\varepsilon \in (0, 1).} By the definition of the distance d(x0,M),{d(x_0, M),} there exists m0∈M{m_0 \in M} such that

0<∥x0−m0∥≤11−ε d(x0,M).0 < \|x_0 - m_0\| \le \frac{1}{1 - \varepsilon} \, d(x_0, M).

Indeed, the right-hand side is larger than the infimum d(x0,M)>0,{d(x_0, M) > 0,} because 1/(1−ε)>1,{1/(1 - \varepsilon) > 1,} and ∥x0−m0∥>0{\|x_0 - m_0\| > 0} because x0x_0 is not in M.{M.} Take, as in Figure 7,

v:=x0−m0∥x0−m0∥.v := \frac{x_0 - m_0}{\|x_0 - m_0\|}.
M1 − εx0m0v0

Figure 7. The drawing of the proof of Step 1, an instance in R2\mathbb{R}^2 with the Euclidean norm: the point x0∉M,{x_0 \notin M,} the thick part of MM where ∥x0−m∥≤d(x0,M)/(1−ε),{\|x_0 - m\| \le d(x_0, M)/(1 - \varepsilon),} a point m0m_0 in it, the vector vv and the dashed line at distance 1−ε{1 - \varepsilon} from M.{M.} The sliders set ε\varepsilon and the position of m0.{m_0.}

Then ∥v∥=1,{\|v\| = 1,} and for every m∈M{m \in M}

∥v−m∥=∥x0−m0∥x0−m0∥−m∥=1∥x0−m0∥ ∥ x0−m0−m ∥x0−m0∥ ∥≥1∥x0−m0∥ d(x0,M)≥1−εd(x0,M) d(x0,M)=1−ε.\begin{aligned} \|v - m\| &= \Big\| \frac{x_0 - m_0}{\|x_0 - m_0\|} - m \Big\| \\ &= \frac{1}{\|x_0 - m_0\|} \, \Bigl\|\, x_0 - m_0 - m \, \|x_0 - m_0\| \,\Bigr\| \\ &\ge \frac{1}{\|x_0 - m_0\|} \, d(x_0, M) \\ &\ge \frac{1 - \varepsilon}{d(x_0, M)} \, d(x_0, M) = 1 - \varepsilon. \end{aligned}

The first inequality holds because m0+m ∥x0−m0∥{m_0 + m \, \|x_0 - m_0\|} belongs to the subspace M,{M,} so the norm in the second line is that of x0x_0 minus a vector of M,{M,} which is at least d(x0,M).{d(x_0, M).} The second inequality holds because ∥x0−m0∥≤d(x0,M)/(1−ε).{\|x_0 - m_0\| \le d(x_0, M)/(1 - \varepsilon).} We got ∥v−m∥≥1−ε{\|v - m\| \ge 1 - \varepsilon} for every m∈M,{m \in M,} hence d(v,M)≥1−ε.{d(v, M) \ge 1 - \varepsilon.}

Step 2. We prove that dim⁡X<+∞.{\dim X < +\infty.} Suppose, by contradiction, that dim⁡X=+∞.{\dim X = +\infty.} We construct inductively a sequence of vectors.

(i) Fix v0∈X{v_0 \in X} with ∥v0∥=1{\|v_0\| = 1} and let M0=Span⁡(v0)={αv0:α∈R}.{M_0 = \operatorname{Span}(v_0) = \{ \alpha v_0 : \alpha \in \mathbb{R} \}.} Then M0≠X,{M_0 \neq X,} because M0M_0 has dimension 1 and XX has infinite dimension, and M0M_0 is closed by Remark 14 (1), because it has finite dimension.

(ii) Apply Step 1 to M=M0{M = M_0} with ε=1/2.{\varepsilon = 1/2.} It gives v1∈X{v_1 \in X} with ∥v1∥=1{\|v_1\| = 1} and d(v1,M0)≥1−ε=1/2.{d(v_1, M_0) \ge 1 - \varepsilon = 1/2.} Now consider M1=Span⁡(v0,v1).{M_1 = \operatorname{Span}(v_0, v_1).} Then M1≠X,{M_1 \neq X,} because M1M_1 has dimension 2 and XX has infinite dimension, and M1M_1 is closed, because it has finite dimension. So the construction can be iterated.

(iii) Let Mn−1=Span⁡(v0,v1,…,vn−1){M_{n-1} = \operatorname{Span}(v_0, v_1, \dots, v_{n-1})} be given, of finite dimension, closed and different from X.{X.} Then Step 1 gives vn∈X{v_n \in X} such that ∥vn∥=1{\|v_n\| = 1} and d(vn,Mn−1)≥1/2.{d(v_n, M_{n-1}) \ge 1/2.}

In the end we found vectors vnv_n of XX such that ∥vn∥=1{\|v_n\| = 1} for every nn and d(vn,Mn−1)≥1/2{d(v_n, M_{n-1}) \ge 1/2} for every n≥1.{n \ge 1.} However, ∥vn∥=1{\|v_n\| = 1} for every nn gives (vn)⊂B‾1(0),{(v_n) \subset \overline{B}_1(0),} which is compact by assumption. Hence, by Lemma 20 (ii) of the first post, there exist a subsequence (vnk)(v_{n_k}) and w∈X{w \in X} such that vnk→w{v_{n_k} \to w} in XX as k→∞.{k \to \infty.} That is, d(w,vnk)→0.{d(w, v_{n_k}) \to 0.}

Therefore (vnk)(v_{n_k}) is Cauchy in X:{X{:}} for every ε0>0{\varepsilon_0 > 0} there exists NN such that d(vnk,vnk−1)<ε0{d(v_{n_k}, v_{n_{k-1}}) < \varepsilon_0} for every k≥N.{k \ge N.} But, for every k≥1,{k \ge 1,}

d(vnk,vnk−1)≥d(vnk,Mnk−1)≥12,d(v_{n_k}, v_{n_{k-1}}) \ge d(v_{n_k}, M_{n_k - 1}) \ge \frac{1}{2},

because vnk−1∈Mnk−1⊂Mnk−1.{v_{n_{k-1}} \in M_{n_{k-1}} \subset M_{n_k - 1}.} This is a contradiction for ε0<1/2.{\varepsilon_0 < 1/2.} ■\blacksquare

Compactness in C([a,b])C([a, b])

Let −∞<a<b<+∞.{-\infty < a < b < +\infty.} A family F\mathcal{F} of functions of C([a,b])C([a, b]) is bounded if there exists R>0{R > 0} such that ∥f∥∞<R{\|f\|_\infty < R} for every f∈F.{f \in \mathcal{F}.} It is uniformly equicontinuous if for every ε>0{\varepsilon > 0} there exists δ>0{\delta > 0} such that

x,y∈[a,b],  ∣x−y∣<δ⟹∣f(x)−f(y)∣<εfor every f∈F.x, y \in [a, b], \ \ |x - y| < \delta \quad \Longrightarrow \quad |f(x) - f(y)| < \varepsilon \quad \text{for every } f \in \mathcal{F}.

Theorem 19 (Ascoli–Arzelà). Let −∞<a<b<+∞,{-\infty < a < b < +\infty,} consider (C([a,b]),∥⋅∥∞){(C([a, b]), \|\cdot\|_\infty)} and let F⊂C([a,b]).{\mathcal{F} \subset C([a, b]).} Then F\mathcal{F} is precompact, that is, F‾\overline{\mathcal{F}} is compact, as in Definition 14 of the first post, if and only if F\mathcal{F} is bounded and uniformly equicontinuous.

In particular, let (fn)⊂C([a,b]){(f_n) \subset C([a, b])} be such that sup⁡n∥fn∥∞<+∞{\sup_n \|f_n\|_\infty < +\infty} and F={fn:n∈N}{\mathcal{F} = \{ f_n : n \in \mathbb{N} \}} is uniformly equicontinuous. Then there exist a subsequence (fnk)(f_{n_k}) and g∈C([a,b]){g \in C([a, b])} such that fnk→g{f_{n_k} \to g} in ∥⋅∥∞\|\cdot\|_\infty as k→∞.{k \to \infty.}

Remark 20. Let −∞<a<b<+∞.{-\infty < a < b < +\infty.}
(i) Let (fn)⊂C([a,b]){(f_n) \subset C([a, b])} be equilipschitz: there exists L>0{L > 0} such that, for every nn and all xx and yy in [a,b],{[a, b],} ∣fn(x)−fn(y)∣≤L∣x−y∣.{|f_n(x) - f_n(y)| \le L |x - y|.} Then (fn)(f_n) is uniformly equicontinuous.
(ii) Let p∈(1,+∞]{p \in (1, +\infty]} and let (fn)⊂W1,p((a,b)){(f_n) \subset W^{1,p}((a, b))} be bounded in W1,p,{W^{1,p},} that is, sup⁡n∥fn∥W1,p<+∞,{\sup_n \|f_n\|_{W^{1,p}} < +\infty,} with the norm of Example 19 of the tenth post. Then (fn)(f_n) is bounded in ∥⋅∥∞\|\cdot\|_\infty and uniformly equicontinuous, by estimates analogous to those of Example 4 and Remark 6 of the previous post, so there exists a subsequence (fnk)(f_{n_k}) that converges uniformly, by Theorem 19. Here each fnf_n is identified with its absolutely continuous representative, as in Example 21 of the tenth post.

Proof (sketch). Only (i) is proved. Let ε>0{\varepsilon > 0} and choose δ>0{\delta > 0} with δ<ε/L.{\delta < \varepsilon/L.} Then, for every nn and all x,y∈[a,b]{x, y \in [a, b]} with ∣x−y∣<δ,{|x - y| < \delta,}

∣fn(x)−fn(y)∣≤L∣x−y∣<Lδ<ε.■|f_n(x) - f_n(y)| \le L |x - y| < L \delta < \varepsilon. \tag*{$\blacksquare$}