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 and be metric spaces, let be compact, and let be continuous for every integer . Suppose that for every there is such that for all and all . Then is compact in . The empty-set case is included, and the proof uses no choice principle.
Facts & Assumptions
Given: Metric spaces, a compact subset , continuous maps, and uniform convergence on as stated.
A compact metric subspace has a finite subcover from every family of ambient open sets covering it; conversely this ambient-cover condition implies intrinsic compactness (Open cover, subcover, compact metric space, and compact subset of a metric space, A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it).
A continuous map sends a compact subset of a metric space to a compact subset (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset).
In a metric space, open sets contain an open ball about each of their points, and open balls are open (Metric space: iff , symmetry, and the triangle inequality; pseudometric and ultrametric, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement).
Proof
If , then and it is compact. Otherwise let be any family of open subsets of covering . By [F2], is compact, so [F1] gives finitely many covering . Set , an open set containing .
Form the family of all balls with , , and . This family covers by openness and [F3], so [F1] gives a finite subcover with centers and radii . Since , ; let . If and for some , choose with ; then , so . Thus every point within distance of some point of lies in .
Uniform convergence supplies such that for every and every . Since , step 2.1 implies for every .
For each of the finitely many indices , [F2] makes compact, so [F1] supplies a finite subfamily of covering it. Together with from step 1.1, these finitely many members cover , all with , and each remaining . Hence every open cover of has a finite subcover, so is compact by [F1]. The proof uses only finite subcovers and a finite minimum, not a choice axiom.
Depends on
- Metric space: $d(x,y) = 0$ iff $x = y$, symmetry, and the triangle inequality; pseudometric and ultrametric
- Open cover, subcover, compact metric space, and compact subset of a metric space
- A subset of a metric space is open in the subspace metric exactly when it is the trace of an open set of the ambient space, and it is compact as a metric space in its own right exactly when every family of open subsets of the ambient space covering it, indexed or not, has finitely many members covering it
- Continuity of a map between metric spaces, at a point and globally, in the $\varepsilon$-$\delta$ form
- The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement
- The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset
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
- Kovachki et al., Neural Operator: Learning Maps Between Function Spaces With Applications to PDEs (standard reference, not scraped)