Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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.

Uniformly convergent images of a compact set have compact union

Statement

Let (X,dX) and (Y,dY) be metric spaces, let K⊆X be compact, and let f,fn:X→Y be continuous for every integer n≥1. Suppose that for every ε>0 there is N≥1 such that dY(fn(x),f(x))<ε for all n≥N and all x∈K. Then W=f[K]∪⋃n=1∞fn[K] is compact in Y. The empty-set case is included, and the proof uses no choice principle.

Facts & Assumptions

Proof

technique · open-cover argument with a uniform neighborhood of the limit image
1.1givenF1F2cases

If K=∅, then W=∅ and it is compact. Otherwise let V be any family of open subsets of Y covering W. By [F2], f[K] is compact, so [F1] gives finitely many V1,…,Vq∈V covering f[K]. Set O=⋃i=1qVi, an open set containing f[K].

2.1step 1.1F1F3algebra

Form the family of all balls BY(y,r) with y∈f[K], r>0, and BY(y,2r)⊆O. This family covers f[K] by openness and [F3], so [F1] gives a finite subcover with centers y1,…,ys and radii r1,…,rs. Since f[K]≠∅, s≥1; let δ=min⁡iri>0. If z∈Y and dY(z,y)<δ for some y∈f[K], choose i with dY(y,yi)<ri; then dY(z,yi)<δ+ri≤2ri, so z∈BY(yi,2ri)⊆O. Thus every point within distance δ of some point of f[K] lies in O.

3.1givenstep 2.1algebra

Uniform convergence supplies N≥1 such that dY(fn(x),f(x))<δ for every x∈K and every n≥N. Since f(x)∈f[K], step 2.1 implies fn[K]⊆O for every n≥N.

4.1step 1.1step 3.1F1F2algebra∎

For each of the finitely many indices 1≤n<N, [F2] makes fn[K] compact, so [F1] supplies a finite subfamily of V covering it. Together with V1,…,Vq from step 1.1, these finitely many members cover f[K], all fn[K] with n≥N, and each remaining fn[K]. Hence every open cover of W has a finite subcover, so W is compact by [F1]. The proof uses only finite subcovers and a finite minimum, not a choice axiom.

Depends on

Used by

Dependency tree · two levels

21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources