8.4. EQUIVALENCE OF NORMS 191

Lemma 8.4.4 Let Ki be a nonempty compact set in F. Then P≡∏ni=1 Ki is compact in Fn.

Proof: Let {xk} be a sequence in P. Taking a succession of subsequences as in theproof of Corollary 8.4.2, there exists a subsequence, still denoted as {xk} such that if xi

k isthe ith component of xk, then limk→∞ xi

k = xi ∈ Ki. Thus if x is the vector of P whose ith

component is xi,

limk→∞

|xk−x| ≡ limk→∞

(n

∑i=1

∣∣xik− xi∣∣2)1/2

= 0

It follows that P is sequentially compact, hence compact.A set K in Fn is said to be bounded if it is contained in some ball B(0,r).

Theorem 8.4.5 A set K ⊆ Fn is compact if it is closed and bounded. If f : K→ R, then fachieves its maximum and its minimum on K.

Proof: Say K is closed and bounded, being contained in B(0,r). Then if x ∈ K, |xi|< rwhere xi is the ith component. Hence K ⊆ ∏

ni=1 D(0,r) , a compact set by Lemma 8.4.4.

By Proposition 7.6.8, since K is a closed subset of a compact set, it is compact. The lastclaim is just the extreme value theorem, Theorem 7.7.1.

Definition 8.4.6 Let {v1, · · · ,vn} be a basis for V where (V, ||·||) is a finite dimensionalnormed vector space with field of scalars equal to either R or C. Define θ : V → Fn asfollows.

θ

(n

∑j=1

α jv j

)≡ α ≡(α1, · · · ,αn)

T

Thus θ maps a vector to its coordinates taken with respect to a given basis.

The following fundamental lemma comes from the extreme value theorem for continu-ous functions defined on a compact set. Let

f (α)≡

∥∥∥∥∥∑iα ivi

∥∥∥∥∥≡ ∥∥θ−1

α∥∥

Then it is clear that f is a continuous function defined on Fn. This is because α → ∑i α iviis a continuous map into V and from the triangle inequality x→∥x∥ is continuous as a mapfrom V to R.

Lemma 8.4.7 There exists δ > 0 and ∆≥ δ such that

δ = min{ f (α) : |α|= 1} , ∆ = max{ f (α) : |α|= 1}

Also,

δ |α| ≤∥∥θ−1

α∥∥≤ ∆ |α| (8.4.21)

δ |θv| ≤ ∥v∥ ≤ ∆ |θv| (8.4.22)

8.4. EQUIVALENCE OF NORMS 191Lemma 8.4.4 Let K; be a nonempty compact set in F. Then P = [j_, Kj is compact in F".Proof: Let {x;,} be a sequence in P. Taking a succession of subsequences as in theproof of Corollary 8.4.2, there exists a subsequence, still denoted as {x;} such that if x, isthe i!" component of x;,, then lim,_,...x, = x' € K;. Thus if x is the vector of P whose jthcomponent is 2’,1/2n . ao)li —x| = li x =0jim [xx x| om (Els “)It follows that P is sequentially compact, hence compact. §fA set K in F” is said to be bounded if it is contained in some ball B (0,7).Theorem 8.4.5 A set K C F” is compact if it is closed and bounded. If f : K + R, then fachieves its maximum and its minimum on K.Proof: Say K is closed and bounded, being contained in B (0,r). Then if x € K, |x;| <rwhere x; is the i” component. Hence K C []/_, D(0,r), a compact set by Lemma 8.4.4.By Proposition 7.6.8, since K is a closed subset of a compact set, it is compact. The lastclaim is just the extreme value theorem, Theorem 7.7.1. IfDefinition 8.4.6 Let {v,,---,v,,} be a basis for V where (V,||-||) is a finite dimensionalnormed vector space with field of scalars equal to either R or C. Define 0: V — F" asfollows.n_y— T0 Ye aj; = a =(Q,-°- , On)j=lThus 0 maps a vector to its coordinates taken with respect to a given basis.The following fundamental lemma comes from the extreme value theorem for continu-ous functions defined on a compact set. Letf(a) = =|0'a|y QAiV;iThen it is clear that f is a continuous function defined on F”. This is because & — )°; QV;is a continuous map into V and from the triangle inequality x — ||x|| is continuous as a mapfrom V to R.Lemma 8.4.7 There exists 6 > 0 and A> 6 such that6=min{f(a@):|a|/=1}, A=max{f(a):|a|=1}Also,5 ||6 |Av||! a|| < Alar| (8.4.21)Il v|| < A] @v| (8.4.22)IA IA