Reason: First published proof of thm:arzela-ascoli-interval-2026a.
Proof
Throughout, ∣x−y∣ is the Euclidean distance on Rk, by claim 2 of the elementary properties of the Euclidean norm, and we use the triangle inequality of claim 6 of that lemma without further comment. Let C denote the set of maps [a,b]→Rk with continuous components, equipped with the supremum metric d∞, as in the completeness lemma for continuous vector-valued functions; by claim 1 of that lemma d∞ is finite and is a metric on C, and by claim 2 the metric space (C,d∞) is complete. Note first that M≥0, since ∣f1(a)∣≤M and norms are nonnegative.
Step 1: every fn lies in C. Fix n and t0∈[a,b], and let ε>0. Hypothesis (ii) supplies δ>0 such that ∣fm(s)−fm(t)∣<ε for every m and all s,t∈[a,b] with ∣s−t∣<δ; in particular ∣fn(t)−fn(t0)∣<ε whenever ∣t−t0∣<δ. By claim 4 of Elementary Properties of the Euclidean Norm on Rn, ∣fni(t)−fni(t0)∣≤∣fn(t)−fn(t0)∣<ε for each component index i, so every component fni is continuous on [a,b]. Hence fn∈C.
Step 2: a countable set of dyadic points. For a natural number m≥1 put
Qm={a+(b−a)p2−m:p=0,1,…,2m}⊆[a,b],
a finite set, and let Q=⋃m≥1Qm. Since p2−m=(2p)2−(m+1) we have Qm⊆Qm+1. Consecutive points of Qm differ by (b−a)2−m, so
for every t∈[a,b] there is q∈Qm with ∣t−q∣≤(b−a)2−m,(∗)
because t lies in one of the 2m intervals [a+(b−a)p2−m,a+(b−a)(p+1)2−m] that cover [a,b], and one may take q to be that interval's left endpoint. Listing the elements of Q1 in increasing order, then those of Q2∖Q1 in increasing order, then those of Q3∖Q2, and so on, produces a sequence(qr)r∈N whose set of terms is Q; each Qm being finite, for every m there is a natural number Rm with Qm⊆{q1,…,qRm}.
We construct strictly increasing maps σr:N→N for r∈N, each a subsequence selector refining the previous one. Applying sequential compactness of Bˉ to the sequence (fn(q1))n∈N yields a strictly increasing σ1 such that (fσ1(n)(q1))n converges. If σr has been constructed, apply sequential compactness to (fσr(n)(qr+1))n to obtain a strictly increasing τ:N→N with (fσr(τ(n))(qr+1))n convergent, and set σr+1=σr∘τ, again strictly increasing. We record the nesting explicitly. For all s≤r there is a strictly increasing θs,r:N→N with σr=σs∘θs,r. This follows by induction on r for fixed s: for r=s take θs,s to be the identity, and if σr=σs∘θs,r then σr+1=σr∘τ=σs∘(θs,r∘τ), where τ is the selector used at that construction step and θs,r∘τ is strictly increasing as a composition of strictly increasing maps. Consequently, for s≤r, the sequence (fσr(n)(qs))n is a subsequence of a subsequence, hence a subsequence, of (fσs(n)(qs))n, which converges by construction; so it converges too, by the fact that a subsequence of a convergent sequence has the same limit.
Define nj=σj(j). Since σj+1 selects a subsequence of the one selected by σj, there is a strictly increasing ρ with σj+1=σj∘ρ, and ρ(j+1)≥j+1 by the growth bound for strictly increasing sequences of natural numbers; as σj is strictly increasing this gives nj+1=σj(ρ(j+1))≥σj(j+1)>σj(j)=nj. So (fnj)j∈N is a subsequence of (fn)n∈N. Fix r. For j≥r we have nj=σj(j)=σr(θr,j(j)), so nj is the θr,j(j)-th term of the sequence selected by σr. The index map j↦θr,j(j) is strictly increasing on {j∈N:j≥r}: if j′>j≥r then σr(θr,j′(j′))=nj′>nj=σr(θr,j(j)) by the strict increase of (nj)j just established, and σr is strictly increasing, hence injective and order-reflecting, so θr,j′(j′)>θr,j(j). Therefore (fnj(qr))j≥r is a subsequence of the convergent sequence (fσr(n)(qr))n and therefore converges; adjoining the finitely many terms with j<r does not affect this, so (fnj(qr))j∈N converges for every r.
Step 4: the subsequence is Cauchy for d∞. Let ε>0. By hypothesis (ii) choose δ>0 such that ∣fn(s)−fn(t)∣<ε/3 for every n and all s,t∈[a,b] with ∣s−t∣<δ. Choose a natural number m≥1 with (b−a)2−m<δ. Every sequence (fnj(q))j with q∈Qm converges by Step 3 and is therefore Cauchy; as Qm is finite, there is J such that
fnj(q)−fnl(q)<ε/3for all j,l≥J and all q∈Qm.
Now let t∈[a,b] and j,l≥J. By (∗) pick q∈Qm with ∣t−q∣≤(b−a)2−m<δ. Then