Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck 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)C(X,Y) with XX and YY metric, uniform convergence is finer than compact convergence, which is finer than pointwise convergence

Statement

Let (X,dX)(X,d_X) be a nonempty metric space and let (Y,d)(Y,d) be a metric space (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric), each carrying its metric topology, and write Tpt\mathcal{T}_{\mathrm{pt}}, Tcc\mathcal{T}_{\mathrm{cc}} and Tu\mathcal{T}_{\mathrm{u}} for the topologies of pointwise convergence (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)), of compact convergence (The topology of compact convergence on C(X,Y)C(X,Y) for metric XX and YY: uniform convergence on each compact subset of XX) and of uniform convergence (Uniform convergence, and the topology of uniform convergence: the metric topology of the uniform metric on YXY^{X} and on C(X,Y)C(X,Y)) on C(X,Y)C(X,Y). Then

Tpt    Tcc    Tu,\mathcal{T}_{\mathrm{pt}} \;\subseteq\; \mathcal{T}_{\mathrm{cc}} \;\subseteq\; \mathcal{T}_{\mathrm{u}} ,

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)C(X,Y) is the topology of compact convergence, The compact-open topology on C(X,Y)C(X,Y) for a metric domain XX, with subbasis S(K,V)={f:f[K]V}S(K,V) = \{f : f[K] \subseteq 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 XX is inherited from For a nonempty set XX and a metric space (Y,d)(Y,d) the uniform metric ρˉ(f,g)=supxmin{d(f(x),g(x)),1}\bar\rho(f,g) = \sup_{x} \min\{d(f(x),g(x)), 1\} is a metric on YXY^{X}, which defines the uniform metric only there. No choice principle is used.

Facts & Assumptions

Given: A nonempty metric space (X,dX)(X,d_X), a metric space (Y,d)(Y,d), the set C(X,Y)C(X,Y) of continuous maps, and on it the three topologies named in the Statement; dˉ=min{d,1}\bar d = \min\{d,1\} and ρˉ\bar\rho are as in For a nonempty set XX and a metric space (Y,d)(Y,d) the uniform metric ρˉ(f,g)=supxmin{d(f(x),g(x)),1}\bar\rho(f,g) = \sup_{x} \min\{d(f(x),g(x)), 1\} is a metric on YXY^{X}.

[L1]

Tpt\mathcal{T}_{\mathrm{pt}} is generated by the sets T(x,V):={gC(X,Y):g(x)V}T(x,V) := \{\, g \in C(X,Y) : g(x) \in V \,\} for xXx \in X and VYV \subseteq Y open, these being the traces on C(X,Y)C(X,Y) of the subbasic sets of the product topology (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y), Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L2]

The sets BK(f,ε)B_K(f,\varepsilon) are a basis for Tcc\mathcal{T}_{\mathrm{cc}}, with B(f,ε)=C(X,Y)B_{\varnothing}(f,\varepsilon) = C(X,Y), and maxxKd(f(x),g(x))\max_{x \in K} d(f(x),g(x)) exists for f,gC(X,Y)f, g \in C(X,Y) and nonempty compact KK, by fact (U3) there (The topology of compact convergence on C(X,Y)C(X,Y) for metric XX and YY: uniform convergence on each compact subset of XX).

Proof

technique · direct
1.1

For the first inclusion, let xXx \in X, let VYV \subseteq Y be open and let fT(x,V)f \in T(x,V).

L1
1.2

For the second inclusion, let KXK \subseteq X be compact, let f0C(X,Y)f_0 \in C(X,Y), let ε>0\varepsilon > 0 be real and let gBK(f0,ε)g \in B_K(f_0,\varepsilon).

L2
2.1

Under step 1.1: f(x)Vf(x) \in V with VV open, so there is a real ε>0\varepsilon > 0 with B(f(x),ε)VB(f(x),\varepsilon) \subseteq V; and {x}\{x\} is a compact subset of XX.

step 1.1L5L6choose
2.2

Under step 1.2: if K=K = \varnothing then BK(f0,ε)=C(X,Y)B_K(f_0,\varepsilon) = C(X,Y), which is open in Tu\mathcal{T}_{\mathrm{u}}; so assume KK \ne \varnothing, put M:=maxxKd(f0(x),g(x))M := \max_{x \in K} d(f_0(x),g(x)), which exists and satisfies M<εM < \varepsilon, and put δ:=min{εM, 1}/2\delta := \min\{\varepsilon - M,\ 1\}/2, a real with 0<δ1/20 < \delta \le 1/2 and 2δεM2\delta \le \varepsilon - M.

step 1.2L2L3L7
3.1

Under step 1.1: B{x}(f,ε)T(x,V)B_{\{x\}}(f,\varepsilon) \subseteq T(x,V), since gB{x}(f,ε)g \in B_{\{x\}}(f,\varepsilon) means d(f(x),g(x))<εd(f(x),g(x)) < \varepsilon, that is g(x)B(f(x),ε)Vg(x) \in B(f(x),\varepsilon) \subseteq V.

step 2.1L2
3.2

Under step 1.2 with KK \ne \varnothing: let hBρˉ(g,δ)C(X,Y)h \in B_{\bar\rho}(g,\delta) \cap C(X,Y); then for every xXx \in X we have dˉ(g(x),h(x))ρˉ(g,h)<δ1/2<1\bar d(g(x),h(x)) \le \bar\rho(g,h) < \delta \le 1/2 < 1, hence d(g(x),h(x))=dˉ(g(x),h(x))<δd(g(x),h(x)) = \bar d(g(x),h(x)) < \delta.

step 2.2L7
4.1

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

step 2.1step 3.1L2L4
4.2

Under step 1.2 with KK \ne \varnothing: for xKx \in K we get d(f0(x),h(x))d(f0(x),g(x))+d(g(x),h(x))<M+δM+(εM)=εd(f_0(x),h(x)) \le d(f_0(x),g(x)) + d(g(x),h(x)) < M + \delta \le M + (\varepsilon - M) = \varepsilon, so hBK(f0,ε)h \in B_K(f_0,\varepsilon); hence Bρˉ(g,δ)C(X,Y)BK(f0,ε)B_{\bar\rho}(g,\delta) \cap C(X,Y) \subseteq B_K(f_0,\varepsilon).

step 2.2step 3.2
5.1

By step 4.1 every generating set of Tpt\mathcal{T}_{\mathrm{pt}} lies in Tcc\mathcal{T}_{\mathrm{cc}}, so TptTcc\mathcal{T}_{\mathrm{pt}} \subseteq \mathcal{T}_{\mathrm{cc}}.

step 4.1L1L4
5.2

By steps 2.2 and 4.2 every point of every basic set of Tcc\mathcal{T}_{\mathrm{cc}} has a ball of the uniform metric around it inside that set, so every such basic set is open in Tu\mathcal{T}_{\mathrm{u}} and hence TccTu\mathcal{T}_{\mathrm{cc}} \subseteq \mathcal{T}_{\mathrm{u}}.

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)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 XX itself need not be compact: a uniform bound over all of XX 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 11 before it can be read as an untruncated distance. That costs nothing, since δ\delta is being made small in any case.

  • Nonemptiness of XX is a hypothesis about the uniform metric only. The inclusion TptTcc\mathcal{T}_{\mathrm{pt}} \subseteq \mathcal{T}_{\mathrm{cc}} 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 XX is itself compact, then K=XK = X is an admissible compact set and the chain collapses at its right end: compact convergence and uniform convergence agree on C(X,Y)C(X,Y). The companion page works that case on [0,1][0,1] and separates the two on R\mathbb{R}.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 127 results over 22 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources