A family of function F⊂C(K,Rm) is equicontinuous at a∈K
∀f∈F.∀ϵ>0.∃δ>0.∥x−a∥<δ⇒∥f(x)−f(a)∥<ϵ
Then F is equicontinuous on K is F is equicontinuous ∀a∈K.
Def'n. Uniformly equicontinuous
F is uniformly equicontinuous if
∀ϵ>0.∃δ>0.∀f∈F.∀x,y∈K.∥x−y∥<δ⇒∥f(x)−f(y)∥<ϵ
Theorem 1
G:={gn}n≥1∪{g} where gn∈C(K,Rm),gn→u.c.g, then G is equicontinuous.
proof. Let a∈K,ϵ>0, By completeness and uniform continuous, g is also continuous, take δ′>0 s.t. ∀x∈K.∥x−a∥<δ′⇒∥g(x)−g(a)∥<ϵ/3. By uniform continuous, take N≥0 s.t. ∀n≥N.∥gn−g∥∞<ϵ/3. Then, ∀n≥N.∀x,∥x−a∥<δ′ ∥gn(x)−gn(a)∥≤∥gn(x)−g(x)∥+∥g(x)−g(a)∥+∥g(a)−gn(a)∥≤3(ϵ/3)=ϵ
Then, for each gk∈{g1,g2,...,gN}, take δk by continuity of each gk, take δ=min{δ1,..,δk,δ′}
∀f∈F.∀ϵ>0.∃δ>0.∥x−a∥<δ⇒∥f(x)−f(a)∥<ϵ
Example 1
fn(x)=xn,x∈[0,1],F={fn}n≥1 is not equicontinuous at 1.
proof. Take ϵ=1/2, let δ>0, wlog, δ<1. Take y=1−δ/2<1, then yn→0, hence we can take N s.t. ∀n≥N,1−yn>1/2 Therefore, ∣1−y∣=δ/2<δ but ∣fn(1)−fn(y)∣=1−yn>1/2
Lemma 1. Compact Implies Equicontinuous
If F compact, then F equicontinuous on K.
proof. Suppose F is not equicontinuous, take a∈K,ϵ>0 s.t. ∀n≥1.∃fn∈F.∃xn∈K s.t. ∥xn−a∥<1/n but ∥fn(xn)−fn(a)∥≥ϵ, hence we construct sequences {xn},{fn} Then, any subset of {fn} cannot be equicontinuous (i) However, since F is compact, take {fnk} converges uniformly to some f∈F, and {fnk}∪{f} is equicontinuous, this contradicts with (i)
proof. Suppose F not u.e.c. Take ϵ>0 s.t. ∀n≥1,∃xn,yn∈K.∃fn∈F.∥xn−yn∥<1/n∧∥fn(xn)−fn(yn)∥≥ϵ hence we construct sequence {xn},{yn},{fn} Since K is compact, take xnk→a∈K, then ynk=xnk−(xnk−ynk)→a
F is equicontinous at a∈K⇒∃δ>0,∥fn(x)−fn(a)∥≤ϵ/2 for all ∥x−a∥<δ,f∈F. Since xnk→a,ynk→a,∃M∈N,∀m≥M.∥xnm−a∥<δ∧∥ynm−a∥<δ Therefore, ∀m≥M
S⊆K is an ϵ-net of K if K⊆∪a∈SBϵ(a) K is totally bounded if it has a finite ϵ-net ∀ϵ>0
Lemma 3. Bounded Implies Totally Bounded
If K⊆Rm bounded, then totally bounded.
proof. Let ϵ>0, choose N,N≤min{ϵ,m1} K bounded, hence ∃L>0,∀x=(x1,...,xm)∈K,∣xi∣≤L,∀i Let F={2N2ki}ki∈Z⊆[−L,L], then F is a finite 2N21-net for [−L,L]. Let A={x1,...,xm}⊆Rm s.t. xi∈F,∀i Let A~={a∈A:Bϵ/2(x)∩K=∅}. Then, for each x∈A~, choose xa∈Bϵ/2(a)∩K. Take x=(x1,...,xm)∈K for each i=1,...,m,∃ai∈F s.t. ∣xi−ai∣<2N21 Then, ∥x−a∥=∑∣xi−ai∣2<4N4m=M/2N2≤N/2N2≤(2N)−1<ϵ/2 Also, Bϵ/2(a)∩K=∅,a∈A~, so that xa is defined. Then, ∥x−xa∥≤∥x−a∥+∥x−xa∥<ϵ/2+ϵ/2=ϵ
Lemma 4
If K bounded, then K contains a sequence {xi}i≥1 dense in K. Moreover, ∀ϵ>0.∃N∈N s.t. {xi}i≤N is an ϵ-net for K.
proof. For each k≥i, let Bk be a finite k−1-net. Take {xi} be the sequence which lists the Bk consecutively, i.e. x0,...,xN0∈B0,xN0+1,...,xN1∈B1,.. Let x∈K, then ∀k≥1.∃nk s.t. xnk∈Bk and ∥x−xnk∥<k−1, hence dense. Also, given ϵ>0, choose k>ϵ−1,{xi}i≤Nk is a ϵ-net.
Thrm. Arzela-Ascoli Theorem
F⊆C(K,Rm) is compact IFF closed, bounded, euicontinuous
⇒proof. Suppose not closed, then take {fn}⊆F s.t. fn→f∈F contradicts with compactness. Suppose not bounded, take {fn}⊆F that ∥fn∥∞→∞ contradicts and Lemma 1
⇐proof. Fix {fn}⊆F, by the Lemma 4, ∃{xi}⊆K s.t. ∀ϵ>0.∃{xi}i≤N is a ϵ-net. WTF {fnk}⊆{fn} s.t. fnk(xi)→kLi,∀1≤i≤N. Let A0=N, since {fn(x1)}n∈A0 bounded, by Bolzano-Weierstrass Theorem, take the convergent subsequence, i.e. A1⊆A0,limn∈A1fn(x1)=L1. Inductively take A=A0⊇A1⊇A2⊇... be a decreasing sequence, s.t. limn∈Aifn(xi)=Li Then, for each k≥1, let nk be the kth element of Ak, i.e.
A1A2A3...n1n2n3
Since An is decreasing, for each i≥1, there are at most i−1 elements are not in Ai. In particular, this implies limkfnk(xi)=limn∈Aifn(xi)=Li Let gk=fnk, let ϵ>0, since F is equicontinuous, i.e. uniform equicontinuous. Take δ>0.∥x−y∥<δ⇒∥f(x)−f(y)∥<ϵ/3,∀f∈F By definition of {xi}, take N∈N,{x1,...,xn} is a δ-net. Since limk→∞gk(xi) exists for all i≥1. ∃M∈N s.t. ∀k,l≥M.∀1≤i≤N⇒∥gn(xi)−gl(xi)∥<ϵ/3 Since {x1,...,xN} is a δ-net, ∃i,∥xi−x∥<δ