Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence

Statement

Let (X,dX) and (Y,d) be metric spaces (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), each carrying its metric topology, and let C(X,Y) be the set of continuous maps X→Y (Continuity of a map of topological spaces at a point and globally). Then the compact-open topology (The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V)={f:f[K]⊆V}) and the topology of compact convergence (The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X) on C(X,Y) are the same topology.

Both halves are proved by exhibiting, around each point of a generating set of one topology, a generating set of the other inside it. No choice principle is used: the only cover produced below is indexed by pairs, so the indexed form of compactness (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) returns everything that is needed.

The metric hypothesis on the target is not removable by anything on this page. The topology of compact convergence is defined only for a metric target, since its basic sets are written with a distance in Y; the compact-open topology needs only the open sets of Y. The theorem is a statement about the case where both are defined.

Facts & Assumptions

Given: Metric spaces (X,dX) and (Y,d) with their metric topologies, the set C(X,Y) of continuous maps, the sets S(K,V) of The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V)={f:f[K]⊆V}, the sets BK(f,ε) of The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X, and the topologies Tco and Tcc they respectively generate.

[L2]

The sets BK(f,ε) are a basis for Tcc, and B∅(f,ε)=C(X,Y); facts (U1), (U2) and (U3) of The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X are available, in particular the existence of max⁡x∈Kd(f(x),g(x)) for f,g∈C(X,Y) and nonempty compact K (The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X).

[L8]

K compact and (Ui)i∈I open in X with K⊆⋃iUi give n∈N and indices i0,…,in∈I with K⊆Ui0∪⋯∪Uin, unless K=∅ (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, claim 3).

Proof

technique · direct
1.1

First half: let K⊆X be compact, let V⊆Y be open and let f∈S(K,V); it suffices to produce a real ε>0 with BK(f,ε)⊆S(K,V), since then every point of S(K,V) lies in a basic set of Tcc inside it.

L1L2L3suffices: each subbasic compact open set is a union of basic compact convergence sets
1.2

Second half: let K⊆X be compact, let f0∈C(X,Y), let ε0>0 be real and let g∈BK(f0,ε0); it suffices to produce a finite intersection of sets S(K′,V′) containing g and contained in BK(f0,ε0).

L1L2L3suffices: each basic compact convergence set is a union of compact open sets
2.1

In step 1.1, if K=∅ or V=Y then S(K,V)=C(X,Y), which is open in Tcc, and ε:=1 serves since BK(f,1)⊆C(X,Y); so assume K≠∅ and V≠Y, whence Y∖V is nonempty.

step 1.1L1L2
2.2

In step 1.2, if K=∅ then BK(f0,ε0)=C(X,Y)=S(∅,Y), which is subbasic and hence open in Tco; so assume K≠∅.

step 1.2L1L2
3.1

Under step 2.1: f[K] is a nonempty compact subset of Y, and the function ψ(y):=d(y,Y∖V) is defined and continuous on Y.

step 2.1L4L5
3.2

Under step 2.2: M:=max⁡x∈Kd(f0(x),g(x)) exists and satisfies M<ε0, because g∈BK(f0,ε0) makes ε0 a strict upper bound of the values; put δ:=ε0−M>0.

step 2.2L2
4.1

Under step 2.1: the restriction of ψ to the nonempty compact metric subspace f[K] is continuous, so it attains a least value ε:=ψ(y0) at some y0∈f[K], and ε≤ψ(y) for every y∈f[K].

step 3.1L6choose
4.2

Under step 2.2: let P be the set of pairs (a,r) with a∈K, r>0 real and g[Bˉ(a,r)∩K]⊆B(g(a),δ/4); the family (B(a,r))(a,r)∈P consists of open subsets of X and covers K, since continuity of g at a∈K gives s>0 with g[B(a,s)]⊆B(g(a),δ/4) and then r:=s/2 satisfies Bˉ(a,r)⊆B(a,s), so (a,r)∈P and a∈B(a,r).

step 3.2constructL6L9
5.1

Under step 2.1: ε>0, because y0∈f[K]⊆V with V open gives a real s>0 with B(y0,s)⊆V, so every z∈Y∖V satisfies d(y0,z)≥s, making s a lower bound of the distances from y0 to Y∖V and hence ψ(y0)≥s>0.

step 4.1L5L9
5.2

Under step 2.2: since K≠∅ is compact, there are n∈N and pairs (a0,r0),…,(an,rn)∈P with K⊆B(a0,r0)∪⋯∪B(an,rn); each index is a pair, so the centres and radii come back with the indices and nothing is selected.

step 4.2L8
6.1

Under step 2.1: for u∈BK(f,ε) and x∈K we have d(f(x),u(x))<ε≤ψ(f(x)) by step 4.1, since f(x)∈f[K]; were u(x)∈Y∖V, the distance d(f(x),u(x)) would be one of the distances from f(x) to Y∖V and hence at least ψ(f(x)), which it is not; so u(x)∈V.

step 4.1step 5.1L5
6.2

Under step 2.2: for j≤n put Kj:=Bˉ(aj,rj)∩K and Vj:=B(g(aj),δ/2); each Kj is closed in the compact metric space (K,dK), being the trace on K of the closed set Bˉ(aj,rj), hence is compact, and each Vj is open in Y.

step 5.2L7L9
7.1

Under step 2.1: step 6.1 holds for every x∈K, so u[K]⊆V and u∈S(K,V); hence BK(f,ε)⊆S(K,V), which is what step 1.1 required, and every S(K,V) is open in Tcc, so Tco⊆Tcc.

step 1.1step 2.1step 6.1L3
7.2

Under step 2.2: g∈S(Kj,Vj) for every j≤n, since Kj⊆Bˉ(aj,rj)∩K and (aj,rj)∈P give g[Kj]⊆B(g(aj),δ/4)⊆Vj; so g∈O:=S(K0,V0)∩⋯∩S(Kn,Vn), a finite intersection of subbasic sets and hence open in Tco.

step 4.2step 5.2step 6.2L1
8.1

Under step 2.2: let h∈O and x∈K; step 5.2 gives j≤n with x∈B(aj,rj), so x∈Kj, whence d(h(x),g(aj))<δ/2 and d(g(x),g(aj))<δ/4, so d(h(x),g(x))<δ/2+δ/4<δ by the triangle inequality.

step 5.2step 6.2step 7.2L9
9.1

Under step 2.2: therefore d(f0(x),h(x))≤d(f0(x),g(x))+d(g(x),h(x))<M+δ=ε0 for every x∈K, that is h∈BK(f0,ε0); so O⊆BK(f0,ε0), which is what step 1.2 required.

step 3.2step 8.1
10.1

By step 9.1 every point of every basic set of Tcc is interior to it in Tco, so every basic set of Tcc is open in Tco, and since those basic sets generate, Tcc⊆Tco.

step 2.2step 9.1L2L3
11.1

With step 7.1 the two inclusions give Tco=Tcc.

step 7.1step 10.1∎

Remarks

  • The first half is where the compactness of the image is used, through the extreme value theorem applied to the distance to the closed set Y∖V. Without it the number ε of step 4.1 would be an infimum that might be 0, and the conclusion would fail: the set S(K,V) genuinely needs f[K] to sit at a positive distance from the complement of V, and that is a consequence of compactness, not of openness of V.

  • The cases K=∅ and V=Y are disposed of first for a reason. In both, S(K,V) is the whole space and the distance d(f[K],Y∖V) is not defined — in the first because there is no point of K to measure from, in the second because Y∖V is empty and this library defines the distance to a set only for a nonempty set (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

  • The second half is a covering argument and is where the compact-open topology earns its subbasis. A single set S(K,V) cannot control g uniformly on K; what does is a finite family of sets S(Kj,Vj) on which g varies by less than a quarter of the slack. That the pieces Kj are again compact is A closed subset of a compact metric space is compact applied inside K.

  • This is the theorem that lets the rest of the page use whichever description is convenient. The comparison of the three topologies is proved against compact convergence, while the evaluation map and the exponential law are proved against the compact-open topology, and the two are the same topology whenever both are defined.

Depends on

Used by

Dependency tree · two levels

77 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