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.

On C(X,Y) with X and Y metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence

Statement

Let (X,dX) be a nonempty metric space and let (Y,d) be a metric space (Metric space: d(x,y)=0 iff x=y, symmetry, and the triangle inequality; pseudometric and ultrametric), each carrying its metric topology, and write Tpt, Tcc and Tu for the topologies of pointwise convergence (The topology of pointwise convergence on YX, which is the product topology, and its restriction to C(X,Y)), 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) and of uniform convergence (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YX and on C(X,Y)) on C(X,Y). Then

Tpt  ⊆  Tcc  ⊆  Tu,

that is, uniform convergence is finer than compact convergence, which is finer than pointwise convergence (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison for finer). The middle topology is also the compact-open topology (For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence, The compact-open topology on C(X,Y) for a metric domain X, with subbasis S(K,V)={f:f[K]⊆V}).

No strictness is claimed. The theorem asserts the two inclusions and nothing more; that neither reverses in general is witnessed on the companion page, by a sequence converging pointwise but not on compact sets and by a sequence converging on compact sets but not uniformly. Those witnesses are not prerequisites of this theorem. Nonemptiness of X is inherited from For a nonempty set X and a metric space (Y,d) the uniform metric ρˉ(f,g)=sup⁡xmin⁡{d(f(x),g(x)),1} is a metric on YX, which defines the uniform metric only there. No choice principle is used.

Facts & Assumptions

Given: A nonempty metric space (X,dX), a metric space (Y,d), the set C(X,Y) of continuous maps, and on it the three topologies named in the Statement; dˉ=min⁡{d,1} and ρˉ are as in For a nonempty set X and a metric space (Y,d) the uniform metric ρˉ(f,g)=sup⁡xmin⁡{d(f(x),g(x)),1} is a metric on YX.

[L2]

The sets BK(f,ε) are a basis for Tcc, with B∅(f,ε)=C(X,Y), and max⁡x∈Kd(f(x),g(x)) exists for f,g∈C(X,Y) and nonempty compact K, by fact (U3) there (The topology of compact convergence on C(X,Y) for metric X and Y: uniform convergence on each compact subset of X).

Proof

technique · direct
1.1

For the first inclusion, let x∈X, let V⊆Y be open and let f∈T(x,V).

L1
1.2

For the second inclusion, let K⊆X be compact, let f0∈C(X,Y), let ε>0 be real and let g∈BK(f0,ε).

L2
2.1

Under step 1.1: f(x)∈V with V open, so there is a real ε>0 with B(f(x),ε)⊆V; and {x} is a compact subset of X.

step 1.1L5L6choose
2.2

Under step 1.2: if K=∅ then BK(f0,ε)=C(X,Y), which is open in Tu; so assume K≠∅, put M:=max⁡x∈Kd(f0(x),g(x)), which exists and satisfies M<ε, and put δ:=min⁡{ε−M, 1}/2, a real with 0<δ≤1/2 and 2δ≤ε−M.

step 1.2L2L3L7
3.1

Under step 1.1: B{x}(f,ε)⊆T(x,V), since g∈B{x}(f,ε) means d(f(x),g(x))<ε, that is g(x)∈B(f(x),ε)⊆V.

step 2.1L2
3.2

Under step 1.2 with K≠∅: let h∈Bρˉ(g,δ)∩C(X,Y); then for every x∈X we have dˉ(g(x),h(x))≤ρˉ(g,h)<δ≤1/2<1, hence d(g(x),h(x))=dˉ(g(x),h(x))<δ.

step 2.2L7
4.1

Under step 1.1: f lies in the basic set B{x}(f,ε) of Tcc, which by step 3.1 lies inside T(x,V); as f was an arbitrary point of T(x,V), the set T(x,V) is open in Tcc.

step 2.1step 3.1L2L4
4.2

Under step 1.2 with K≠∅: for x∈K we get d(f0(x),h(x))≤d(f0(x),g(x))+d(g(x),h(x))<M+δ≤M+(ε−M)=ε, so h∈BK(f0,ε); hence Bρˉ(g,δ)∩C(X,Y)⊆BK(f0,ε).

step 2.2step 3.2
5.1

By step 4.1 every generating set of Tpt lies in Tcc, so Tpt⊆Tcc.

step 4.1L1L4
5.2

By steps 2.2 and 4.2 every point of every basic set of Tcc has a ball of the uniform metric around it inside that set, so every such basic set is open in Tu and hence Tcc⊆Tu.

step 2.2step 4.2L2L3L4
6.1

Steps 5.1 and 5.2 are the two asserted inclusions, and the middle topology is the compact-open topology by For a metric domain and a metric target the compact-open topology on C(X,Y) is the topology of compact convergence.

step 5.1step 5.2∎

Remarks

  • Where each inclusion comes from. The first is the observation that a one-point set is compact, so every constraint of the pointwise topology is already a constraint of the compact-convergence topology. The second is that X itself need not be compact: a uniform bound over all of X is at least as strong as a uniform bound over one compact set.

  • The truncation threshold appears once, in step 3.2, where the uniform distance has to be pushed below 1 before it can be read as an untruncated distance. That costs nothing, since δ is being made small in any case.

  • Nonemptiness of X is a hypothesis about the uniform metric only. The inclusion Tpt⊆Tcc needs no such hypothesis; it is stated with it only because the theorem names all three topologies at once.

  • When the outer two coincide. If X is itself compact, then K=X is an admissible compact set and the chain collapses at its right end: compact convergence and uniform convergence agree on C(X,Y). The companion page works that case on [0,1] and separates the two on R.

Depends on

Used by

Dependency tree · two levels

72 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