Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedprecheck pending
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

A pointwise convergent subsequence of a uniformly Lipschitz family into a compact metric space converges uniformly on compact subintervals

Statement

Assume the Axiom of Countable Choice ACω (The Axiom of Countable Choice (ACω)). Let (B,d) be a compact metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), let I⊆R be an interval with nonempty interior, let K≥0 be real, and let σm:I→B, m∈N, be K-Lipschitz maps, d(σm(s),σm(t))≤K∣s−t∣ for all s,t∈I. Then there are a strictly increasing sequence m1<m2<⋯ and a K-Lipschitz map σ:I→B such that σmj→σ uniformly on every compact subinterval of I.

Facts & Assumptions

Given: A compact metric space (B,d), an interval I with nonempty interior, a real K≥0, and K-Lipschitz maps σm:I→B.

[L1]

D:=I∩Q is a countable dense subset of I: the rationals are countable and dense in R, so their intersection with an interval is countable and, the interval having nonempty interior, dense in it (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable).

[L3]

Countable choice selects one element from each of countably many nonempty sets (The Axiom of Countable Choice (ACω)).

Proof

technique · constructive
1.1L1L2L3chooseconstruct

(Deterministic diagonal extraction after countable choice.) Enumerate D={q1,q2,… } [L1]. Compactness gives a finite cover of B by balls of radius 1/n for each n≥1; [L3] chooses one ordered finite list of centers for each n, from this family fixed in advance. Set A0=N. At stage n, classify the indices m∈An−1 by the tuple of least ball indices containing σm(q1),…,σm(qn) in the chosen radius-1/n cover. There are finitely many classes, so at least one is infinite; let An be the infinite class with lexicographically least tuple. This defines nested infinite sets by deterministic recursion, without dependent choice. Put m0=0 and let mn be the least member of An greater than mn−1. For fixed i and n≥i, every mj with j≥n lies in An, so the values σmj(qi) lie in one ball of radius 1/n and have pairwise distances less than 2/n. They are Cauchy and converge by [L2]. Write σ(qi)=lim⁡jσmj(qi). The only choice was the simultaneous selection of finite covers.

2.1step 1.1L1L2construct

(The limit on the dense set is Lipschitz and extends to I.) For q,q′∈D, continuity of d and the Lipschitz bound give d(σ(q),σ(q′))=lim⁡jd(σmj(q),σmj(q′))≤K∣q−q′∣ [L2]. For t∈I choose a sequence qn∈D with qn→t [L1]; by the previous estimate (σ(qn))n is Cauchy, hence convergent in the complete space B, and the limit does not depend on the chosen sequence (two sequences may be interleaved). Define σ(t) as this limit; passing to the limit in the Lipschitz estimate shows σ is K-Lipschitz on I.

3.1step 1.1step 2.1L2givendischarge-construct∎

(Uniform convergence on compact subintervals.) Let [a,b]⊆I be a compact subinterval and let ε>0. Choose finitely many points q1,…,qN∈D such that every t∈[a,b] satisfies ∣t−qi∣≤ε/(3K+3) for some i; this is possible, including when a=b, because D is dense in I and a compact interval is totally bounded in the sense of admitting such finite nets, the case K=0 being immediate from the estimator below with ε/(3K+3) read as any positive number. Since σmj(qi)→σ(qi) for each i, there is j0 such that d(σmj(qi),σ(qi))<ε/3 for all j≥j0 and all i≤N. For t∈[a,b] pick i with ∣t−qi∣≤ε/(3K+3); then d(σmj(t),σ(t))≤d(σmj(t),σmj(qi))+d(σmj(qi),σ(qi))+d(σ(qi),σ(t))<ε3+ε3+ε3=ε for j≥j0, because both σmj and σ are K-Lipschitz. Hence σmj→σ uniformly on [a,b].

Remarks

  • What replaces Arzela-Ascoli. Compactness of the target already gives pointwise relative compactness, so equicontinuity (here the Lipschitz bound) is the only extra input; the proof is the standard diagonal extraction over a countable dense set followed by the Lipschitz estimate.
  • Use. The lemma supplies the convergent subsequence in the openness proof of Local Cauchy neighborhoods in a conically bounded product chart, replacing an appeal to a general Arzela-Ascoli theorem whose home page is a prerequisite of no current run batch.

Depends on

Dependency tree · 2 levels

Sources