Alphabeta Math
Session-authored (Fable 5 assisted)
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.

16 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Function Space Topologies and the Exponential Law

1 · Prerequisites

2 · Summary

Objective. A set of functions is a set, and there is no one topology on it. This page puts four topologies on the continuous maps XYX \to Y, says exactly what each one measures, proves how they compare, and then uses the best behaved of them to reach the exponential law. The four are the topology of pointwise convergence, the topology of uniform convergence, the topology of compact convergence, and the compact-open topology; the third and the fourth turn out to be the same topology whenever both are defined, which is what makes the theory usable.

The standing hypotheses, and why they are what they are. The page's standing convention is that the domain XX is a metric space, but each item carries only the hypothesis its own proof uses, and several need much less. Where the domain must be metric, that is forced rather than chosen: an item quantifying over the compact subsets of the domain needs a notion of compactness, and the only one this library has at this point in the reading order is Open cover, subcover, compact metric space, and compact subset of a metric space, defined for metric spaces. That covers the compact-open topology, compact convergence, the evaluation map, the exponential law and Dini's theorem. The pointwise and uniform constructions do not: they are stated for a bare set, or a nonempty set, and the uniform limit theorem is stated for an arbitrary topological domain, no distance in XX being used in its proof. The target YY is an arbitrary topological space wherever open sets suffice, and is required to be metric exactly where a distance d(f(x),g(x))d(f(x),g(x)) is written. Standing hypotheses on this page: a metric domain, where the target must be metric, and why the compact-open topology is built from metric compactness collects the standing hypotheses, records the two places where this page deliberately mints a new object rather than reusing a published one, and states plainly what the page does not do.

Pointwise convergence, and why it is not enough. The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y) identifies YXY^{X} with the product xXY\prod_{x \in X} Y and gives it the product topology, so a basic neighbourhood constrains a function at finitely many points. A sequence converges in the topology of pointwise convergence exactly when it converges at every point justifies the name: a sequence converges in it exactly when it converges at every point. That topology is too coarse for analysis, and the companion page shows why with a sequence of continuous functions whose pointwise limit is discontinuous.

Uniform convergence. 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} mints 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\} on YXY^{X} for a nonempty set XX and a metric target. It is a genuinely new object, not the published supremum metric: The supremum metric d(f,g)=supxf(x)g(x)d_\infty(f,g) = \sup_x |f(x) - g(x)| is a metric on the bounded real-valued functions on a nonempty set is stated for the bounded real-valued functions on a nonempty set, so it can carry neither an arbitrary metric target nor an unbounded function. Truncating at 11 removes the boundedness hypothesis at no topological cost. 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) defines uniform convergence and the metric topology of ρˉ\bar\rho, and Convergence in the uniform metric is exactly uniform convergence: one NN serving every point proves that convergence in that metric is exactly uniform convergence, which is what entitles the topology to its name. The companion page checks that on C([0,1],R)C([0,1],\mathbb{R}), where the published supremum metric is also defined, the two metrics induce the same topology.

Compact convergence and the compact-open topology. 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 takes the sets BK(f,ε)={g:d(f(x),g(x))<εB_K(f,\varepsilon) = \{\, g : d(f(x),g(x)) < \varepsilon for every xK}x \in K \,\} as a basis and discharges the basis conditions in full; along the way it proves three facts reused across the page, that a union of two compact sets is compact, that xd(f(x),g(x))x \mapsto d(f(x),g(x)) is continuous, and that on a nonempty compact set it attains a maximum. 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\} is the topology generated by the sets S(K,V)={f:f[K]V}S(K,V) = \{\, f : f[K] \subseteq V \,\} for KK compact and VV open, and it needs no metric on the target at all. 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 proves that for a metric domain and a metric target these are the same topology, and 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 arranges the three named topologies in order: uniform is finer than compact convergence, which is finer than pointwise. No strictness is claimed there, and the companion page supplies witnesses separating each pair.

What uniform convergence buys. A uniform limit of continuous functions is continuous, so C(X,Y)C(X,Y) is closed in YXY^{X} under the uniform metric proves the ε/3\varepsilon/3 criterion — a function uniformly approximated by continuous functions is continuous — and deduces that C(X,Y)C(X,Y) is a closed subset of YXY^{X} in the uniform metric. It is stated for an arbitrary topological domain, since no distance in XX is used, and its proof of closedness is arranged to spend no choice principle. If (Y,d)(Y,d) is complete then YXY^{X} is complete in the uniform metric, and so is C(X,Y)C(X,Y) then gives completeness: if (Y,d)(Y,d) is complete so is (YX,ρˉ)(Y^{X}, \bar\rho), and so is C(X,Y)C(X,Y), being closed in it.

Evaluation, and the exponential law. The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x) introduces e(f,x)=f(x)e(f,x) = f(x) and observes that continuity in each variable separately is immediate while joint continuity is not. If XX is a locally compact metric space then the evaluation map is continuous for the compact-open topology supplies the hypothesis that makes it true. That hypothesis is Locally compact metric space: every point has a compact neighbourhood, minted here as the metric special case of a notion the library also defines for arbitrary topological spaces, and carrying a dictionary remark recording that agreement; In a locally compact metric space every point has arbitrarily small compact closed balls, hence a neighbourhood base of compact sets upgrades it to a neighbourhood base of compact closed balls. Tube lemma: if KK is a compact subset of a metric space XX, ZZ is a topological space and NN is open in X×ZX \times Z with K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0 is the other half of the machinery, and If f:X×ZYf : X \times Z \to Y is continuous then its transpose F:ZC(X,Y)F : Z \to C(X,Y), F(z)(x)=f(x,z)F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on XX beyond being metric uses it to show that the transpose of a continuous f:X×ZYf : X \times Z \to Y is a continuous map ZC(X,Y)Z \to C(X,Y), with no hypothesis on XX beyond being metric.

The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology assembles the two halves. It is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) for a locally compact metric XX and arbitrary spaces ZZ and YY — an assertion about two sets of continuous maps and a correspondence between them. It is not a homeomorphism, and the page never says it is: no topology is placed on either side, and the theorem's own remark states exactly what the homeomorphism form would additionally require. It is not a missing notion of compactness: compactness for an arbitrary topological space, and the tube lemma for a compact factor of an arbitrary product, are both developed earlier in the reading order, so "compact subset" has meaning on both sides. What is missing is the topology itself — 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\} is stated for a metric domain, whereas ZZ here is an arbitrary topological space and X×ZX \times Z carries no metric. None of that is done here, and nothing above assumes it.

Dini's theorem, and one definition for a later page. Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly proves that on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly, and records where each of its four hypotheses is spent. Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces defines equicontinuity at a point, uniform equicontinuity and pointwise boundedness; it is placed here solely so that the page proving the Ascoli-Arzelà theorem has the vocabulary earlier in the reading order. Neither Ascoli-Arzelà nor Stone-Weierstrass is stated or proved on this page.

Three false statements are recorded with explicit witnesses, and each names a hypothesis that cannot be dropped: pointwise convergence does not give uniform convergence on compact sets, the compact-open topology is not always metrizable — the witness is R\mathbb{R} with the discrete metric, where the topology is the product topology on RR\mathbb{R}^{\mathbb{R}} and is not first countable — and the evaluation map is not continuous for every metric domain, the witness being Q\mathbb{Q}, which has no compact neighbourhoods at all.

Choice bookkeeping. Every item on this page states which choice principle it spends. Only one spends anything: the failure of metrizability uses the Axiom of Countable Choice once, at the step where countably many finite sets are united. Everything else here, including the tube lemma, completeness and closedness of C(X,Y)C(X,Y), is a theorem of ZF.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)

Definition

Let XX be a set and let (Y,TY)(Y, \mathcal{T}_Y) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Write

YX  :=  xXY,Y^{X} \;:=\; \prod_{x \in X} Y ,

the product of the constant family whose factor at every index xXx \in X is YY (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Unwinding that definition, an element of YXY^{X} is a function with domain XX taking its value at each xx in YY; so YXY^{X} is the set of all functions XYX \to Y, and the projection at xx is evaluation,

πx:YXY,πx(f)=f(x).\pi_x : Y^{X} \to Y, \qquad \pi_x(f) = f(x) .

The topology of pointwise convergence on YXY^{X} is the product topology: the initial topology of the family (πx)xX(\pi_x)_{x \in X} (The initial topology of a family of maps into spaces and the final topology of a family of maps out of spaces, and the subspace topology as the model initial topology), that is the topology generated by the subbasis

G  :=  {πx1[V]  :  xX, VTY},πx1[V]={fYX:f(x)V}.\mathcal{G} \;:=\; \{\, \pi_x^{-1}[V] \;:\; x \in X,\ V \in \mathcal{T}_Y \,\}, \qquad \pi_x^{-1}[V] = \{\, f \in Y^{X} : f(x) \in V \,\} .

By A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis the finite intersections of members of G\mathcal{G} form a basis for it (Basis and subbasis for a topology, and the topology generated by a family of sets), so the basic open sets are exactly the sets

{fYX  :  f(xj)Vj for every j<n}(nN, x0,,xn1X, V0,,Vn1TY),\{\, f \in Y^{X} \;:\; f(x_j) \in V_j \text{ for every } j < n \,\} \qquad (n \in \mathbb{N},\ x_0, \dots, x_{n-1} \in X,\ V_0, \dots, V_{n-1} \in \mathcal{T}_Y),

the value n=0n = 0 giving the empty intersection YXY^{X} itself. A basic open set therefore constrains a member of YXY^{X} at finitely many points only, and that is the whole content of the topology.

The restriction to the continuous maps. Suppose in addition that XX carries a topology, and write

C(X,Y)  :=  {fYX:f is continuous}C(X,Y) \;:=\; \{\, f \in Y^{X} : f \text{ is continuous} \,\}

(Continuity of a map of topological spaces at a point and globally). The topology of pointwise convergence on C(X,Y)C(X,Y) is the subspace topology inherited from YXY^{X} (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); its subbasic open sets are the traces πx1[V]C(X,Y)\pi_x^{-1}[V] \cap C(X,Y), since tracing carries a subbasis to a subbasis (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).

Nothing on this page gives C(X,Y)C(X,Y) a default topology. The set C(X,Y)C(X,Y) carries several different topologies below, and every statement names the one it means at the point of use.

Remarks

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

A sequence converges in the topology of pointwise convergence exactly when it converges at every point

Statement

Let XX be a set, let (Y,TY)(Y, \mathcal{T}_Y) be a topological space, and give YXY^{X} the topology 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)). Let (fk)(f_k) be a sequence in YXY^{X} and let fYXf \in Y^{X}. Then

fkf in YXfk(x)f(x) in Y for every xX,f_k \to f \text{ in } Y^{X} \qquad \Longleftrightarrow \qquad f_k(x) \to f(x) \text{ in } Y \text{ for every } x \in X ,

convergence being that of Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure on both sides.

No uniqueness of limits is asserted on either side. In a general topological space a sequence may converge to several points, and the equivalence above is between two conditions on the pair ((fk),f)((f_k), f), not between two values (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure). No choice principle is used: the only selection made below is of a least natural number and of a maximum among finitely many.

Facts & Assumptions

Given: A set XX, a topological space (Y,TY)(Y,\mathcal{T}_Y), the space YXY^{X} with the topology of pointwise convergence, a sequence (fk)(f_k) in YXY^{X} and a point fYXf \in Y^{X}; ι\iota is the canonical natural of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L1]

For xXx \in X and VTYV \in \mathcal{T}_Y the set πx1[V]={gYX:g(x)V}\pi_x^{-1}[V] = \{\, g \in Y^{X} : g(x) \in V \,\} is open in YXY^{X}, and the sets {gYX:g(xj)Vj for every j<n}\{\, g \in Y^{X} : g(x_j) \in V_j \text{ for every } j < n \,\}, for nNn \in \mathbb{N}, points x0,,xn1Xx_0, \dots, x_{n-1} \in X and open V0,,Vn1YV_0, \dots, V_{n-1} \subseteq Y, form a basis for the topology 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), The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis).

[L2]

A set NN is a neighbourhood of a point pp exactly when there is an open UU with pUNp \in U \subseteq N; in particular an open set containing pp is a neighbourhood of pp (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L3]

gkgg_k \to g in a topological space means: for every neighbourhood NN of gg there is KNK \in \mathbb{N} with gkNg_k \in N for every kKk \ge K (Convergence and cluster points of a sequence in a topological space, sequential continuity, and the sequential closure).

[L4]

If B\mathcal{B} is a basis for a topology and NN is a neighbourhood of gg, then there is BBB \in \mathcal{B} with gBNg \in B \subseteq N (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, Basis and subbasis for a topology, and the topology generated by a family of sets).

[L5]

Every nonempty subset of N\mathbb{N} has a least element (The well-ordering principle).

[L6]

For n1n \ge 1 and natural numbers k0,,kn1k_0, \dots, k_{n-1} there is an index j<nj^{\ast} < n with kjkjk_j \le k_{j^{\ast}} for every j<nj < n: the nonempty finite set of reals {ι(k0),,ι(kn1)}\{\iota(k_0), \dots, \iota(k_{n-1})\} has a maximum, attained at some index, and ι\iota is strictly increasing on N\mathbb{N}, hence reflects the order (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

Proof

technique · direct
1.1

Suppose fkff_k \to f in YXY^{X}; fix xXx \in X and a neighbourhood NN of f(x)f(x) in YY, and fix an open VYV \subseteq Y with f(x)VNf(x) \in V \subseteq N.

assume-hypL2choose
1.2

Suppose instead that fk(x)f(x)f_k(x) \to f(x) in YY for every xXx \in X, and let NN be a neighbourhood of ff in YXY^{X}.

assume-hypL2
2.1

Under the assumption of step 1.1: πx1[V]\pi_x^{-1}[V] is open in YXY^{X} and contains ff, hence is a neighbourhood of ff, so there is KNK \in \mathbb{N} with fkπx1[V]f_k \in \pi_x^{-1}[V] for every kKk \ge K, that is fk(x)VNf_k(x) \in V \subseteq N for every kKk \ge K.

step 1.1L1L2L3
2.2

Under the assumption of step 1.2: there are nNn \in \mathbb{N}, points x0,,xn1Xx_0, \dots, x_{n-1} \in X and open V0,,Vn1YV_0, \dots, V_{n-1} \subseteq Y such that fBNf \in B \subseteq N, where B:={gYX:g(xj)Vj for every j<n}B := \{\, g \in Y^{X} : g(x_j) \in V_j \text{ for every } j < n \,\}.

step 1.2L1L4choose
3.1

Since NN was an arbitrary neighbourhood of f(x)f(x) and xx an arbitrary point of XX, step 2.1 says exactly that fk(x)f(x)f_k(x) \to f(x) in YY for every xXx \in X; this is the forward implication.

step 2.1L3
3.2

If n=0n = 0 in step 2.2 then BB is the empty intersection YXY^{X}, so fkBNf_k \in B \subseteq N for every kNk \in \mathbb{N}.

step 2.2L1
3.3

If n1n \ge 1 in step 2.2 then for each j<nj < n the set Aj:={mN:fk(xj)Vj for every km}A_j := \{\, m \in \mathbb{N} : f_k(x_j) \in V_j \text{ for every } k \ge m \,\} is nonempty, because fBf \in B gives f(xj)Vjf(x_j) \in V_j with VjV_j open, hence VjV_j is a neighbourhood of f(xj)f(x_j), and fk(xj)f(xj)f_k(x_j) \to f(x_j); put Nj:=minAjN_j := \min A_j.

step 1.2step 2.2L2L3L5
4.1

If n1n \ge 1: there is j<nj^{\ast} < n with NjNjN_j \le N_{j^{\ast}} for every j<nj < n, and then every kNjk \ge N_{j^{\ast}} satisfies kNjk \ge N_j for every j<nj < n, so fk(xj)Vjf_k(x_j) \in V_j for every j<nj < n, that is fkBNf_k \in B \subseteq N.

step 2.2step 3.3L6
5.1

By steps 3.2 and 4.1 there is in either case a KNK \in \mathbb{N} with fkNf_k \in N for every kKk \ge K, namely K=0K = 0 when n=0n = 0 and K=NjK = N_{j^{\ast}} when n1n \ge 1; as NN was an arbitrary neighbourhood of ff, this says fkff_k \to f in YXY^{X}, which is the converse implication.

step 3.2step 4.1L3
6.1

Steps 3.1 and 5.1 are the two implications, so the two conditions are equivalent.

step 3.1step 5.1

Remarks

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-07-29 (claude-sonnet-5)Open item page →

Locally compact metric space: every point has a compact neighbourhood

Definition

Let (X,d)(X,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), with balls as in Open ball, closed ball and sphere in a metric space and compact subsets as in Open cover, subcover, compact metric space, and compact subset of a metric space.

(X,d)(X,d) is locally compact if for every xXx \in X there are a compact subset KXK \subseteq X and a real r>0r > 0 with

B(x,r)    K.B(x,r) \;\subseteq\; K .

This is the condition "every point has a compact neighbourhood", written out. Give XX its metric topology Td\mathcal{T}_d (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), so that (X,Td)(X, \mathcal{T}_d) is a topological space (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). A set KXK \subseteq X is a neighbourhood of xx in the sense of Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open exactly when some open UU satisfies xUKx \in U \subseteq K, and by 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 that holds exactly when some ball B(x,r)B(x,r) satisfies B(x,r)KB(x,r) \subseteq K. So the displayed condition says precisely that xx has a compact neighbourhood, and the two readings are the same condition and not two notions.

Two conventions are fixed here, because both are live in the literature.

Every compact metric space is locally compact, since K:=XK := X and any r>0r > 0 serve at every point. The empty metric space is locally compact, the condition being vacuous.

Remarks

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

In a locally compact metric space every point has arbitrarily small compact closed balls, hence a neighbourhood base of compact sets

Statement

Let (X,d)(X,d) be a locally compact metric space (Locally compact metric space: every point has a compact neighbourhood) and let xXx \in X. Then there is a real r0>0r_0 > 0 such that

  1. Bˉ(x,r)\bar B(x,r) is a compact subset of XX (Open ball, closed ball and sphere in a metric space, Open cover, subcover, compact metric space, and compact subset of a metric space) for every real rr with 0<r<r00 < r < r_0; and
  2. the family {Bˉ(x,r):0<r<r0}\{\, \bar B(x,r) : 0 < r < r_0 \,\} is a neighbourhood base at xx (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open) consisting of compact sets: every neighbourhood of xx contains one of these closed balls.

Note that the closed ball itself is compact, not merely its closure; a closed ball is already closed (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed). No choice principle is used.

Facts & Assumptions

Given: A locally compact metric space (X,d)(X,d) and a point xXx \in X; balls B(x,r)B(x,r) and Bˉ(x,r)\bar B(x,r) as in Open ball, closed ball and sphere in a metric space.

[A1]

Local compactness at xx: there are a compact subset KXK \subseteq X and a real r0>0r_0 > 0 with B(x,r0)KB(x,r_0) \subseteq K (Locally compact metric space: every point has a compact neighbourhood).

[L2]

A subset AXA \subseteq X is compact exactly when the metric subspace (A,dA)(A, d_A) is a compact metric space, dAd_A being the restriction of dd; and for AKXA \subseteq K \subseteq X the metric AA inherits from (K,dK)(K,d_K) is dAd_A, both being the restriction of dd to A×AA \times A (Open cover, subcover, compact metric space, and compact subset of a metric space, Isometry, isometric embedding, and the subspace metric on a subset).

[L4]

A closed subset of a compact metric space is a compact subset of it (A closed subset of a compact metric space is compact).

[L5]

B(x,s)Bˉ(x,s)B(x,s) \subseteq \bar B(x,s), and 0<st0 < s \le t gives B(x,s)B(x,t)B(x,s) \subseteq B(x,t) and Bˉ(x,s)Bˉ(x,t)\bar B(x,s) \subseteq \bar B(x,t); moreover Bˉ(x,s)B(x,t)\bar B(x,s) \subseteq B(x,t) whenever 0<s<t0 < s < t, since d(x,y)s<td(x,y) \le s < t (Open ball, closed ball and sphere in a metric space).

[L6]

A set NN is a neighbourhood of xx exactly when there is a real s>0s > 0 with B(x,s)NB(x,s) \subseteq N, the balls around xx being a neighbourhood base there (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, 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).

[L7]

The minimum of a two-element set of reals exists and is one of the two elements (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Proof

technique · direct
1.1

Fix KK and r0r_0 as in [A1], so that KK is compact and B(x,r0)KB(x,r_0) \subseteq K.

A1choose
1.2

Let rr be a real with 0<r<r00 < r < r_0.

given
1.3

For claim 2, let NN be a neighbourhood of xx and fix a real s>0s > 0 with B(x,s)NB(x,s) \subseteq N.

L6choose
2.1

Bˉ(x,r)B(x,r0)K\bar B(x,r) \subseteq B(x,r_0) \subseteq K, the first inclusion because r<r0r < r_0.

step 1.1step 1.2L5
2.2

XBˉ(x,r)X \setminus \bar B(x,r) is open in (X,d)(X,d), since Bˉ(x,r)\bar B(x,r) is closed.

step 1.2L1
2.3

Put r:=min{s,r0}/2r := \min\{s, r_0\}/2, a real with 0<r0 < r, r<r0r < r_0 and r<sr < s, since min{s,r0}\min\{s,r_0\} is one of ss and r0r_0 and is at most each of them.

step 1.3step 1.1L7
3.1

KBˉ(x,r)=(XBˉ(x,r))KK \setminus \bar B(x,r) = (X \setminus \bar B(x,r)) \cap K is open in the metric subspace (K,dK)(K, d_K), being the trace on KK of a set open in XX; hence Bˉ(x,r)=Bˉ(x,r)K\bar B(x,r) = \bar B(x,r) \cap K is closed in (K,dK)(K,d_K).

step 2.1step 2.2L2L3
4.1

(K,dK)(K,d_K) is a compact metric space by step 1.1, so its closed subset Bˉ(x,r)\bar B(x,r) is a compact subset of it, that is the metric subspace of (K,dK)(K,d_K) on Bˉ(x,r)\bar B(x,r) is a compact metric space.

step 1.1step 3.1L2L4
5.1

That metric subspace is (Bˉ(x,r),dBˉ(x,r))(\bar B(x,r), d_{\bar B(x,r)}), the metric being the restriction of dd either way, so Bˉ(x,r)\bar B(x,r) is a compact subset of XX; this is claim 1.

step 4.1L2
6.1

By step 5.1 the set Bˉ(x,r)\bar B(x,r) is compact, and Bˉ(x,r)B(x,s)N\bar B(x,r) \subseteq B(x,s) \subseteq N because r<sr < s; moreover Bˉ(x,r)\bar B(x,r) is a neighbourhood of xx, since B(x,r)Bˉ(x,r)B(x,r) \subseteq \bar B(x,r) and B(x,r)B(x,r) is open and contains xx.

step 5.1step 1.3step 2.3L5L6
7.1

Steps 5.1 and 6.1 give claims 1 and 2: every Bˉ(x,r)\bar B(x,r) with 0<r<r00 < r < r_0 is a compact neighbourhood of xx, and every neighbourhood of xx contains one of them.

step 5.1step 6.1

Remarks

LemmaStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-07-29 (claude-sonnet-5)Open item page →

Tube lemma: if KK is a compact subset of a metric space XX, ZZ is a topological space and NN is open in X×ZX \times Z with K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0

Statement

Let (X,d)(X,d) be a metric space carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let (Z,TZ)(Z, \mathcal{T}_Z) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and give X×ZX \times Z the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Let KXK \subseteq X be a compact subset (Open cover, subcover, compact metric space, and compact subset of a metric space), let z0Zz_0 \in Z, and let NX×ZN \subseteq X \times Z be open with

K×{z0}    N.K \times \{z_0\} \;\subseteq\; N .

Then there is an open WZW \subseteq Z with z0Wz_0 \in W and

K×W    N.K \times W \;\subseteq\; N .

The set K×WK \times W is the tube of the name. The case K=K = \varnothing is included and is settled by W=ZW = Z. No choice principle is used at all: the cover produced below is indexed by pairs of open sets, so the ambient form of compactness returns the second entries together with the indices and nothing has to be selected afterwards.

Facts & Assumptions

Given: A metric space (X,d)(X,d) with its metric topology, a topological space (Z,TZ)(Z,\mathcal{T}_Z), the product X×ZX \times Z with the product topology, a compact KXK \subseteq X, a point z0Zz_0 \in Z and an open NX×ZN \subseteq X \times Z with K×{z0}NK \times \{z_0\} \subseteq N.

[A1]

K×{z0}NK \times \{z_0\} \subseteq N, that is (a,z0)N(a, z_0) \in N for every aKa \in K.

[L2]

KK is a compact subset of XX exactly when for every set II and every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with KiIUiK \subseteq \bigcup_{i \in I} U_i there are nNn \in \mathbb{N} and i0,,inIi_0, \dots, i_n \in I with KUi0UinK \subseteq U_{i_0} \cup \dots \cup U_{i_n}, or else K=K = \varnothing (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).

[L3]

ZZ is open in ZZ, and an intersection of finitely many open subsets of ZZ is open (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison, axioms (T1) and (T3) iterated).

Proof

technique · direct
1.1

If K=K = \varnothing then K×Z=NK \times Z = \varnothing \subseteq N and ZZ is an open set containing z0z_0, so W:=ZW := Z settles the claim; assume from here on that KK \ne \varnothing.

L3given
1.2

Let P\mathcal{P} be the set of all pairs (U,W)(U, W) with UU open in XX, WW open in ZZ, z0Wz_0 \in W and U×WNU \times W \subseteq N; this is a set cut out by a property of the pair, and nothing is selected in forming it.

constructL1
2.1

The family (U)(U,W)P(U)_{(U,W) \in \mathcal{P}}, indexed by P\mathcal{P} and assigning to each pair its first entry, is a family of open subsets of XX and it covers KK: for aKa \in K we have (a,z0)N(a,z_0) \in N by [A1], so by [L1] there are UU open in XX and WW open in ZZ with (a,z0)U×WN(a,z_0) \in U \times W \subseteq N, and then (U,W)P(U,W) \in \mathcal{P} with aUa \in U.

A1L1step 1.2
3.1

Since KK \ne \varnothing is compact, there are nNn \in \mathbb{N} and pairs (U0,W0),,(Un,Wn)P(U_0,W_0), \dots, (U_n,W_n) \in \mathcal{P} with KU0UnK \subseteq U_0 \cup \dots \cup U_n.

step 1.1step 2.1L2
4.1

Each index returned by step 3.1 is itself a pair, so its second entry WjW_j is given with it and nothing is chosen; put W:=W0WnW := W_0 \cap \dots \cap W_n, which contains z0z_0 because every WjW_j does, and is open in ZZ as an intersection of n+11n+1 \ge 1 open sets.

step 3.1L3
5.1

K×WNK \times W \subseteq N: given aKa \in K and zWz \in W, step 3.1 gives jnj \le n with aUja \in U_j, and zWWjz \in W \subseteq W_j, so (a,z)Uj×WjN(a,z) \in U_j \times W_j \subseteq N by the defining property of P\mathcal{P}.

step 1.2step 3.1step 4.1
6.1

Steps 4.1 and 5.1 exhibit an open Wz0W \ni z_0 with K×WNK \times W \subseteq N, which with step 1.1 proves the lemma in both cases.

step 1.1step 4.1step 5.1

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

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\}

Definition

Let (X,d)(X,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) carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let (Y,TY)(Y, \mathcal{T}_Y) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let

C(X,Y)  =  {f:XY  :  f is continuous}C(X,Y) \;=\; \{\, f : X \to Y \;:\; f \text{ is continuous} \,\}

(Continuity of a map of topological spaces at a point and globally). For a compact subset KXK \subseteq X (Open cover, subcover, compact metric space, and compact subset of a metric space) and an open VTYV \in \mathcal{T}_Y put

S(K,V)  :=  {fC(X,Y)  :  f[K]V}  =  {fC(X,Y):f(x)V for every xK}.S(K,V) \;:=\; \{\, f \in C(X,Y) \;:\; f[K] \subseteq V \,\} \;=\; \{\, f \in C(X,Y) : f(x) \in V \text{ for every } x \in K \,\} .

The compact-open topology on C(X,Y)C(X,Y) is the topology generated by

Sco  :=  {S(K,V)  :  KX compact, VTY}\mathcal{S}_{\mathrm{co}} \;:=\; \{\, S(K,V) \;:\; K \subseteq X \text{ compact},\ V \in \mathcal{T}_Y \,\}

as a subbasis (Basis and subbasis for a topology, and the topology generated by a family of sets). By A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis the finite intersections

S(K0,V0)S(Kn1,Vn1)(nN)S(K_0,V_0) \cap \dots \cap S(K_{n-1},V_{n-1}) \qquad (n \in \mathbb{N})

form a basis for it, the value n=0n = 0 giving the empty intersection C(X,Y)C(X,Y). Nothing has to be checked for this to be a topology: a topology generated by an arbitrary family exists and is the coarsest one containing it (Basis and subbasis for a topology, and the topology generated by a family of sets).

Two degenerate members, recorded because they are used. S(,V)=C(X,Y)S(\varnothing, V) = C(X,Y) for every open VV, the empty set being compact and f[]=f[\varnothing] = \varnothing; and S(K,Y)=C(X,Y)S(K, Y) = C(X,Y) for every compact KK. Both are the whole space, so neither constrains anything, and arguments below dispose of them separately rather than dividing by a distance that does not exist.

The domain is metric, and the target is not. Compactness of KK is Open cover, subcover, compact metric space, and compact subset of a metric space, which is defined for subsets of a metric space and, at this point in the reading order, for nothing else; that is why XX carries a metric here. The target YY needs only its open sets, so it is an arbitrary topological space throughout this definition and wherever the compact-open topology alone is in play. Where a distance in the target is used — the uniform metric, compact convergence, the comparison theorem — YY is required to be metric and the requirement is stated.

Compactness of KK is intrinsic (Open cover, subcover, compact metric space, and compact subset of a metric space): it means that the metric subspace (K,dK)(K, d_K) is a compact metric space. The equivalent description by families of open subsets of XX covering KK is 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, and it is cited at every step that uses it.

Notation. The letter SS carries two unrelated meanings in this library: S(x,r)S(x,r) is the sphere of centre xx and radius rr in a metric space (Open ball, closed ball and sphere in a metric space), and S(K,V)S(K,V) is the set defined above. The two are never ambiguous, because the first argument of a sphere is a point and its second a positive real, while the first argument of S(K,V)S(K,V) is a compact set and its second an open set; no item on this page writes a sphere.

Remarks

  • Why compact sets and open sets. S(K,V)S(K,V) says "ff maps all of KK into VV". Taking KK to be a single point recovers the subbasis of the topology 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)), so the compact-open topology is at least as fine as that one; taking KK large makes the condition a uniform one over KK, which is what the comparison with the topology of compact convergence on this page makes precise.

  • The definition is on C(X,Y)C(X,Y) and not on YXY^{X}. The sets S(K,V)S(K,V) could be written down for arbitrary functions, but the theory of this page uses that f[K]f[K] is compact when KK is and ff is continuous (The image of a compact metric space under a continuous map is compact, and so is the image of any compact subset), which is false for a discontinuous ff. The compact-open topology in this library is therefore a topology on continuous maps only.

  • Metrizability is not asserted. The compact-open topology need not be metrizable, and this page records that as a false statement with an explicit witness. What is proved here is that for a metric target it coincides with the topology of compact convergence, which for a suitable XX is metrizable by a metric this library does not construct.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passverified 2026-08-05 (claude-sonnet-5)Open item page →

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}

Statement

Let XX be a nonempty set, 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) and write

dˉ(u,v)  :=  min{d(u,v), 1}(u,vY),\bar d(u,v) \;:=\; \min\{\, d(u,v),\ 1 \,\} \qquad (u, v \in Y),

which is a metric on YY with dˉ1\bar d \le 1 everywhere (min(d,1)\min(d,1) and d/(1+d)d/(1+d) are metrics uniformly equivalent to dd, so every metric space carries a bounded metric with the same topology, claims 1 and 2). For f,gYXf, g \in Y^{X} (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)) put

R(f,g)  :=  {dˉ(f(x),g(x)):xX}R,ρˉ(f,g)  :=  supR(f,g).R(f,g) \;:=\; \{\, \bar d\big(f(x), g(x)\big) : x \in X \,\} \subseteq \mathbb{R}, \qquad \bar\rho(f,g) \;:=\; \sup R(f,g) .

This is well defined: R(f,g)R(f,g) is nonempty because XX is, and 11 is an upper bound of it, so the least upper bound exists (Complete ordered field (least-upper-bound property)) and is unique (Suprema and infima are unique).

Then ρˉ\bar\rho is a metric on YXY^{X} (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric), the uniform metric, and ρˉ(f,g)1\bar\rho(f,g) \le 1 for all f,gf, g.

Both hypotheses are used and neither is decoration. Nonemptiness of XX is what makes R(f,g)R(f,g) nonempty; for X=X=\varnothing the set YXY^X has a single element, but sup\sup\varnothing is undefined under the real-valued supremum convention used here (Conventions: sup\sup \emptyset, unbounded sets, and the extended reals). The extended real line is introduced later and is not the codomain of this metric. Truncating dd at 11 is what makes R(f,g)R(f,g) bounded above with no boundedness hypothesis on ff and gg; that is the whole reason the truncation is there.

Facts & Assumptions

Given: A nonempty set XX, a metric space (Y,d)(Y,d), functions f,g,hYXf, g, h \in Y^{X}, a fixed x0Xx_0 \in X, and dˉ\bar d, RR, ρˉ\bar\rho as displayed above.

[L2]

Least-upper-bound property: a nonempty subset of R\mathbb{R} bounded above has a least upper bound, which is an upper bound lying below every upper bound, and it is unique (Complete ordered field (least-upper-bound property), Suprema and infima are unique, Lower bound, bounded below, bounded set).

[L3]

Order arithmetic: inequalities may be added and a constant added to both sides, in the strict form of Order is preserved by adding a constant and by adding inequalities and, with the case of equality settled by totality of the order, in the nonstrict form; and a0a \le 0 together with a0a \ge 0 gives a=0a = 0 (Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · direct
1.1

For all f,gYXf, g \in Y^{X} the set R(f,g)R(f,g) is nonempty, since x0Xx_0 \in X contributes dˉ(f(x0),g(x0))\bar d(f(x_0),g(x_0)), and 11 is an upper bound of it by [L1]; so ρˉ(f,g)=supR(f,g)\bar\rho(f,g) = \sup R(f,g) exists, is unique, and satisfies ρˉ(f,g)1\bar\rho(f,g) \le 1.

givenL1L2
2.1

ρˉ(f,g)dˉ(f(x),g(x))0\bar\rho(f,g) \ge \bar d(f(x),g(x)) \ge 0 for every xXx \in X, a supremum being an upper bound of its set and dˉ\bar d being nonnegative.

step 1.1L1L2
2.2

Symmetry (M2): dˉ(g(x),f(x))=dˉ(f(x),g(x))\bar d(g(x),f(x)) = \bar d(f(x),g(x)) for every xx by (M2) for dˉ\bar d, so R(g,f)R(g,f) and R(f,g)R(f,g) are the same subset of R\mathbb{R} and have the same supremum.

step 1.1L1L2
2.3

Separation (M1), the other direction: if f=gf = g then R(f,g)={0}R(f,g) = \{0\} by (M1) for dˉ\bar d, and the least upper bound of {0}\{0\} is 00, so ρˉ(f,g)=0\bar\rho(f,g) = 0.

step 1.1L1L2
3.1

Separation (M1), one direction: if ρˉ(f,g)=0\bar\rho(f,g) = 0 then for every xXx \in X we have dˉ(f(x),g(x))0\bar d(f(x),g(x)) \le 0 by step 2.1 and dˉ(f(x),g(x))0\bar d(f(x),g(x)) \ge 0 by [L1], hence dˉ(f(x),g(x))=0\bar d(f(x),g(x)) = 0, hence f(x)=g(x)f(x) = g(x) by (M1) for dˉ\bar d; so f=gf = g, two elements of YXY^{X} being equal exactly when they agree at every point.

step 2.1L1L3
3.2

For every xXx \in X: dˉ(f(x),h(x))dˉ(f(x),g(x))+dˉ(g(x),h(x))ρˉ(f,g)+ρˉ(g,h)\bar d(f(x),h(x)) \le \bar d(f(x),g(x)) + \bar d(g(x),h(x)) \le \bar\rho(f,g) + \bar\rho(g,h), by (M3) for dˉ\bar d and because each supremum bounds its own set above.

step 1.1step 2.1L1L2L3
4.1

Triangle inequality (M3): by step 3.2 the real number ρˉ(f,g)+ρˉ(g,h)\bar\rho(f,g) + \bar\rho(g,h) is an upper bound of R(f,h)R(f,h), and ρˉ(f,h)\bar\rho(f,h) is the least upper bound of that set, so ρˉ(f,h)ρˉ(f,g)+ρˉ(g,h)\bar\rho(f,h) \le \bar\rho(f,g) + \bar\rho(g,h).

step 3.2L2
5.1

The function ρˉ:YX×YXR\bar\rho : Y^{X} \times Y^{X} \to \mathbb{R} therefore satisfies (M1) by steps 3.1 and 2.3, (M2) by step 2.2 and (M3) by step 4.1, so it is a metric on YXY^{X}, and ρˉ1\bar\rho \le 1 by step 1.1.

step 1.1step 2.2step 3.1step 2.3step 4.1L1

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

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)

Definition

Let XX be a nonempty set 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).

Uniform convergence. A sequence (fk)(f_k) in YXY^{X} (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)) converges uniformly to fYXf \in Y^{X} if for every real ε>0\varepsilon > 0 there is KNK \in \mathbb{N} such that

d(fk(x),f(x))<εfor every xX and every kK.d\big(f_k(x), f(x)\big) < \varepsilon \qquad \text{for every } x \in X \text{ and every } k \ge K .

The whole content is the quantifier order: one index KK must serve every point of XX at once, whereas pointwise convergence allows KK to depend on the point as well as on ε\varepsilon. As everywhere in this library N\mathbb{N} contains 00 and a sequence is indexed from 00 (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)).

The topology. The topology of uniform convergence (the uniform topology) on YXY^{X} is the metric topology Tρˉ\mathcal{T}_{\bar\rho} (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) of the uniform metric

ρˉ(f,g)=supxXmin{d(f(x),g(x)), 1}\bar\rho(f,g) = \sup_{x \in X} \min\{\, d(f(x),g(x)),\ 1 \,\}

of 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}. Its basic open sets are the balls Bρˉ(f,ε)B_{\bar\rho}(f,\varepsilon) (Open ball, closed ball and sphere in a metric space), and YXY^{X} with this topology is a metrizable space (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

On C(X,Y)C(X,Y). If XX carries a topology, the topology of uniform convergence on C(X,Y)C(X,Y) (Continuity of a map of topological spaces at a point and globally) is the subspace topology inherited from YXY^{X} (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). It is the metric topology of the restriction of ρˉ\bar\rho to C(X,Y)×C(X,Y)C(X,Y) \times C(X,Y): the subspace topology of a metric topology is the metric topology of the subspace metric (Isometry, isometric embedding, and the subspace metric on a subset, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not). So the two readings of the phrase agree, and C(X,Y)C(X,Y) carrying it is again metrizable.

The name is justified by the next item. That convergence in Tρˉ\mathcal{T}_{\bar\rho} is exactly uniform convergence in the sense defined above is not part of the definition; it is Convergence in the uniform metric is exactly uniform convergence: one NN serving every point , and it is what entitles the topology to the name.

XX is nonempty throughout. The uniform metric is defined only for nonempty XX (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}), so the topology of uniform convergence is defined only there. The notion of uniform convergence itself makes sense for X=X = \varnothing and is vacuous, every sequence converging uniformly to the unique element of YY^{\varnothing}; nothing below uses that case.

Remarks

  • Uniform convergence is a property of the metric dd, not of the topology of YY. Both quantifiers above are about distances. Two metrics inducing the same topology on YY can disagree about which sequences of functions converge uniformly, exactly as they can disagree about which sequences are Cauchy (Topologically, uniformly and Lipschitz equivalent metrics on a set). Read uniformly convergent as an abbreviation for uniformly convergent with respect to this metric, always.

  • The truncation at 11 does not affect the notion. The uniform metric truncates distances at 11 so that a supremum exists without a boundedness hypothesis, and the next item shows that the truncation is invisible to convergence: below the threshold 11 the truncated and untruncated distances agree, and convergence is a statement about arbitrarily small distances.

  • Uniform convergence is strictly stronger than pointwise convergence. Taking KK from the uniform condition serves at each individual point, so a uniformly convergent sequence converges pointwise; the converse fails, and the companion page exhibits a sequence of continuous functions on [0,1][0,1] converging pointwise to 00 with ρˉ(fk,0)=1\bar\rho(f_k, 0) = 1 for every kk.

LemmaStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

Convergence in the uniform metric is exactly uniform convergence: one NN serving every point

Statement

Let XX be a nonempty set, 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), and let ρˉ\bar\rho be the uniform metric on YXY^{X} (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}). Let (fk)(f_k) be a sequence in YXY^{X} and let fYXf \in Y^{X}. Then

fkf in (YX,ρˉ)(fk) converges uniformly to f,f_k \to f \text{ in } (Y^{X}, \bar\rho) \qquad \Longleftrightarrow \qquad (f_k) \text{ converges uniformly to } f ,

convergence in a metric space being Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R} and uniform convergence being 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).

This is what makes the name of the topology accurate, and it is the reason the truncation at 11 in the uniform metric costs nothing: below the threshold the truncated and untruncated distances agree, and convergence is a statement about arbitrarily small distances. No choice principle is used.

Facts & Assumptions

Given: A nonempty set XX, a metric space (Y,d)(Y,d), the truncated metric dˉ=min{d,1}\bar d = \min\{d,1\} on YY, the uniform metric ρˉ(g,h)=supxdˉ(g(x),h(x))\bar\rho(g,h) = \sup_x \bar d(g(x),h(x)) on YXY^{X}, a sequence (fk)(f_k) in YXY^{X} and a point fYXf \in Y^{X}.

[L1]

dˉ(u,v)d(u,v)\bar d(u,v) \le d(u,v) and dˉ(u,v)1\bar d(u,v) \le 1 for all u,vYu,v \in Y, the minimum of a two-element set of reals being a lower bound of both elements and one of them (min(d,1)\min(d,1) and d/(1+d)d/(1+d) are metrics uniformly equivalent to dd, so every metric space carries a bounded metric with the same topology, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L2]

If dˉ(u,v)<1\bar d(u,v) < 1 then dˉ(u,v)=d(u,v)\bar d(u,v) = d(u,v): the minimum min{d(u,v),1}\min\{d(u,v),1\} is one of its two arguments, and it is not 11, so it is d(u,v)d(u,v) (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, min(d,1)\min(d,1) and d/(1+d)d/(1+d) are metrics uniformly equivalent to dd, so every metric space carries a bounded metric with the same topology).

[L3]

ρˉ(g,h)\bar\rho(g,h) is an upper bound of {dˉ(g(x),h(x)):xX}\{\, \bar d(g(x),h(x)) : x \in X \,\} and is the least one; in particular dˉ(g(x),h(x))ρˉ(g,h)\bar d(g(x),h(x)) \le \bar\rho(g,h) for every xXx \in X, and any real bounding all these values above bounds ρˉ(g,h)\bar\rho(g,h) (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}, Complete ordered field (least-upper-bound property), Suprema and infima are unique).

[L4]

gkgg_k \to g in a metric space means: for every rational ε>0\varepsilon > 0 there is KNK \in \mathbb{N} with the distance from gkg_k to gg below ε\varepsilon for every kKk \ge K; and the test with a real ε>0\varepsilon > 0 is equivalent, since below every positive real lies a positive rational (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}, The rationals embed densely in the reals, Open ball, closed ball and sphere in a metric space).

[L5]

The minimum of two positive reals is positive, and halving a positive real gives a positive real strictly below it (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Ordered field, Complete ordered field (least-upper-bound property)).

Proof

technique · direct
1.1

Suppose (fk)(f_k) converges uniformly to ff, and let ε>0\varepsilon > 0 be real.

assume-hyp
1.2

Suppose instead that fkff_k \to f in (YX,ρˉ)(Y^{X}, \bar\rho), and let ε>0\varepsilon > 0 be real.

assume-hyp
2.1

Under step 1.1: put η:=ε/2\eta := \varepsilon / 2, a real with 0<η<ε0 < \eta < \varepsilon, and take KNK \in \mathbb{N} with d(fk(x),f(x))<ηd(f_k(x), f(x)) < \eta for every xXx \in X and every kKk \ge K.

step 1.1L5choose
2.2

Under step 1.2: put η:=min{ε,1}/2\eta := \min\{\varepsilon, 1\} / 2, a real with 0<η1/2<10 < \eta \le 1/2 < 1 and η<ε\eta < \varepsilon, and take KNK \in \mathbb{N} with ρˉ(fk,f)<η\bar\rho(f_k, f) < \eta for every kKk \ge K.

step 1.2L4L5choose
3.1

Under step 1.1: for kKk \ge K and every xXx \in X we have dˉ(fk(x),f(x))d(fk(x),f(x))<η\bar d(f_k(x), f(x)) \le d(f_k(x), f(x)) < \eta, so η\eta bounds that set of values above and hence ρˉ(fk,f)η<ε\bar\rho(f_k, f) \le \eta < \varepsilon.

step 2.1L1L3
3.2

Under step 1.2: for kKk \ge K and every xXx \in X we have dˉ(fk(x),f(x))ρˉ(fk,f)<η<1\bar d(f_k(x), f(x)) \le \bar\rho(f_k, f) < \eta < 1, so dˉ(fk(x),f(x))=d(fk(x),f(x))\bar d(f_k(x), f(x)) = d(f_k(x), f(x)) and therefore d(fk(x),f(x))<η<εd(f_k(x), f(x)) < \eta < \varepsilon.

step 2.2L2L3
4.1

Step 3.1 produces, for each real ε>0\varepsilon > 0, an index KK with ρˉ(fk,f)<ε\bar\rho(f_k,f) < \varepsilon for every kKk \ge K, which is convergence fkff_k \to f in (YX,ρˉ)(Y^{X},\bar\rho); this is the forward implication.

step 3.1L4
4.2

Step 3.2 produces, for each real ε>0\varepsilon > 0, an index KK with d(fk(x),f(x))<εd(f_k(x),f(x)) < \varepsilon for every xXx \in X and every kKk \ge K, which is uniform convergence of (fk)(f_k) to ff; this is the converse implication.

step 3.2
5.1

Steps 4.1 and 4.2 are the two implications, so the two conditions are equivalent.

step 4.1step 4.2

Remarks

  • Where the threshold 11 enters and where it does not. It enters only in step 3.2, which needs the distance to be strictly below 11 before the truncation can be undone; that is arranged by shrinking η\eta to at most 1/21/2, which costs nothing because η\eta is being made small anyway. It does not enter the forward direction at all, since dˉd\bar d \le d outright.

  • The lemma fails for the value of the distance, not for convergence. The numbers ρˉ(f,g)\bar\rho(f,g) and supxd(f(x),g(x))\sup_x d(f(x),g(x)) differ as soon as some distance exceeds 11, and the second need not exist. What the lemma says is that the two determine the same convergent sequences and the same limits, which is all a topology sees.

  • Uniform convergence implies pointwise convergence, and not conversely. From the definition, an index serving every point serves each point separately, so a uniformly convergent sequence converges at every point (A sequence converges in the topology of pointwise convergence exactly when it converges at every point). The converse fails, and the companion page exhibits the standard witness on [0,1][0,1].

DefinitionDefinition: Literature-sourcedProof: AI-generatedjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

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

Definition

Let (X,dX)(X,d_X) and (Y,d)(Y,d) be metric spaces (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 (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and let C(X,Y)C(X,Y) be the set of continuous maps XYX \to Y (Continuity of a map of topological spaces at a point and globally). For a compact subset KXK \subseteq X (Open cover, subcover, compact metric space, and compact subset of a metric space), a function fC(X,Y)f \in C(X,Y) and a real ε>0\varepsilon > 0 put

BK(f,ε)  :=  {gC(X,Y)  :  d(f(x),g(x))<ε for every xK}.B_K(f,\varepsilon) \;:=\; \{\, g \in C(X,Y) \;:\; d\big(f(x), g(x)\big) < \varepsilon \text{ for every } x \in K \,\} .

No supremum appears in this definition, deliberately: for K=K = \varnothing the condition is vacuous and B(f,ε)=C(X,Y)B_{\varnothing}(f,\varepsilon) = C(X,Y), whereas a supremum over the empty set does not exist in this library.

The family Bcc:={BK(f,ε):KX compact, fC(X,Y), ε>0}\mathcal{B}_{\mathrm{cc}} := \{\, B_K(f,\varepsilon) : K \subseteq X \text{ compact},\ f \in C(X,Y),\ \varepsilon > 0 \,\} is a basis for a unique topology on C(X,Y)C(X,Y) (A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis, claim 1); that topology is the topology of compact convergence (also called the topology of uniform convergence on compact sets). The verification is carried out below.

Three facts, discharged here and reused on this page

(U1) A union of two compact subsets of XX is compact. Let K1,K2XK_1, K_2 \subseteq X be compact and let (Ui)iI(U_i)_{i \in I} be open subsets of XX with K1K2iIUiK_1 \cup K_2 \subseteq \bigcup_{i \in I} U_i. If K1K2=K_1 \cup K_2 = \varnothing there is nothing to prove. Otherwise each KmK_m is covered by the same family, so by 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) either Km=K_m = \varnothing, and we take the empty list for it, or there are finitely many indices whose sets cover KmK_m; concatenating the two lists gives finitely many indices whose sets cover K1K2K_1 \cup K_2, and that list is nonempty because K1K2K_1 \cup K_2 is. By 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 again, K1K2K_1 \cup K_2 is compact. Nothing is selected: the indices are returned by the indexed form of compactness.

(U2) For f,gC(X,Y)f, g \in C(X,Y) the function φ(x):=d(f(x),g(x))\varphi(x) := d(f(x),g(x)) is a continuous map XRX \to \mathbb{R}, R\mathbb{R} carrying its usual metric (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded). Indeed for x,xXx, x' \in X,

φ(x)φ(x)d(f(x),g(x))d(f(x),g(x))+d(f(x),g(x))d(f(x),g(x))d(f(x),f(x))+d(g(x),g(x)),|\varphi(x) - \varphi(x')| \le \big|d(f(x),g(x)) - d(f(x'),g(x))\big| + \big|d(f(x'),g(x)) - d(f(x'),g(x'))\big| \le d\big(f(x),f(x')\big) + d\big(g(x),g(x')\big),

the first inequality by the triangle inequality for the absolute value (The triangle inequality, Absolute value in an ordered field) applied after inserting and removing d(f(x),g(x))d(f(x'),g(x)), and the second by the reverse triangle inequality (The reverse triangle inequality d(x,z)d(y,z)d(x,y)|d(x,z) - d(y,z)| \le d(x,y) in any metric space) applied twice, the second time after using the symmetry of dd. Given aXa \in X and a real ε>0\varepsilon > 0, continuity of ff and of gg at aa (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not) supplies reals δ1,δ2>0\delta_1, \delta_2 > 0 with d(f(x),f(a))<ε/2d(f(x),f(a)) < \varepsilon/2 for dX(x,a)<δ1d_X(x,a) < \delta_1 and d(g(x),g(a))<ε/2d(g(x),g(a)) < \varepsilon/2 for dX(x,a)<δ2d_X(x,a) < \delta_2; then δ:=min{δ1,δ2}>0\delta := \min\{\delta_1,\delta_2\} > 0 (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set) gives φ(x)φ(a)<ε|\varphi(x)-\varphi(a)| < \varepsilon whenever dX(x,a)<δd_X(x,a) < \delta.

(U3) For f,gC(X,Y)f, g \in C(X,Y) and a nonempty compact KXK \subseteq X the value maxxKd(f(x),g(x))\max_{x \in K} d(f(x),g(x)) exists. The restriction of φ\varphi to the metric subspace (K,dK)(K, d_K) (Isometry, isometric embedding, and the subspace metric on a subset) is continuous, the ε\varepsilon-δ\delta condition at a point of KK being the condition for φ\varphi read for the points of KK only; (K,dK)(K,d_K) is a nonempty compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space); so A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value gives a point of KK at which φ\varphi attains a greatest value.

Discharge of the basis conditions

(B1) Every fC(X,Y)f \in C(X,Y) lies in B(f,1)BccB_{\varnothing}(f,1) \in \mathcal{B}_{\mathrm{cc}}, so Bcc=C(X,Y)\bigcup \mathcal{B}_{\mathrm{cc}} = C(X,Y).

(B2) Let hBK1(f1,ε1)BK2(f2,ε2)h \in B_{K_1}(f_1,\varepsilon_1) \cap B_{K_2}(f_2,\varepsilon_2). For m{1,2}m \in \{1,2\} put δm:=εm\delta_m := \varepsilon_m if Km=K_m = \varnothing, and otherwise δm:=εmMm\delta_m := \varepsilon_m - M_m where Mm:=maxxKmd(fm(x),h(x))M_m := \max_{x \in K_m} d(f_m(x),h(x)), which exists by (U3) and satisfies Mm<εmM_m < \varepsilon_m because hBKm(fm,εm)h \in B_{K_m}(f_m,\varepsilon_m); either way δm>0\delta_m > 0. Put K:=K1K2K := K_1 \cup K_2, compact by (U1), and δ:=min{δ1,δ2}>0\delta := \min\{\delta_1,\delta_2\} > 0 (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set). Then hBK(h,δ)h \in B_K(h,\delta), and BK(h,δ)BKm(fm,εm)B_K(h,\delta) \subseteq B_{K_m}(f_m,\varepsilon_m) for m{1,2}m \in \{1,2\}: for gBK(h,δ)g \in B_K(h,\delta) and xKmKx \in K_m \subseteq K,

d(fm(x),g(x))d(fm(x),h(x))+d(h(x),g(x))<Mm+δMm+δm=εmd\big(f_m(x), g(x)\big) \le d\big(f_m(x), h(x)\big) + d\big(h(x), g(x)\big) < M_m + \delta \le M_m + \delta_m = \varepsilon_m

when KmK_m \ne \varnothing, and the condition is vacuous when Km=K_m = \varnothing. So BK(h,δ)BccB_K(h,\delta) \in \mathcal{B}_{\mathrm{cc}} contains hh and lies inside the intersection, which is (B2).

By A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis the family Bcc\mathcal{B}_{\mathrm{cc}} is therefore a basis for exactly one topology on C(X,Y)C(X,Y), and the open sets of that topology are exactly the unions of members of Bcc\mathcal{B}_{\mathrm{cc}} (Basis and subbasis for a topology, and the topology generated by a family of sets).

(U4) For each fC(X,Y)f \in C(X,Y) the sets BK(f,ε)B_K(f,\varepsilon) centred at ff form a neighbourhood base at ff (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open). Indeed a neighbourhood of ff contains a basic set BK1(f1,ε1)B_{K_1}(f_1,\varepsilon_1) containing ff, and the (B2) computation above run with h:=fh := f, K2:=K_2 := \varnothing and ε2:=1\varepsilon_2 := 1 produces δ>0\delta > 0 with fBK1(f,δ)BK1(f1,ε1)f \in B_{K_1}(f,\delta) \subseteq B_{K_1}(f_1,\varepsilon_1). This is the form in which the topology is used in practice: convergence to ff in it is exactly uniform convergence to ff on each compact subset of XX.

Remarks

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

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

Statement

Let (X,dX)(X,d_X) and (Y,d)(Y,d) be metric spaces (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 let C(X,Y)C(X,Y) be the set of continuous maps XYX \to 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)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\}) and the topology 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) on C(X,Y)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 YY; the compact-open topology needs only the open sets of YY. The theorem is a statement about the case where both are defined.

Facts & Assumptions

Given: Metric spaces (X,dX)(X,d_X) and (Y,d)(Y,d) with their metric topologies, the set C(X,Y)C(X,Y) of continuous maps, the sets S(K,V)S(K,V) of 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\}, the sets BK(f,ε)B_K(f,\varepsilon) of 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 the topologies Tco\mathcal{T}_{\mathrm{co}} and Tcc\mathcal{T}_{\mathrm{cc}} they respectively generate.

[L2]

The sets BK(f,ε)B_K(f,\varepsilon) are a basis for Tcc\mathcal{T}_{\mathrm{cc}}, and B(f,ε)=C(X,Y)B_{\varnothing}(f,\varepsilon) = C(X,Y); facts (U1), (U2) and (U3) of 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 are available, in particular the existence of maxxKd(f(x),g(x))\max_{x \in K} d(f(x),g(x)) for f,gC(X,Y)f, g \in C(X,Y) and nonempty compact KK (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).

[L3]

A topology generated by a family S\mathcal{S} is contained in every topology containing S\mathcal{S}, and a set all of whose points lie in a basic set inside it is a union of basic sets, hence open (Basis and subbasis for a topology, and the topology generated by a family of sets, A family is a basis for a unique topology iff it covers the set and every point of an intersection of two members lies in a member inside that intersection; finite intersections of any subbasis form a basis).

[L8]

KK compact and (Ui)iI(U_i)_{i \in I} open in XX with KiUiK \subseteq \bigcup_i U_i give nNn \in \mathbb{N} and indices i0,,inIi_0, \dots, i_n \in I with KUi0UinK \subseteq U_{i_0} \cup \dots \cup U_{i_n}, unless K=K = \varnothing (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 KXK \subseteq X be compact, let VYV \subseteq Y be open and let fS(K,V)f \in S(K,V); it suffices to produce a real ε>0\varepsilon > 0 with BK(f,ε)S(K,V)B_K(f,\varepsilon) \subseteq S(K,V), since then every point of S(K,V)S(K,V) lies in a basic set of Tcc\mathcal{T}_{\mathrm{cc}} inside it.

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

Second half: let KXK \subseteq X be compact, let f0C(X,Y)f_0 \in C(X,Y), let ε0>0\varepsilon_0 > 0 be real and let gBK(f0,ε0)g \in B_K(f_0,\varepsilon_0); it suffices to produce a finite intersection of sets S(K,V)S(K',V') containing gg and contained in BK(f0,ε0)B_K(f_0,\varepsilon_0).

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

In step 1.1, if K=K = \varnothing or V=YV = Y then S(K,V)=C(X,Y)S(K,V) = C(X,Y), which is open in Tcc\mathcal{T}_{\mathrm{cc}}, and ε:=1\varepsilon := 1 serves since BK(f,1)C(X,Y)B_K(f,1) \subseteq C(X,Y); so assume KK \ne \varnothing and VYV \ne Y, whence YVY \setminus V is nonempty.

step 1.1L1L2
2.2

In step 1.2, if K=K = \varnothing then BK(f0,ε0)=C(X,Y)=S(,Y)B_K(f_0,\varepsilon_0) = C(X,Y) = S(\varnothing, Y), which is subbasic and hence open in Tco\mathcal{T}_{\mathrm{co}}; so assume KK \ne \varnothing.

step 1.2L1L2
3.1

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

step 2.1L4L5
3.2

Under step 2.2: M:=maxxKd(f0(x),g(x))M := \max_{x \in K} d(f_0(x), g(x)) exists and satisfies M<ε0M < \varepsilon_0, because gBK(f0,ε0)g \in B_K(f_0,\varepsilon_0) makes ε0\varepsilon_0 a strict upper bound of the values; put δ:=ε0M>0\delta := \varepsilon_0 - M > 0.

step 2.2L2
4.1

Under step 2.1: the restriction of ψ\psi to the nonempty compact metric subspace f[K]f[K] is continuous, so it attains a least value ε:=ψ(y0)\varepsilon := \psi(y_0) at some y0f[K]y_0 \in f[K], and εψ(y)\varepsilon \le \psi(y) for every yf[K]y \in f[K].

step 3.1L6choose
4.2

Under step 2.2: let P\mathcal{P} be the set of pairs (a,r)(a,r) with aKa \in K, r>0r > 0 real and g[Bˉ(a,r)K]B(g(a),δ/4)g[\bar B(a,r) \cap K] \subseteq B(g(a), \delta/4); the family (B(a,r))(a,r)P(B(a,r))_{(a,r) \in \mathcal{P}} consists of open subsets of XX and covers KK, since continuity of gg at aKa \in K gives s>0s > 0 with g[B(a,s)]B(g(a),δ/4)g[B(a,s)] \subseteq B(g(a),\delta/4) and then r:=s/2r := s/2 satisfies Bˉ(a,r)B(a,s)\bar B(a,r) \subseteq B(a,s), so (a,r)P(a,r) \in \mathcal{P} and aB(a,r)a \in B(a,r).

step 3.2constructL6L9
5.1

Under step 2.1: ε>0\varepsilon > 0, because y0f[K]Vy_0 \in f[K] \subseteq V with VV open gives a real s>0s > 0 with B(y0,s)VB(y_0,s) \subseteq V, so every zYVz \in Y \setminus V satisfies d(y0,z)sd(y_0,z) \ge s, making ss a lower bound of the distances from y0y_0 to YVY \setminus V and hence ψ(y0)s>0\psi(y_0) \ge s > 0.

step 4.1L5L9
5.2

Under step 2.2: since KK \ne \varnothing is compact, there are nNn \in \mathbb{N} and pairs (a0,r0),,(an,rn)P(a_0,r_0), \dots, (a_n,r_n) \in \mathcal{P} with KB(a0,r0)B(an,rn)K \subseteq B(a_0,r_0) \cup \dots \cup B(a_n,r_n); 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 uBK(f,ε)u \in B_K(f,\varepsilon) and xKx \in K we have d(f(x),u(x))<εψ(f(x))d(f(x),u(x)) < \varepsilon \le \psi(f(x)) by step 4.1, since f(x)f[K]f(x) \in f[K]; were u(x)YVu(x) \in Y \setminus V, the distance d(f(x),u(x))d(f(x),u(x)) would be one of the distances from f(x)f(x) to YVY \setminus V and hence at least ψ(f(x))\psi(f(x)), which it is not; so u(x)Vu(x) \in V.

step 4.1step 5.1L5
6.2

Under step 2.2: for jnj \le n put Kj:=Bˉ(aj,rj)KK_j := \bar B(a_j,r_j) \cap K and Vj:=B(g(aj),δ/2)V_j := B(g(a_j), \delta/2); each KjK_j is closed in the compact metric space (K,dK)(K, d_K), being the trace on KK of the closed set Bˉ(aj,rj)\bar B(a_j,r_j), hence is compact, and each VjV_j is open in YY.

step 5.2L7L9
7.1

Under step 2.1: step 6.1 holds for every xKx \in K, so u[K]Vu[K] \subseteq V and uS(K,V)u \in S(K,V); hence BK(f,ε)S(K,V)B_K(f,\varepsilon) \subseteq S(K,V), which is what step 1.1 required, and every S(K,V)S(K,V) is open in Tcc\mathcal{T}_{\mathrm{cc}}, so TcoTcc\mathcal{T}_{\mathrm{co}} \subseteq \mathcal{T}_{\mathrm{cc}}.

step 1.1step 2.1step 6.1L3
7.2

Under step 2.2: gS(Kj,Vj)g \in S(K_j,V_j) for every jnj \le n, since KjBˉ(aj,rj)KK_j \subseteq \bar B(a_j,r_j) \cap K and (aj,rj)P(a_j,r_j) \in \mathcal{P} give g[Kj]B(g(aj),δ/4)Vjg[K_j] \subseteq B(g(a_j),\delta/4) \subseteq V_j; so gO:=S(K0,V0)S(Kn,Vn)g \in O := S(K_0,V_0) \cap \dots \cap S(K_n,V_n), a finite intersection of subbasic sets and hence open in Tco\mathcal{T}_{\mathrm{co}}.

step 4.2step 5.2step 6.2L1
8.1

Under step 2.2: let hOh \in O and xKx \in K; step 5.2 gives jnj \le n with xB(aj,rj)x \in B(a_j,r_j), so xKjx \in K_j, whence d(h(x),g(aj))<δ/2d(h(x),g(a_j)) < \delta/2 and d(g(x),g(aj))<δ/4d(g(x),g(a_j)) < \delta/4, so d(h(x),g(x))<δ/2+δ/4<δd(h(x),g(x)) < \delta/2 + \delta/4 < \delta 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+δ=ε0d(f_0(x),h(x)) \le d(f_0(x),g(x)) + d(g(x),h(x)) < M + \delta = \varepsilon_0 for every xKx \in K, that is hBK(f0,ε0)h \in B_K(f_0,\varepsilon_0); so OBK(f0,ε0)O \subseteq B_K(f_0,\varepsilon_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\mathcal{T}_{\mathrm{cc}} is interior to it in Tco\mathcal{T}_{\mathrm{co}}, so every basic set of Tcc\mathcal{T}_{\mathrm{cc}} is open in Tco\mathcal{T}_{\mathrm{co}}, and since those basic sets generate, TccTco\mathcal{T}_{\mathrm{cc}} \subseteq \mathcal{T}_{\mathrm{co}}.

step 2.2step 9.1L2L3
11.1

With step 7.1 the two inclusions give Tco=Tcc\mathcal{T}_{\mathrm{co}} = \mathcal{T}_{\mathrm{cc}}.

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 YVY \setminus V. Without it the number ε\varepsilon of step 4.1 would be an infimum that might be 00, and the conclusion would fail: the set S(K,V)S(K,V) genuinely needs f[K]f[K] to sit at a positive distance from the complement of VV, and that is a consequence of compactness, not of openness of VV.

  • The cases K=K = \varnothing and V=YV = Y are disposed of first for a reason. In both, S(K,V)S(K,V) is the whole space and the distance d(f[K],YV)d(f[K], Y \setminus V) is not defined — in the first because there is no point of KK to measure from, in the second because YVY \setminus 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)S(K,V) cannot control gg uniformly on KK; what does is a finite family of sets S(Kj,Vj)S(K_j,V_j) on which gg varies by less than a quarter of the slack. That the pieces KjK_j are again compact is A closed subset of a compact metric space is compact applied inside KK.

  • 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.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

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}.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

A uniform limit of continuous functions is continuous, so C(X,Y)C(X,Y) is closed in YXY^{X} under the uniform metric

Statement

Let (X,TX)(X,\mathcal{T}_X) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) 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) carrying its metric topology. Then:

  1. The ε/3\varepsilon/3 criterion. Let f:XYf : X \to Y be a function such that for every real ε>0\varepsilon > 0 there is a continuous g:XYg : X \to Y with d(f(x),g(x))<εfor every xX.d\big(f(x), g(x)\big) < \varepsilon \qquad \text{for every } x \in X . Then ff is continuous (Continuity of a map of topological spaces at a point and globally).
  2. Uniform limit theorem. If XX is nonempty, (fk)(f_k) is a sequence of continuous maps XYX \to Y and (fk)(f_k) converges uniformly to ff (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)), then ff is continuous.
  3. Closedness. If XX is nonempty, C(X,Y)C(X,Y) is a closed subset of (YX,ρˉ)(Y^{X}, \bar\rho), the uniform metric being that of 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}.

The domain is an arbitrary topological space, not a metric space: nothing in the argument uses a distance in XX. Only the target carries a metric, and it carries one because the hypothesis of claim 1 is a statement about distances in YY.

No choice principle is used, and claim 3 in particular is choice free. The proof of claim 3 instantiates one continuous gg for each ε\varepsilon and uses it immediately, rather than manufacturing a sequence of them; a sequential argument through A point lies in the closure of AA iff some sequence in AA converges to it, and a set is closed iff it is sequentially closed would spend the Axiom of Countable Choice, and that route is deliberately not taken.

Facts & Assumptions

Given: A topological space (X,TX)(X,\mathcal{T}_X), a metric space (Y,d)(Y,d) with its metric topology, and where claims 2 and 3 apply, a nonempty XX and the uniform metric ρˉ\bar\rho on YXY^{X} with dˉ=min{d,1}\bar d = \min\{d,1\}.

[L1]

h:XYh : X \to Y is continuous at aa exactly when for every open VYV \subseteq Y with h(a)Vh(a) \in V there is an open UXU \subseteq X with aUa \in U and h[U]Vh[U] \subseteq V; and hh is continuous exactly when it is continuous at every point (Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A)f(A)f(\overline{A}) \subseteq \overline{f(A)}, Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L4]

Uniform convergence of (fk)(f_k) to ff gives, for each real ε>0\varepsilon > 0, an index KK with d(fk(x),f(x))<εd(f_k(x),f(x)) < \varepsilon for every xXx \in X and every kKk \ge K (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), Convergence in the uniform metric is exactly uniform convergence: one NN serving every point).

[L5]

For nonempty AYXA \subseteq Y^{X} the closure in (YX,ρˉ)(Y^{X},\bar\rho) is A={u:ρˉ(u,A)=0}\overline{A} = \{\, u : \bar\rho(u,A) = 0 \,\}, a set is closed exactly when it equals its closure, and \varnothing is closed (The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA together with its limit points, and is the smallest closed superset, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, 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).

[L6]

If infS=0\inf S = 0 and η>0\eta > 0 is real, then some sSs \in S satisfies s<ηs < \eta (Epsilon characterisation of the infimum, Greatest lower bound (infimum)).

[L8]

Two elements of YXY^{X} are equal exactly when they agree at every point of XX, and YXY^{X} is the set of all functions XYX \to Y (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)).

Proof

technique · direct
1.1

For claim 1, assume the displayed hypothesis, fix aXa \in X, and let VYV \subseteq Y be open with f(a)Vf(a) \in V; fix a real ε>0\varepsilon > 0 with B(f(a),ε)VB(f(a),\varepsilon) \subseteq V.

assume-hypL1L2choose
1.2

For claim 3, if C(X,Y)=C(X,Y) = \varnothing then it is closed and there is nothing to prove; so assume C(X,Y)C(X,Y) \ne \varnothing and let ff lie in the closure of C(X,Y)C(X,Y) in (YX,ρˉ)(Y^{X},\bar\rho), so that ρˉ(f,C(X,Y))=0\bar\rho(f, C(X,Y)) = 0.

L5assume-hyp
2.1

Apply the hypothesis at ε/3\varepsilon/3: fix a continuous g:XYg : X \to Y with d(f(x),g(x))<ε/3d(f(x),g(x)) < \varepsilon/3 for every xXx \in X.

step 1.1choose
2.2

Let ε1>0\varepsilon_1 > 0 be real and put η:=min{ε1,1}/2\eta := \min\{\varepsilon_1, 1\}/2, a real with 0<η1/2<10 < \eta \le 1/2 < 1 and η<ε1\eta < \varepsilon_1; since the infimum of the distances from ff to the members of C(X,Y)C(X,Y) is 0<η0 < \eta, there is gC(X,Y)g \in C(X,Y) with ρˉ(f,g)<η\bar\rho(f,g) < \eta.

step 1.2L6L7choose
3.1

B(g(a),ε/3)B(g(a),\varepsilon/3) is open in YY and contains g(a)g(a), so continuity of gg at aa gives an open UXU \subseteq X with aUa \in U and g[U]B(g(a),ε/3)g[U] \subseteq B(g(a),\varepsilon/3).

step 2.1L1L2choose
3.2

For every xXx \in X: dˉ(f(x),g(x))ρˉ(f,g)<η<1\bar d(f(x),g(x)) \le \bar\rho(f,g) < \eta < 1, hence d(f(x),g(x))=dˉ(f(x),g(x))<η<ε1d(f(x),g(x)) = \bar d(f(x),g(x)) < \eta < \varepsilon_1.

step 2.2L7
4.1

For every xUx \in U: d(f(x),f(a))d(f(x),g(x))+d(g(x),g(a))+d(g(a),f(a))<ε/3+ε/3+ε/3=εd(f(x),f(a)) \le d(f(x),g(x)) + d(g(x),g(a)) + d(g(a),f(a)) < \varepsilon/3 + \varepsilon/3 + \varepsilon/3 = \varepsilon, so f[U]B(f(a),ε)Vf[U] \subseteq B(f(a),\varepsilon) \subseteq V.

step 1.1step 2.1step 3.1L3
5.1

As VV was an arbitrary open set containing f(a)f(a) and aa an arbitrary point of XX, step 4.1 makes ff continuous at every point, hence continuous; this is claim 1.

step 1.1step 4.1L1
6.1

For claim 2, let ε>0\varepsilon > 0 be real; uniform convergence gives an index KK with d(fk(x),f(x))<εd(f_k(x),f(x)) < \varepsilon for every xXx \in X and every kKk \ge K, so the continuous map g:=fKg := f_K witnesses the hypothesis of claim 1 at ε\varepsilon; hence ff is continuous by claim 1.

step 5.1L4
6.2

Steps 2.2 and 3.2 supply, for each real ε1>0\varepsilon_1 > 0, a continuous gg with d(f(x),g(x))<ε1d(f(x),g(x)) < \varepsilon_1 for every xXx \in X, which is the hypothesis of claim 1; so ff is continuous, that is fC(X,Y)f \in C(X,Y).

step 5.1step 2.2step 3.2L8
7.1

Hence the closure of C(X,Y)C(X,Y) is contained in C(X,Y)C(X,Y), and containing it always, it equals it; so C(X,Y)C(X,Y) is closed in (YX,ρˉ)(Y^{X},\bar\rho), which is claim 3.

step 1.2step 6.2L5

Remarks

  • The three thirds are the three legs of the estimate, and each is a different approximation: ff to gg at xx, gg at xx to gg at aa, and gg to ff at aa. Only the middle one uses continuity, and only the outer two use that the approximation of ff by gg is uniform. If the approximation were merely pointwise, the third leg would still hold but the first would need an ε\varepsilon depending on xx, and the argument collapses; the companion page exhibits exactly that collapse.

  • Claim 3 is what makes C(X,Y)C(X,Y) a complete space when YY is complete, by the next item, and it is the reason the uniform topology and not the pointwise one is the natural home for limits of continuous functions. In the pointwise topology C(X,Y)C(X,Y) is in general not closed, and the companion page carries a witness on [0,1][0,1].

  • Why the choice-free route was taken. The usual proof of claim 3 shows that C(X,Y)C(X,Y) is sequentially closed and then invokes A point lies in the closure of AA iff some sequence in AA converges to it, and a set is closed iff it is sequentially closed to conclude closedness; that item's forward direction spends the Axiom of Countable Choice, since it manufactures a sequence out of adherence. The argument above instead works with the distance to the set directly and instantiates a single gg at each ε\varepsilon, so claim 3 is a theorem of ZF.

TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

If (Y,d)(Y,d) is complete then YXY^{X} is complete in the uniform metric, and so is C(X,Y)C(X,Y)

Statement

Let XX be a nonempty set, let (Y,d)(Y,d) be a complete metric space (Complete metric space: every Cauchy sequence converges in the space) and let ρˉ\bar\rho be the uniform metric on YXY^{X} (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}). Then:

  1. (YX,ρˉ)(Y^{X}, \bar\rho) is a complete metric space.
  2. If in addition XX carries a topology, then C(X,Y)C(X,Y) with the restriction of ρˉ\bar\rho (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)) is a complete metric space.

No choice principle is used. The limit function is defined by a formula, not chosen: a Cauchy sequence in a complete metric space has exactly one limit (A sequence in a metric space has at most one limit), so xlimkfk(x)x \mapsto \lim_k f_k(x) is a function, and nothing is selected.

Facts & Assumptions

Given: A nonempty set XX, a complete metric space (Y,d)(Y,d), the truncated metric dˉ=min{d,1}\bar d = \min\{d,1\} on YY, the uniform metric ρˉ\bar\rho on YXY^{X}, and a ρˉ\bar\rho-Cauchy sequence (fk)(f_k) in YXY^{X}.

[L1]

dˉd\bar d \le d and dˉ1\bar d \le 1; if dˉ(u,v)<1\bar d(u,v) < 1 then dˉ(u,v)=d(u,v)\bar d(u,v) = d(u,v); and dˉ(u(x),v(x))ρˉ(u,v)\bar d(u(x),v(x)) \le \bar\rho(u,v) for every xXx \in X, while any real bounding all the values dˉ(u(x),v(x))\bar d(u(x),v(x)) above bounds ρˉ(u,v)\bar\rho(u,v) (min(d,1)\min(d,1) and d/(1+d)d/(1+d) are metrics uniformly equivalent to dd, so every metric space carries a bounded metric with the same topology, 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}, Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Complete ordered field (least-upper-bound property), Suprema and infima are unique).

[L2]

(xk)(x_k) is Cauchy in a metric space when for every real ε>0\varepsilon > 0 there is KK with the distance between xmx_m and xnx_n below ε\varepsilon for all m,nKm, n \ge K; the rational and real tests agree (Cauchy sequence in a metric space, The rationals embed densely in the reals).

[L4]

xkpx_k \to p in a metric space means: for every real ε>0\varepsilon > 0 there is KK with the distance from xkx_k to pp below ε\varepsilon for every kKk \ge K (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}, Open ball, closed ball and sphere in a metric space, The rationals embed densely in the reals).

[L6]

C(X,Y)C(X,Y) is a closed subset of (YX,ρˉ)(Y^{X},\bar\rho) when XX is a nonempty topological space (A uniform limit of continuous functions is continuous, so C(X,Y)C(X,Y) is closed in YXY^{X} under the uniform metric, claim 3).

Proof

technique · direct
1.1

Let xXx \in X and let ε>0\varepsilon > 0 be real; put η:=min{ε,1}/2\eta := \min\{\varepsilon, 1\}/2, a real with 0<η1/2<10 < \eta \le 1/2 < 1 and η<ε\eta < \varepsilon, and take KK with ρˉ(fm,fn)<η\bar\rho(f_m,f_n) < \eta for all m,nKm,n \ge K.

givenL1L2choose
1.2

Let ε>0\varepsilon > 0 be real; put η:=min{ε,1}/4\eta := \min\{\varepsilon,1\}/4, a real with 0<η1/4<10 < \eta \le 1/4 < 1 and 4ηε4\eta \le \varepsilon, and take KK with ρˉ(fm,fn)<η\bar\rho(f_m,f_n) < \eta for all m,nKm,n \ge K.

givenL1L2choose
2.1

For m,nKm, n \ge K: dˉ(fm(x),fn(x))ρˉ(fm,fn)<η<1\bar d(f_m(x),f_n(x)) \le \bar\rho(f_m,f_n) < \eta < 1, hence d(fm(x),fn(x))=dˉ(fm(x),fn(x))<η<εd(f_m(x),f_n(x)) = \bar d(f_m(x),f_n(x)) < \eta < \varepsilon.

step 1.1L1
3.1

As ε\varepsilon was an arbitrary positive real, step 2.1 makes (fk(x))(f_k(x)) a dd-Cauchy sequence in YY for every xXx \in X; by completeness it converges, and its limit is unique, so f(x):=limkfk(x)f(x) := \lim_k f_k(x) defines a function fYXf \in Y^{X} with no selection made.

step 2.1L2L3L8
4.1

Fix nKn \ge K and xXx \in X; since fm(x)f(x)f_m(x) \to f(x) in (Y,d)(Y,d) and dˉd\bar d \le d, there is mKm \ge K with dˉ(fm(x),f(x))<η\bar d(f_m(x), f(x)) < \eta, and then dˉ(fn(x),f(x))dˉ(fn(x),fm(x))+dˉ(fm(x),f(x))<η+η=2η\bar d(f_n(x), f(x)) \le \bar d(f_n(x), f_m(x)) + \bar d(f_m(x), f(x)) < \eta + \eta = 2\eta.

step 3.1step 1.2L1L4L5
5.1

Step 4.1 holds for every xXx \in X, so 2η2\eta bounds the values dˉ(fn(x),f(x))\bar d(f_n(x),f(x)) above and hence ρˉ(fn,f)2ηε/2<ε\bar\rho(f_n,f) \le 2\eta \le \varepsilon/2 < \varepsilon, for every nKn \ge K.

step 1.2step 4.1L1
6.1

As ε\varepsilon was an arbitrary positive real, step 5.1 says fnff_n \to f in (YX,ρˉ)(Y^{X},\bar\rho); so every ρˉ\bar\rho-Cauchy sequence converges in YXY^{X}, which is claim 1.

step 5.1L4
7.1

For claim 2, C(X,Y)C(X,Y) is closed in the complete space (YX,ρˉ)(Y^{X},\bar\rho), so the metric subspace C(X,Y)C(X,Y) with the restriction of ρˉ\bar\rho is complete.

step 6.1L6L7

Remarks

  • What completeness of the target buys, pointwise and then uniformly. Step 3.1 produces the limit function pointwise, and that step alone would hold for a merely pointwise Cauchy condition. What the uniform Cauchy condition adds is step 5.1: the same η\eta works at every xx, so the bound on dˉ(fn(x),f(x))\bar d(f_n(x),f(x)) is uniform in xx and therefore bounds the supremum.

  • Step 4.1 chooses nothing. For each fixed xx an index mm is instantiated and used inside the same sentence; the conclusion dˉ(fn(x),f(x))<2η\bar d(f_n(x),f(x)) < 2\eta does not mention mm, so no function xmx \mapsto m is ever formed. That is the standard way this library avoids a spurious countable choice.

  • Completeness is a property of the metric, not of the topology (Complete metric space: every Cauchy sequence converges in the space), and the metric here is ρˉ\bar\rho, built from the truncation dˉ=min{d,1}\bar d = \min\{d,1\}. A different metric inducing the same topology on YY need not make YY complete, and then nothing above applies; the hypothesis is that (Y,d)(Y,d) itself is complete.

  • The classical special case. With Y=RY = \mathbb{R} this says that the bounded-or-not real functions on a nonempty set are complete in the uniform metric, and that the continuous ones form a closed, hence complete, subspace. The companion page works C([0,1],R)C([0,1],\mathbb{R}) explicitly and compares the uniform metric there with the supremum metric of The supremum metric d(f,g)=supxf(x)g(x)d_\infty(f,g) = \sup_x |f(x) - g(x)| is a metric on the bounded real-valued functions on a nonempty set.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x)

Definition

Let (X,d)(X,d) be a metric space carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let (Y,TY)(Y,\mathcal{T}_Y) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let C(X,Y)C(X,Y) carry the compact-open topology (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\}). The evaluation map is

e:C(X,Y)×XY,e(f,x):=f(x),e : C(X,Y) \times X \longrightarrow Y, \qquad e(f,x) := f(x),

the domain carrying the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) of the compact-open topology on C(X,Y)C(X,Y) and the metric topology on XX.

This is a function. For fC(X,Y)f \in C(X,Y) and xXx \in X the value f(x)f(x) is a well-determined element of YY, and a pair (f,x)(f,x) of the product determines both entries (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space), so ee is defined on all of C(X,Y)×XC(X,Y) \times X with no further condition.

Which topology is meant is part of the definition. Continuity of ee is a statement about the pair of topologies on the source and the topology on the target (Continuity of a map of topological spaces at a point and globally), and C(X,Y)C(X,Y) carries several topologies on this page. Unless another is named, the topology on C(X,Y)C(X,Y) inside an evaluation map is the compact-open one; where a subspace of C(X,Y)C(X,Y) is evaluated, it carries the subspace topology (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).

Separate continuity is immediate; joint continuity is not. For fixed fC(X,Y)f \in C(X,Y) the map xe(f,x)=f(x)x \mapsto e(f,x) = f(x) is continuous, being ff itself. For fixed xXx \in X the map fe(f,x)=f(x)f \mapsto e(f,x) = f(x) is continuous as well, since for open VYV \subseteq Y its preimage is S({x},V)S(\{x\},V), a subbasic open set of the compact-open topology, {x}\{x\} being compact (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\}). What is at issue on this page is joint continuity, that is continuity of ee on the product, and that genuinely needs a hypothesis on XX: it holds when XX is locally compact, and this page records as a false statement that it holds for every metric XX, with an explicit witness.

Remarks

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

If XX is a locally compact metric space then the evaluation map is continuous for the compact-open topology

Statement

Let (X,d)(X,d) be a locally compact metric space (Locally compact metric space: every point has a compact neighbourhood) carrying its metric topology, let (Y,TY)(Y,\mathcal{T}_Y) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and give C(X,Y)C(X,Y) the compact-open topology (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\}). Then the evaluation map

e:C(X,Y)×XY,e(f,x)=f(x)e : C(X,Y) \times X \to Y, \qquad e(f,x) = f(x)

(The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x)) is continuous, the product carrying the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space).

No hypothesis whatever is placed on YY, which is an arbitrary topological space: the argument uses only that a point of YY lies in an open set. No choice principle is used.

Local compactness is not removable. This page records as a false statement that the evaluation map is continuous for every metric domain, and its witness is X=QX = \mathbb{Q}, a metric space that is locally compact at no point.

Facts & Assumptions

Given: A locally compact metric space (X,d)(X,d) with its metric topology, a topological space (Y,TY)(Y,\mathcal{T}_Y), the set C(X,Y)C(X,Y) with the compact-open topology, and the evaluation map ee.

[L1]

A map hh into YY is continuous exactly when for every point pp of its domain and every open VYV \subseteq Y with h(p)Vh(p) \in V there is an open UU of the domain with pUp \in U and h[U]Vh[U] \subseteq V (Continuity of a map of topological spaces at a point and globally, For a map of spaces the following agree: continuity at every point, preimages of open sets open, preimages of closed sets closed, preimages of subbasic open sets open, and f(A)f(A)f(\overline{A}) \subseteq \overline{f(A)}).

[L3]

S(K,V)={gC(X,Y):g[K]V}S(K,V) = \{\, g \in C(X,Y) : g[K] \subseteq V \,\} is open in the compact-open topology for every compact KXK \subseteq X and open VYV \subseteq Y (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\}).

[L5]

A subset WXW \subseteq X is open exactly when each of its points has a ball around it inside WW; balls are open; B(x,r)Bˉ(x,r)B(x,r) \subseteq \bar B(x,r); and Bˉ(x,r)B(x,s)\bar B(x,r) \subseteq B(x,s) whenever 0<r<s0 < r < s (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, Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, Open ball, closed ball and sphere in a metric space, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

[L6]

The minimum of a two-element set of reals exists, is one of the two elements and is at most each of them (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Proof

technique · direct
1.1

Let (f,x)C(X,Y)×X(f,x) \in C(X,Y) \times X and let VYV \subseteq Y be open with e(f,x)=f(x)Ve(f,x) = f(x) \in V.

L1
1.2

Local compactness gives a real r0>0r_0 > 0 such that Bˉ(x,r)\bar B(x,r) is compact for every real rr with 0<r<r00 < r < r_0.

L4choose
2.1

f1[V]f^{-1}[V] is open in XX and contains xx, so there is a real s>0s > 0 with B(x,s)f1[V]B(x,s) \subseteq f^{-1}[V].

step 1.1L5L7choose
3.1

Put r:=min{s,r0}/2r := \min\{s, r_0\}/2, a real with 0<r0 < r, r<r0r < r_0 and r<sr < s; then K:=Bˉ(x,r)K := \bar B(x,r) is compact and KB(x,s)f1[V]K \subseteq B(x,s) \subseteq f^{-1}[V], that is f[K]Vf[K] \subseteq V.

step 2.1step 1.2L5L6
4.1

Hence fS(K,V)f \in S(K,V), which is open in the compact-open topology, and xB(x,r)x \in B(x,r), which is open in XX; so S(K,V)×B(x,r)S(K,V) \times B(x,r) is an open subset of the product containing (f,x)(f,x).

step 3.1L2L3L5
5.1

For every (g,y)S(K,V)×B(x,r)(g,y) \in S(K,V) \times B(x,r): yB(x,r)Bˉ(x,r)=Ky \in B(x,r) \subseteq \bar B(x,r) = K and g[K]Vg[K] \subseteq V, so e(g,y)=g(y)Ve(g,y) = g(y) \in V; that is, e[S(K,V)×B(x,r)]Ve[S(K,V) \times B(x,r)] \subseteq V.

step 3.1step 4.1L3L5
6.1

Steps 4.1 and 5.1 exhibit, for the arbitrary point (f,x)(f,x) and the arbitrary open VV containing its image, an open set of the product around (f,x)(f,x) mapped into VV; so ee is continuous.

step 1.1step 4.1step 5.1L1

Remarks

  • What the compact-open topology is doing. The whole proof is the single observation that S(K,V)S(K,V) constrains a function on the whole of the compact set KK, so once KK is a neighbourhood of xx the constraint survives moving the point as well as moving the function. A topology whose basic sets constrain a function at finitely many points only, such as the topology of pointwise convergence, cannot do this, and the evaluation map is in general not continuous for it.

  • Where local compactness is spent. Once, at step 1.2, to produce a compact neighbourhood of xx inside the open set f1[V]f^{-1}[V]. Every metric space has arbitrarily small closed balls inside such an open set; what local compactness adds is that they may be taken compact.

  • The converse is not asserted. Nothing here says that continuity of the evaluation map forces XX to be locally compact. That direction is true for Hausdorff spaces in the general theory and is not proved in this library.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

If f:X×ZYf : X \times Z \to Y is continuous then its transpose F:ZC(X,Y)F : Z \to C(X,Y), F(z)(x)=f(x,z)F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on XX beyond being metric

Statement

Let (X,d)(X,d) be a metric space carrying its metric topology (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, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), let ZZ and YY be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let

f:X×ZYf : X \times Z \to Y

be continuous, the product carrying the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). For zZz \in Z define F(z):XYF(z) : X \to Y by F(z)(x):=f(x,z)F(z)(x) := f(x,z). Then:

  1. F(z)C(X,Y)F(z) \in C(X,Y) for every zZz \in Z;
  2. the transpose F:ZC(X,Y)F : Z \to C(X,Y) is continuous when C(X,Y)C(X,Y) carries the compact-open topology (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 local compactness and no separation hypothesis is used, on any of the three spaces; XX is metric only because the compact-open topology is defined here over the compact subsets of a metric space. No choice principle is used.

Facts & Assumptions

Given: A metric space (X,d)(X,d) with its metric topology, topological spaces ZZ and YY, a continuous f:X×ZYf : X \times Z \to Y, and F(z)(x)=f(x,z)F(z)(x) = f(x,z).

[L7]

Tube lemma: for compact KXK \subseteq X, a point z0Zz_0 \in Z and an open NX×ZN \subseteq X \times Z with K×{z0}NK \times \{z_0\} \subseteq N there is an open WZW \subseteq Z with z0Wz_0 \in W and K×WNK \times W \subseteq N (Tube lemma: if KK is a compact subset of a metric space XX, ZZ is a topological space and NN is open in X×ZX \times Z with K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0).

[L8]

A subset of a topological space is open exactly when it is a neighbourhood of each of its points, that is when each of its points lies in an open set inside it (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open, consequence 4).

Proof

technique · direct
1.1

Fix zZz \in Z and let jz:XX×Zj_z : X \to X \times Z be the map jz(x):=(x,z)j_z(x) := (x,z); its components are the identity of XX and the constant map at zz, both continuous, so jzj_z is continuous.

L1L3L4
2.1

F(z)=fjzF(z) = f \circ j_z, since (fjz)(x)=f(x,z)=F(z)(x)(f \circ j_z)(x) = f(x,z) = F(z)(x) for every xXx \in X; hence F(z)F(z) is continuous and F(z)C(X,Y)F(z) \in C(X,Y), which is claim 1.

step 1.1L2
3.1

For claim 2 it suffices, by [L5] and [L6], to show that F1[S(K,V)]F^{-1}[S(K,V)] is open in ZZ for every compact KXK \subseteq X and every open VYV \subseteq Y.

step 2.1L5L6suffices: preimages of subbasic sets are open
3.2

Unwinding the definitions, F1[S(K,V)]={zZ:F(z)[K]V}={zZ:f(x,z)V for every xK}F^{-1}[S(K,V)] = \{\, z \in Z : F(z)[K] \subseteq V \,\} = \{\, z \in Z : f(x,z) \in V \text{ for every } x \in K \,\}.

step 2.1L6
4.1

Let z0F1[S(K,V)]z_0 \in F^{-1}[S(K,V)] and put N:=f1[V]N := f^{-1}[V], an open subset of X×ZX \times Z; by step 3.2 every xKx \in K satisfies f(x,z0)Vf(x,z_0) \in V, that is K×{z0}NK \times \{z_0\} \subseteq N.

step 3.2L9
5.1

The tube lemma applied to KK, z0z_0 and NN gives an open WZW \subseteq Z with z0Wz_0 \in W and K×WNK \times W \subseteq N.

step 4.1L7choose
6.1

Every zWz \in W then satisfies f(x,z)Vf(x,z) \in V for every xKx \in K, that is zF1[S(K,V)]z \in F^{-1}[S(K,V)]; so WW is an open set with z0WF1[S(K,V)]z_0 \in W \subseteq F^{-1}[S(K,V)].

step 3.2step 4.1step 5.1
7.1

As z0z_0 was an arbitrary point of F1[S(K,V)]F^{-1}[S(K,V)], that set is open in ZZ; by step 3.1 this proves claim 2.

step 3.1step 6.1L8

Remarks

  • The tube lemma is the entire content. The condition defining F1[S(K,V)]F^{-1}[S(K,V)] is "the whole slice K×{z}K \times \{z\} lands in VV", and openness of that condition in zz is exactly the statement that a neighbourhood of a slice contains a tube. Everything else is unwinding.

  • This half of the exponential law is the cheap half. It needs no hypothesis on XX beyond compactness being available for its subsets, and none at all on ZZ or YY. The converse half — that every continuous F:ZC(X,Y)F : Z \to C(X,Y) arises from a continuous ff — runs through continuity of the evaluation map and is where local compactness of XX is spent.

  • The map FF determines ff and conversely, as functions. That the assignment fFf \mapsto F is injective, and that under the local compactness hypothesis it is onto the continuous maps ZC(X,Y)Z \to C(X,Y), is the exponential law below; this theorem is the statement that the assignment lands in the right place.

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passverified 2026-08-05 (claude-sonnet-5)Open item page →

The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology

Statement

Let (X,d)(X,d) be a locally compact metric space (Locally compact metric space: every point has a compact neighbourhood) carrying its metric topology, and let ZZ and YY be topological spaces (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). Give C(X,Y)C(X,Y) the compact-open topology (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\}) and X×ZX \times Z the product topology (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space). Define, for fC(X×Z,Y)f \in C(X \times Z, Y),

Φ(f):ZC(X,Y),Φ(f)(z)(x):=f(x,z).\Phi(f) : Z \to C(X,Y), \qquad \Phi(f)(z)(x) := f(x,z) .

Then Φ\Phi is a well-defined map C(X×Z,Y)C(Z,C(X,Y))C(X \times Z, Y) \to C\big(Z, C(X,Y)\big) and it is a bijection (Injection, surjection, bijection); its inverse sends a continuous F:ZC(X,Y)F : Z \to C(X,Y) to the continuous map (x,z)F(z)(x)(x,z) \mapsto F(z)(x).

Exactly what is and is not claimed

This is an assertion about two sets of continuous maps and a bijection between them. No topology is placed on C(X×Z,Y)C(X \times Z, Y) or on C(Z,C(X,Y))C(Z, C(X,Y)) anywhere in the statement, and it is not claimed that Φ\Phi is a homeomorphism. The homeomorphism form of the exponential law is a genuinely stronger statement, and this library does not have what it needs; the last remark below says exactly what is missing. A reader who wants the categorical slogan "YX×Z(YX)ZY^{X \times Z} \cong (Y^{X})^{Z}" should read it here as a bijection of underlying sets, natural in the evident way, and no more.

No choice principle is used.

Facts & Assumptions

Given: A locally compact metric space (X,d)(X,d) with its metric topology, topological spaces ZZ and YY, the set C(X,Y)C(X,Y) with the compact-open topology, the evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y (The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x)), and the assignment Φ\Phi of the Statement.

[L1]

If f:X×ZYf : X \times Z \to Y is continuous then Φ(f)(z)C(X,Y)\Phi(f)(z) \in C(X,Y) for every zz, and Φ(f):ZC(X,Y)\Phi(f) : Z \to C(X,Y) is continuous for the compact-open topology (If f:X×ZYf : X \times Z \to Y is continuous then its transpose F:ZC(X,Y)F : Z \to C(X,Y), F(z)(x)=f(x,z)F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on XX beyond being metric).

[L6]

A map is a bijection exactly when it is injective and surjective (Injection, surjection, bijection).

Proof

technique · direct
1.1

Let fC(X×Z,Y)f \in C(X \times Z, Y); by [L1] each Φ(f)(z)\Phi(f)(z) lies in C(X,Y)C(X,Y) and Φ(f)\Phi(f) is a continuous map ZC(X,Y)Z \to C(X,Y), so Φ(f)C(Z,C(X,Y))\Phi(f) \in C(Z, C(X,Y)) and Φ\Phi is well defined.

L1
1.2

Let FC(Z,C(X,Y))F \in C(Z, C(X,Y)) and define Ψ(F):X×ZY\Psi(F) : X \times Z \to Y by Ψ(F)(x,z):=F(z)(x)\Psi(F)(x,z) := F(z)(x); this is a function, F(z)F(z) being an element of C(X,Y)C(X,Y) and hence a function XYX \to Y.

L5construct
2.1

Let h:X×ZC(X,Y)×Xh : X \times Z \to C(X,Y) \times X be given by h(x,z):=(F(z),x)h(x,z) := (F(z), x); its two components are (x,z)F(z)(x,z) \mapsto F(z), which is the composite of the projection onto ZZ with FF, and (x,z)x(x,z) \mapsto x, which is the projection onto XX; both are continuous, so hh is continuous.

step 1.2L3L4
2.2

Φ\Phi is injective: if Φ(f)=Φ(f)\Phi(f) = \Phi(f') then for all xXx \in X and zZz \in Z we get f(x,z)=Φ(f)(z)(x)=Φ(f)(z)(x)=f(x,z)f(x,z) = \Phi(f)(z)(x) = \Phi(f')(z)(x) = f'(x,z), so f=ff = f'.

step 1.1L5
3.1

Ψ(F)=eh\Psi(F) = e \circ h, since (eh)(x,z)=e(F(z),x)=F(z)(x)=Ψ(F)(x,z)(e \circ h)(x,z) = e(F(z), x) = F(z)(x) = \Psi(F)(x,z) for every (x,z)(x,z); hence Ψ(F)\Psi(F) is continuous, that is Ψ(F)C(X×Z,Y)\Psi(F) \in C(X \times Z, Y).

step 1.2step 2.1L2L4L5
4.1

Φ\Phi is surjective: given FC(Z,C(X,Y))F \in C(Z,C(X,Y)), step 3.1 puts Ψ(F)\Psi(F) in C(X×Z,Y)C(X \times Z, Y), and for all zZz \in Z and xXx \in X we have Φ(Ψ(F))(z)(x)=Ψ(F)(x,z)=F(z)(x)\Phi(\Psi(F))(z)(x) = \Psi(F)(x,z) = F(z)(x), so Φ(Ψ(F))(z)=F(z)\Phi(\Psi(F))(z) = F(z) for every zz and hence Φ(Ψ(F))=F\Phi(\Psi(F)) = F.

step 1.1step 3.1L5
5.1

By steps 2.2 and 4.1 the map Φ\Phi is a bijection from C(X×Z,Y)C(X \times Z, Y) onto C(Z,C(X,Y))C(Z, C(X,Y)), and step 4.1 identifies its inverse as Ψ\Psi, that is F((x,z)F(z)(x))F \mapsto ((x,z) \mapsto F(z)(x)).

step 2.2step 4.1L6

Remarks

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces

Definition

Let (X,dX)(X,d_X) and (Y,dY)(Y,d_Y) be metric spaces (Metric space: d(x,y)=0d(x,y) = 0 iff x=yx = y, symmetry, and the triangle inequality; pseudometric and ultrametric) and let FYX\mathcal{F} \subseteq Y^{X} be a set of functions XYX \to Y (The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)). Let aXa \in X.

  • F\mathcal{F} is equicontinuous at aa if for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that dY(f(x),f(a))<εfor every fF and every xX with dX(x,a)<δ.d_Y\big(f(x), f(a)\big) < \varepsilon \qquad \text{for every } f \in \mathcal{F} \text{ and every } x \in X \text{ with } d_X(x,a) < \delta .
  • F\mathcal{F} is equicontinuous if it is equicontinuous at every point of XX.
  • F\mathcal{F} is uniformly equicontinuous if for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 such that dY(f(x),f(x))<εfor every fF and all x,xX with dX(x,x)<δ.d_Y\big(f(x), f(x')\big) < \varepsilon \qquad \text{for every } f \in \mathcal{F} \text{ and all } x, x' \in X \text{ with } d_X(x,x') < \delta .
  • F\mathcal{F} is pointwise bounded if for every xXx \in X the set F(x):={f(x):fF}\mathcal{F}(x) := \{\, f(x) : f \in \mathcal{F} \,\} is a bounded subset of YY (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space).

Everything is in the quantifier order, and the order is the only difference from ordinary continuity. Continuity of each single fFf \in \mathcal{F} at aa allows δ\delta to depend on ε\varepsilon, on aa and on ff (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form); equicontinuity at aa demands one δ\delta serving every member of the family at once. Uniform continuity of each single ff allows δ\delta to depend on ε\varepsilon and on ff (Uniform continuity of a map of metric spaces: one δ\delta serving every point); uniform equicontinuity demands one δ\delta serving every member and every pair of points at once. Written with the quantifiers in order, the four conditions are

εfaδ,εaδf,εfδa,εδfa\forall \varepsilon\, \forall f\, \forall a\, \exists \delta, \qquad \forall \varepsilon\, \forall a\, \exists \delta\, \forall f, \qquad \forall \varepsilon\, \forall f\, \exists \delta\, \forall a, \qquad \forall \varepsilon\, \exists \delta\, \forall f\, \forall a

for pointwise continuity of each member, equicontinuity, uniform continuity of each member, and uniform equicontinuity respectively.

Immediate consequences, recorded because they are used.

  1. Every member of an equicontinuous family is continuous, and every member of a uniformly equicontinuous family is uniformly continuous: the δ\delta that serves the whole family serves each member (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, Uniform continuity of a map of metric spaces: one δ\delta serving every point).
  2. Uniform equicontinuity implies equicontinuity, by taking x=ax' = a.
  3. Both conditions are about the metrics dXd_X and dYd_Y, not about the topologies they induce. Replacing a metric by a topologically equivalent one can destroy either, exactly as it can destroy uniform continuity.
  4. A one-element family {f}\{f\} is equicontinuous exactly when ff is continuous, and uniformly equicontinuous exactly when ff is uniformly continuous; so the notions do generalise the single-function ones and do not merely resemble them.

Pointwise boundedness is a hypothesis about the values, not about the functions. It says that at each individual point the family's values stay in one ball of YY; the radius may depend on the point, and no single ball need contain all the values at all the points. The stronger condition, that xF(x)\bigcup_{x} \mathcal{F}(x) is bounded, is uniform boundedness and is not defined here, nothing on this page using it.

Remarks

  • Why this definition sits on this page. Equicontinuity is the hypothesis of the Ascoli-Arzelà theorem, which characterises the compact subsets of C(X,Y)C(X,Y) in the topology 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). That theorem is not proved here and is not stated here; the definition is placed on this page so that the page proving it has the vocabulary available earlier in the reading order. Nothing below this item uses equicontinuity except the companion page's examples.

  • Neither condition is implied by the other two hypotheses of Ascoli. Pointwise boundedness does not imply equicontinuity, and the companion page gives a family of continuous functions on [0,1][0,1] with all values in [0,1][0,1] that fails to be equicontinuous at 00. Conversely an equicontinuous family need not be pointwise bounded: the constant functions with values 0,1,2,0, 1, 2, \dots are uniformly equicontinuous and unbounded at every point.

  • A convenient sufficient condition. A family of maps that are all Lipschitz with one common constant LL is uniformly equicontinuous, δ:=ε/(L+1)\delta := \varepsilon/(L+1) serving. The companion page uses this for the 11-Lipschitz maps into R\mathbb{R}, among them all the distance functions xdX(x,A)x \mapsto d_X(x,A).

TheoremStatement: AI-adaptedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly

Statement

Let (X,d)(X,d) be a compact metric space (Open cover, subcover, compact metric space, and compact subset of a metric space), let fk:XRf_k : X \to \mathbb{R} be continuous for every kNk \in \mathbb{N} (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form, R\mathbb{R} carrying its usual metric, The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded), and suppose

fk(x)fk+1(x)for every kN and every xX,f_k(x) \le f_{k+1}(x) \qquad \text{for every } k \in \mathbb{N} \text{ and every } x \in X ,

so that the sequence is nondecreasing at every point (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences). Suppose further that fk(x)f(x)f_k(x) \to f(x) for every xXx \in X (Limits and Cauchy sequences of reals) with the limit function f:XRf : X \to \mathbb{R} continuous. Then (fk)(f_k) converges to ff uniformly (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)).

All four hypotheses are used. Compactness of XX, monotonicity of the sequence, continuity of every fkf_k and continuity of the limit ff each enter the proof, and dropping any one of them makes the conclusion false; the companion page exhibits the failure when the limit is not continuous.

The nonincreasing form holds too, by applying the theorem to (fk)(-f_k) and f-f, which are continuous and nondecreasing at every point; the proof below is written for the nondecreasing direction only, and the Statement claims that direction.

No choice principle is used: the finite subcover produced below is returned as a list of indices by 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).

Facts & Assumptions

Given: A compact metric space (X,d)(X,d), continuous functions fk:XRf_k : X \to \mathbb{R} with fk(x)fk+1(x)f_k(x) \le f_{k+1}(x) for all kk and xx, a continuous f:XRf : X \to \mathbb{R} with fk(x)f(x)f_k(x) \to f(x) for every xXx \in X, and ι\iota the canonical natural of R\mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[A1]

fk(x)fk+1(x)f_k(x) \le f_{k+1}(x) for every kNk \in \mathbb{N} and every xXx \in X.

[A2]

fk(x)f(x)f_k(x) \to f(x) in R\mathbb{R} for every xXx \in X, and ff and every fkf_k are continuous.

[L1]

A sequence of reals with xkxk+1x_k \le x_{k+1} for every kk is nondecreasing, that is xjxmx_j \le x_m whenever jmj \le m (Nondecreasing, increasing, nonincreasing, decreasing, monotone, and eventually monotone sequences).

[L6]

XX is a compact subset of itself, so every family (Ui)iI(U_i)_{i \in I} of open subsets of XX with X=iUiX = \bigcup_i U_i has nNn \in \mathbb{N} and indices i0,,inIi_0, \dots, i_n \in I with X=Ui0UinX = U_{i_0} \cup \dots \cup U_{i_n}, unless X=X = \varnothing (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, Open cover, subcover, compact metric space, and compact subset of a metric space).

[L7]

For n1n \ge 1 and natural numbers k0,,kn1k_0, \dots, k_{n-1} there is j<nj^{\ast} < n with kjkjk_j \le k_{j^{\ast}} for every j<nj < n: the nonempty finite set of reals {ι(k0),,ι(kn1)}\{\iota(k_0), \dots, \iota(k_{n-1})\} has a maximum, attained at some index, and ι\iota is strictly increasing on N\mathbb{N}, hence reflects the order (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set, Canonical naturals are positive and strictly increasing, The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field).

[L8]

Uniform convergence of (fk)(f_k) to ff is: for every real ε>0\varepsilon > 0 there is NNN \in \mathbb{N} with fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon for every xXx \in X and every kNk \ge N (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), Convergence in the uniform metric is exactly uniform convergence: one NN serving every point, Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).

Proof

technique · direct
1.1

Fix xXx \in X; the sequence (fk(x))(f_k(x)) is nondecreasing by [A1] and [L1], and it converges by [A2], hence is bounded and in particular bounded above.

A1A2L1L2
1.2

Let ε>0\varepsilon > 0 be real and put Uk:={xX:f(x)fk(x)<ε}U_k := \{\, x \in X : f(x) - f_k(x) < \varepsilon \,\} for kNk \in \mathbb{N}.

construct
2.1

By [L2] the sequence (fk(x))(f_k(x)) converges to the supremum of its range, and by [A2] it converges to f(x)f(x), so uniqueness of limits gives f(x)=supkfk(x)f(x) = \sup_k f_k(x); hence fk(x)f(x)f_k(x) \le f(x) for every kNk \in \mathbb{N} and every xXx \in X.

step 1.1A2L2L3
2.2

Each UkU_k is open: let aUka \in U_k and put η:=(ε(f(a)fk(a)))/2>0\eta := (\varepsilon - (f(a) - f_k(a)))/2 > 0; continuity of ff and of fkf_k at aa gives reals δ1,δ2>0\delta_1, \delta_2 > 0 with f(x)f(a)<η|f(x)-f(a)| < \eta for d(x,a)<δ1d(x,a) < \delta_1 and fk(x)fk(a)<η|f_k(x)-f_k(a)| < \eta for d(x,a)<δ2d(x,a) < \delta_2, and then δ:=min{δ1,δ2}>0\delta := \min\{\delta_1,\delta_2\} > 0 gives, for d(x,a)<δd(x,a) < \delta, the estimate f(x)fk(x)<(f(a)+η)(fk(a)η)=(f(a)fk(a))+2η=εf(x) - f_k(x) < (f(a)+\eta) - (f_k(a)-\eta) = (f(a)-f_k(a)) + 2\eta = \varepsilon, so B(a,δ)UkB(a,\delta) \subseteq U_k.

step 1.2A2L4L5choose
2.3

X=kNUkX = \bigcup_{k \in \mathbb{N}} U_k: given xXx \in X, convergence fk(x)f(x)f_k(x) \to f(x) supplies kk with fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon, hence f(x)fk(x)<εf(x) - f_k(x) < \varepsilon and xUkx \in U_k.

step 1.2A2
3.1

If X=X = \varnothing the conclusion holds with N:=0N := 0, the condition being vacuous; so assume XX \ne \varnothing, and compactness applied to the family (Uk)kN(U_k)_{k \in \mathbb{N}} gives nNn \in \mathbb{N} and k0,,knNk_0, \dots, k_n \in \mathbb{N} with X=Uk0UknX = U_{k_0} \cup \dots \cup U_{k_n}.

step 2.2step 2.3L6L8
4.1

By [L7] there is jnj^{\ast} \le n with kjkjk_j \le k_{j^{\ast}} for every jnj \le n; put N:=kjN := k_{j^{\ast}}.

step 3.1L7
5.1

UmUNU_m \subseteq U_N whenever mNm \le N: for xUmx \in U_m we have fm(x)fN(x)f_m(x) \le f_N(x) by [L1], so f(x)fN(x)f(x)fm(x)<εf(x) - f_N(x) \le f(x) - f_m(x) < \varepsilon.

step 1.2step 4.1A1L1
6.1

Hence X=Uk0UknUNX = U_{k_0} \cup \dots \cup U_{k_n} \subseteq U_N, so X=UNX = U_N, that is f(x)fN(x)<εf(x) - f_N(x) < \varepsilon for every xXx \in X.

step 3.1step 4.1step 5.1
7.1

For every kNk \ge N and every xXx \in X: 0f(x)fk(x)f(x)fN(x)<ε0 \le f(x) - f_k(x) \le f(x) - f_N(x) < \varepsilon, using fk(x)f(x)f_k(x) \le f(x) from step 2.1 and fN(x)fk(x)f_N(x) \le f_k(x) from [L1]; so fk(x)f(x)<ε|f_k(x) - f(x)| < \varepsilon.

step 2.1step 6.1A1L1
8.1

As ε\varepsilon was an arbitrary positive real, step 7.1 produces for each of them an index NN serving every point of XX, which is uniform convergence of (fk)(f_k) to ff.

step 1.2step 3.1step 7.1L8

Remarks

  • Where continuity of the limit is used. Only in step 2.2, to make UkU_k open. Without it the sets UkU_k need not be open, the cover argument collapses, and the conclusion is false: the companion page exhibits continuous fkf_k increasing pointwise on the compact space [0,1][0,1] to a discontinuous limit, with no uniform convergence.

  • Where monotonicity is used. Twice, and both times to turn "some index works at this point" into "one index works at every point": at step 5.1, to make the sets UkU_k increase with kk so that a finite subcover collapses to a single UNU_N, and at step 7.1, to propagate the bound from NN to every later index.

  • Where compactness is used. Once, at step 3.1. On a non-compact domain the theorem fails, and the standard witness is the increasing sequence of functions on (0,1](0,1] that are 00 up to 1/(k+1)1/(k+1) and rise to 11; nothing on this page needs that witness and it is not constructed here.

  • The conclusion is genuinely about the sequence and not about the family. Dini's theorem says nothing about an arbitrary set of continuous functions with a continuous pointwise supremum; the ordering of the sequence by its index is what steps 5.1 and 7.1 consume.

RemarkRemark: AI-generatedProof: Not applicableverified 2026-08-05 (claude-sonnet-5)Open item page →

Standing hypotheses on this page: a metric domain, where the target must be metric, and why the compact-open topology is built from metric compactness

This page carries several standing hypotheses, and a reader who does not know which are essential and which are bookkeeping will misread its scope. They are collected here once and then used silently.

1. "The domain is a metric space" is this page's standing convention, not a hypothesis every item needs; each Statement carries exactly what its own proof uses. Where the domain must be metric, the hypothesis is inherited rather than decorative: an item quantifying over the compact subsets of the domain reads compactness through Open cover, subcover, compact metric space, and compact subset of a metric space, and it does so because 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\}, the definition this development is built over, is stated for a metric (X,d)(X,d). That restriction is a scope choice of this page and not a gap in the library. Compactness for an arbitrary topological space (Open cover, subcover, and compact topological space; a compact subset is a subspace that is compact in its own right) is developed earlier in the reading order and is available here; on a metric space the two readings of "compact subset" agree (For a metric space with its metric topology, compactness in the topological sense is compactness in the metric sense, and the two notions of compact subset coincide), so nothing below is weakened by taking the metric one. The items with a metric domain for that reason are Locally compact metric space: every point has a compact neighbourhood, In a locally compact metric space every point has arbitrarily small compact closed balls, hence a neighbourhood base of compact sets, Tube lemma: if KK is a compact subset of a metric space XX, ZZ is a topological space and NN is open in X×ZX \times Z with K×{z0}NK \times \{z_0\} \subseteq N, then K×WNK \times W \subseteq N for some open Wz0W \ni z_0, 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\}, 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, 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, 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, The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x), If XX is a locally compact metric space then the evaluation map is continuous for the compact-open topology, If f:X×ZYf : X \times Z \to Y is continuous then its transpose F:ZC(X,Y)F : Z \to C(X,Y), F(z)(x)=f(x,z)F(z)(x) = f(x,z), is continuous for the compact-open topology, with no hypothesis on XX beyond being metric, The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology and Dini's theorem: on a compact metric space a nondecreasing sequence of continuous real functions converging pointwise to a continuous limit converges uniformly, together with the three false statements, whose witnesses are metric spaces. Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces also takes a metric domain, for a different reason: it writes a distance in the domain.

Several items on this page need no metric on the domain at all, and say so. The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y) and A sequence converges in the topology of pointwise convergence exactly when it converges at every point are stated for a bare set XX. 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}, 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), Convergence in the uniform metric is exactly uniform convergence: one NN serving every point and If (Y,d)(Y,d) is complete then YXY^{X} is complete in the uniform metric, and so is C(X,Y)C(X,Y) are stated for a nonempty set XX. A uniform limit of continuous functions is continuous, so C(X,Y)C(X,Y) is closed in YXY^{X} under the uniform metric is stated for an arbitrary topological space XX, no distance in the domain being used anywhere in its proof. Where any of these speaks of C(X,Y)C(X,Y) it asks in addition only that XX carry a topology, continuity being meaningless otherwise.

Where a purely topological statement is nevertheless made about a metric domain, it is made through Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not: the metric topology is the topology, so the two vocabularies name one thing.

2. The target is metric exactly where a distance in it is written. The topology 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)), the compact-open topology (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\}), the evaluation map (The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x)) and the exponential law (The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology) need only the open sets of the target, so there YY is an arbitrary topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison). The uniform metric (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}), the topology 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)), the topology 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), the comparison theorem, completeness, Dini's theorem and equicontinuity (Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces) all write a distance d(f(x),g(x))d(f(x),g(x)), and there YY is required to be metric. The theorem that the compact-open and compact-convergence topologies agree (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) is exactly the bridge between the two regimes, and it is stated with both spaces metric because that is where both topologies are defined.

3. XX is nonempty wherever a supremum over XX is taken. The uniform metric is a real-valued supremum over XX. The extended real line is introduced later. This page does not use it and adopts no convention sup=\sup\varnothing=-\infty (Conventions: sup\sup \emptyset, unbounded sets, and the extended reals). So 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} carries the hypothesis XX \ne \varnothing and everything resting on it inherits it. Nothing is lost: for X=X = \varnothing the set of functions has exactly one element (The product set iIXi\prod_{i \in I} X_i of functions choosing a point in each factor, the projections, the box topology, and the product topology as the initial topology of the projections; the empty product is a one-point space) and all questions on this page are trivial there.

4. C(X,Y)C(X,Y) never carries a default topology. Four topologies appear on this page, and every statement names the one it means at the point of use. Where a subset of C(X,Y)C(X,Y) is topologised, it carries the subspace topology of the named one.

5. Compact sets carry no separation hypothesis, and the sets S(K,V)S(K,V) are not spheres. No Hausdorff assumption is made about the target anywhere on this page (Hausdorff space: distinct points have disjoint open neighbourhoods; every metrizable space is Hausdorff and the indiscrete topology on two points is not); where the target is metric it is Hausdorff for free (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and where it is not metric nothing here needs it. And the notation S(K,V)S(K,V) of 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\} is unrelated to the sphere S(x,r)S(x,r) of Open ball, closed ball and sphere in a metric space; no sphere is written on this page.

6. Two objects on this page are deliberately new rather than reused, and each says so where it is defined.

7. YXY^{X} here is a bare set of functions with the product topology, not the vector space of The vector space FXF^{X} of all functions XFX \to F with pointwise operations, and FnF^{n} as the case X=n={0,1,,n1}X = n = \{0, 1, \dots, n-1\}. That item writes FXF^{X} for the same underlying set when the target is a field and equips it with pointwise addition and scalar multiplication. Nothing on this page uses those operations, and the target is not assumed to carry any algebraic structure at all. Where both are in play, the algebraic structure is named.

8. General conventions of the two ambient developments apply unchanged: topologies are compared as coarser and finer, never weaker and stronger, and neighbourhoods are not required to be open. The metric conventions of Which metric axiom list this library uses, the live naming fork between semimetric and pseudometric, and why extended metrics are not treated here also apply — real-valued metrics only, no extended metrics. N\mathbb{N} contains 00 and every sequence on this page is indexed from 00, so every reciprocal written here is 1/(k+1)1/(k+1) or 1/(k+2)1/(k+2) and never 1/k1/k.

What this page does not do. It does not prove the Ascoli-Arzelà theorem or the Stone-Weierstrass theorem, both of which belong to later pages; Equicontinuity at a point, uniform equicontinuity, and pointwise boundedness of a family of maps between metric spaces is placed here only so that the first of those pages has its vocabulary earlier in the reading order. It does not claim that the exponential law is a homeomorphism — The exponential law: for a locally compact metric XX and any spaces ZZ and YY, transposition is a bijection between C(X×Z,Y)C(X \times Z, Y) and C(Z,C(X,Y))C(Z, C(X,Y)) with the compact-open topology is a bijection of sets of continuous maps, and its own remark records exactly what the homeomorphism form would additionally require. And it does not claim that the compact-open topology is metrizable; the negative statement, with a witness, is on this page.

5 · Examples, counterexamples and false statements

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-05 (claude-sonnet-5)Open item page →

FALSE: a pointwise convergent sequence of continuous functions converges uniformly on every compact set

Statement

False claim: for metric spaces XX and YY, if a sequence (fk)(f_k) in C(X,Y)C(X,Y) converges pointwise to fC(X,Y)f \in C(X,Y) (A sequence converges in the topology of pointwise convergence exactly when it converges at every point), then (fk)(f_k) converges to ff uniformly on every compact subset of XX, that is fkff_k \to f in the topology 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).

The claim fails already on the compact space X=[0,1]X = [0,1] with Y=RY = \mathbb{R}, where it reduces to "pointwise convergence implies uniform convergence". The refutation below writes down the standard moving spike explicitly. The relation that is true is the inclusion of topologies (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): compact convergence implies pointwise convergence, and not the reverse.

No choice principle is used; every function below is given by a formula.

Facts & Assumptions

Given: The interval X:=[0,1]={tR:0t1}X := [0,1] = \{\, t \in \mathbb{R} : 0 \le t \le 1 \,\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) with the metric d(s,t)=std(s,t) = |s-t| inherited from R\mathbb{R} (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), the target Y:=RY := \mathbb{R} with the same metric, the reals ak:=1/ι(k+2)a_k := 1/\iota(k+2) for kNk \in \mathbb{N} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), and the constant function 0:XR\mathbf{0} : X \to \mathbb{R} with value 00.

[L1]

ι\iota is strictly increasing on N\mathbb{N} and ι(n)>0\iota(n) > 0 for n1n \ge 1, so 0<ak1/ι(2)=1/20 < a_k \le 1/\iota(2) = 1/2 and 0<2ak10 < 2a_k \le 1 for every kNk \in \mathbb{N}, and mnm \le n gives anama_n \le a_m (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing, Inverses of positives are positive, and reciprocation reverses order).

[L2]

For every real ε>0\varepsilon > 0 there is a natural m1m \ge 1 with 1/ι(m)<ε1/\iota(m) < \varepsilon (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon).

[L7]

The basic sets of the topology of compact convergence are BK(f,ε)={g:d(f(x),g(x))<ε for every xK}B_K(f,\varepsilon) = \{\, g : d(f(x),g(x)) < \varepsilon \text{ for every } x \in K \,\}, and a sequence converging to ff in a topology is eventually inside every neighbourhood of ff (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, The topology of pointwise convergence on YXY^{X}, which is the product topology, and its restriction to C(X,Y)C(X,Y)).

Refutation

technique · direct
1.1

[0,1][0,1] is bounded, being contained in the ball B(0,2)B(0,2) of R\mathbb{R}, and closed in R\mathbb{R}, since a point y<0y < 0 has B(y,y)B(y,-y) inside the complement and a point y>1y > 1 has B(y,y1)B(y, y-1) inside the complement; so [0,1][0,1] is a compact subset of R\mathbb{R} and (X,d)(X,d) is a compact metric space.

L5L6
1.2

For kNk \in \mathbb{N} define fk:XRf_k : X \to \mathbb{R} by fk(t):=t/akf_k(t) := t/a_k for 0tak0 \le t \le a_k, by fk(t):=2t/akf_k(t) := 2 - t/a_k for akt2aka_k \le t \le 2a_k, and by fk(t):=0f_k(t) := 0 for 2akt12a_k \le t \le 1.

constructL1
2.1

The three formulas agree where their domains overlap: at t=akt = a_k both of the first two give 11, and at t=2akt = 2a_k both of the last two give 00; so fkf_k is a well-defined function on XX, the three closed sets [0,ak][0,a_k], [ak,2ak][a_k,2a_k] and [2ak,1][2a_k,1] covering XX because 0<2ak10 < 2a_k \le 1.

step 1.2L1
2.2

fk(0)=0f_k(0) = 0 for every kk, from the first formula.

step 1.2
2.3

For tXt \in X with t>0t > 0: by [L2] there is a natural m1m \ge 1 with 1/ι(m)<t/21/\iota(m) < t/2, and then every kmk \ge m has k+2>mk + 2 > m, hence ak=1/ι(k+2)1/ι(m)<t/2a_k = 1/\iota(k+2) \le 1/\iota(m) < t/2, hence 2ak<t2a_k < t and fk(t)=0f_k(t) = 0 by the third formula.

step 1.2L1L2
2.4

On the other hand fk(ak)=ak/ak=1f_k(a_k) = a_k/a_k = 1 for every kNk \in \mathbb{N}, and akXa_k \in X because 0<ak1/210 < a_k \le 1/2 \le 1.

step 1.2L1
3.1

Each of the three restrictions is the restriction of an affine map of R\mathbb{R}, hence continuous; so fkf_k is continuous on XX by the pasting lemma for a finite closed cover, and fkC(X,R)f_k \in C(X,\mathbb{R}).

step 1.2step 2.1L3L4
3.2

By steps 2.2 and 2.3 the sequence (fk(t))(f_k(t)) is eventually 00 for every tXt \in X, so fk(t)0=0(t)f_k(t) \to 0 = \mathbf{0}(t) for every tXt \in X; that is, (fk)(f_k) converges pointwise to 0\mathbf{0}, which is continuous, being constant.

step 2.2step 2.3L3
3.3

Hence for every kNk \in \mathbb{N} the value fk(ak)0(ak)=1|f_k(a_k) - \mathbf{0}(a_k)| = 1 is not below 1/21/2, so fkBX(0,1/2)f_k \notin B_{X}(\mathbf{0}, 1/2), while BX(0,1/2)B_{X}(\mathbf{0},1/2) is a basic open set of the topology of compact convergence containing 0\mathbf{0}, the whole space XX being compact by step 1.1.

step 1.1step 2.4L7
4.1

So no tail of (fk)(f_k) lies in the neighbourhood BX(0,1/2)B_X(\mathbf{0},1/2) of 0\mathbf{0}: the sequence does not converge to 0\mathbf{0} in the topology of compact convergence, although by step 3.2 it converges to 0\mathbf{0} pointwise.

step 3.2step 3.3L7
5.1

The pair (X,Y)=([0,1],R)(X,Y) = ([0,1],\mathbb{R}) with the sequence (fk)(f_k) and the limit 0\mathbf{0} therefore satisfies the hypothesis of the claim and violates its conclusion at the compact set K=XK = X, so the claim is false.

step 3.2step 4.1

Remarks

  • The failure is not about the size of the domain. The domain here is compact, so "uniformly on every compact set" is the same as "uniformly", and the witness shows that pointwise convergence does not give uniform convergence even there. What moves is the place where the two functions differ: the spike has height 11 for every kk and merely slides towards 00.

  • The area under the spike does tend to 00, so this witness does not also separate the integral from its pointwise limit: the standard warning that pointwise convergence controls no integral needs a spike whose height grows as its base shrinks. Nothing about integration is claimed here.

  • What is true in this direction. Uniform convergence implies convergence on every compact set, which implies pointwise convergence (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); the reverse of each implication fails, and the companion page separates the two rightmost topologies with a different witness on R\mathbb{R}.

  • The index shift is not cosmetic. N\mathbb{N} contains 00, so the spike is built on 1/ι(k+2)1/\iota(k+2) and not on 1/k1/k: at k=0k = 0 the reciprocal 1/ι(1)1/\iota(1) would give a support [0,2][0,2] reaching outside [0,1][0,1], and the pasting lemma would have nothing to paste.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

FALSE: the compact-open topology on C(X,Y)C(X,Y) is metrizable for every metric XX and YY

Statement

False claim: for all metric spaces (X,dX)(X,d_X) and (Y,dY)(Y,d_Y) the compact-open topology on C(X,Y)C(X,Y) (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\}) is metrizable (Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not).

The witness is X=RX = \mathbb{R} carrying the discrete metric and Y=RY = \mathbb{R} carrying its usual metric. There the compact-open topology is the topology of pointwise convergence on the set of all functions RR\mathbb{R} \to \mathbb{R}, that is the product topology on RR\mathbb{R}^{\mathbb{R}}, and that space is not first countable, hence not metrizable.

The Axiom of Countable Choice is used once and is flagged where it is spent, at step 5.1, through Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega (The Axiom of Countable Choice (ACω\mathrm{AC}_\omega)).

Facts & Assumptions

Given: The set R\mathbb{R} with the discrete metric ρ(u,v):=1\rho(u,v) := 1 for uvu \ne v and ρ(u,u):=0\rho(u,u) := 0; the space X:=(R,ρ)X := (\mathbb{R},\rho) with its metric topology; the target Y:=RY := \mathbb{R} with the usual metric d(s,t)=std(s,t) = |s-t| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded); and the constant function 0:RR\mathbf{0} : \mathbb{R} \to \mathbb{R} with value 00.

[L6]

A neighbourhood base at a point is a family of neighbourhoods of it every neighbourhood of which contains a member; an open set containing the point is a neighbourhood of it; and the neighbourhood filter is nonempty (Neighbourhood of a point and neighbourhood base, with this library's convention that a neighbourhood need not be open).

[L7]

An at most countable nonempty family is the set of values of a function with domain N\mathbb{N} (Finite, countably infinite, countable, uncountable, Injection, surjection, bijection).

[L8]

Assuming the Axiom of Countable Choice, a union over N\mathbb{N} of at most countable sets is at most countable; a subset of an at most countable set is at most countable; and R\mathbb{R} is uncountable (Countable unions of at most countable sets, assuming ACω\mathrm{AC}_\omega, The Axiom of Countable Choice (ACω\mathrm{AC}_\omega), Every subset of an at most countable set is at most countable, R\mathbb{R} is uncountable (Cantor's nested intervals, 1874), Finite, countably infinite, countable, uncountable).

Refutation

technique · direct
1.1

ρ\rho is a metric on R\mathbb{R}: it is symmetric and vanishes exactly on the diagonal by definition, and for the triangle inequality ρ(u,w)ρ(u,v)+ρ(v,w)\rho(u,w) \le \rho(u,v) + \rho(v,w) either u=wu = w, when the left side is 00, or uwu \ne w, when vv differs from at least one of uu and ww and the right side is at least 1=ρ(u,w)1 = \rho(u,w).

givenconstruct
2.1

In X=(R,ρ)X = (\mathbb{R},\rho) every subset is open, since Bρ(u,1)={u}B_\rho(u,1) = \{u\} for every uu; consequently every function RR\mathbb{R} \to \mathbb{R} is continuous as a map XYX \to Y, so C(X,Y)=YX=RRC(X,Y) = Y^{X} = \mathbb{R}^{\mathbb{R}} as sets.

step 1.1L1L2
3.1

A subset KXK \subseteq X is compact exactly when it is finite: the family {{u}:uK}\{\, \{u\} : u \in K \,\} is a family of open subsets covering KK, so compactness forces finitely many singletons to cover KK, and conversely every finite set is compact.

step 2.1L3
4.1

For finite K={x0,,xn1}K = \{x_0,\dots,x_{n-1}\} and open VRV \subseteq \mathbb{R} one has S(K,V)=πx01[V]πxn11[V]S(K,V) = \pi_{x_0}^{-1}[V] \cap \dots \cap \pi_{x_{n-1}}^{-1}[V], and S(,V)S(\varnothing,V) is the whole space; conversely πx1[V]=S({x},V)\pi_x^{-1}[V] = S(\{x\},V) with {x}\{x\} compact.

step 3.1L4
5.1

By step 4.1 every subbasic set of the compact-open topology is open in the topology of pointwise convergence and every subbasic set of the topology of pointwise convergence is open in the compact-open topology; so the two topologies on RR\mathbb{R}^{\mathbb{R}} are equal, and it suffices to show that the topology of pointwise convergence on RR\mathbb{R}^{\mathbb{R}} is not metrizable.

step 3.1step 4.1L4suffices: the pointwise topology on the functions of the line is not metrizable
6.1

Let B\mathcal{B} be any at most countable neighbourhood base at 0\mathbf{0} in that topology; B\mathcal{B} is nonempty, since the whole space is a neighbourhood of 0\mathbf{0} and must contain a member of B\mathcal{B}, so there is a function kNkk \mapsto N_k with domain N\mathbb{N} whose set of values is B\mathcal{B}.

step 5.1L6L7choose
7.1

For kNk \in \mathbb{N} put Gk:={xR:πx[Nk]R}G_k := \{\, x \in \mathbb{R} : \pi_x[N_k] \ne \mathbb{R} \,\}, a set determined by NkN_k with nothing selected.

step 6.1construct
8.1

Each GkG_k is finite: NkN_k is a neighbourhood of 0\mathbf{0}, so it contains a basic set B=j<nπxj1[Vj]B = \bigcap_{j<n} \pi_{x_j}^{-1}[V_j] with 0B\mathbf{0} \in B, whence 0Vj0 \in V_j for every j<nj < n; for xx outside the finite set F:={x0,,xn1}F := \{x_0,\dots,x_{n-1}\} and any tRt \in \mathbb{R} the function agreeing with 0\mathbf{0} everywhere except at xx, where it takes the value tt, lies in BNkB \subseteq N_k and has tt as its coordinate at xx, so πx[Nk]=R\pi_x[N_k] = \mathbb{R} and xGkx \notin G_k; hence GkFG_k \subseteq F and GkG_k is finite, a subset of a finite set being finite.

step 7.1L4L6L8
9.1

Therefore G:=kNGkG := \bigcup_{k \in \mathbb{N}} G_k is at most countable, being a union over N\mathbb{N} of at most countable sets; this step and only this step uses the Axiom of Countable Choice.

step 8.1L8
10.1

RG\mathbb{R} \setminus G \ne \varnothing: otherwise RG\mathbb{R} \subseteq G would make R\mathbb{R} at most countable, contradicting its uncountability; so fix xRGx_{\ast} \in \mathbb{R} \setminus G.

step 9.1L8choose
11.1

The set N:=πx1[(1,1)]N := \pi_{x_{\ast}}^{-1}[(-1,1)] is a subbasic open set containing 0\mathbf{0}, hence a neighbourhood of 0\mathbf{0}; and no NkN_k is contained in NN, since NkNN_k \subseteq N would give πx[Nk](1,1)R\pi_{x_{\ast}}[N_k] \subseteq (-1,1) \ne \mathbb{R} and hence xGkGx_{\ast} \in G_k \subseteq G, which step 10.1 excludes.

step 7.1step 10.1L4L6L9
12.1

So B\mathcal{B} is not a neighbourhood base at 0\mathbf{0} after all; as B\mathcal{B} was an arbitrary at most countable family of neighbourhoods of 0\mathbf{0}, the space has no at most countable neighbourhood base at 0\mathbf{0} and is not first countable, hence not metrizable.

step 6.1step 11.1L5L6
13.1

With step 5.1 this exhibits metric spaces XX and YY for which the compact-open topology on C(X,Y)C(X,Y) is not metrizable, so the claim is false.

step 5.1step 12.1

Remarks

  • The set GkG_k is defined from NkN_k and is not chosen. Writing "pick a basic open set inside NkN_k for each kk" would be a countable choice on top of the one already spent; taking instead the set of coordinates at which NkN_k is constrained at all is a definition, and step 8.1 then shows it is finite by exhibiting one basic set, without needing to remember which.

  • Where the failure really lives. The compact-open topology is not at fault: on a discrete domain it coincides with the product topology, and it is the product over an uncountable index set that is not first countable. A basic neighbourhood constrains only finitely many coordinates, so countably many of them constrain only countably many coordinates in total, and an uncountable index set always has one to spare.

  • What is true. For a metric target and a domain that is a countable union of compact sets in a suitable sense, the compact-open topology is metrizable, by a metric built from countably many of the sets BK(f,ε)B_K(f,\varepsilon). That positive result needs countable exhaustion machinery this library does not yet have, and it is not claimed here; what this page does prove is that the compact-open and compact-convergence topologies agree for metric XX and YY (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), which is a different statement and implies no metrizability.

False statementConstruction: AI-adaptedVerification: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29Open item page →

FALSE: the evaluation map on C(X,Y)C(X,Y) with the compact-open topology is continuous for every metric XX

Statement

False claim: for every metric space XX and every topological space YY the evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x) (The evaluation map e:C(X,Y)×XYe : C(X,Y) \times X \to Y, e(f,x)=f(x)e(f,x) = f(x)), is continuous when C(X,Y)C(X,Y) carries the compact-open topology (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\}).

The witness is X=QX = \mathbb{Q}, the rationals inside R\mathbb{R} with the metric d(s,t)=std(s,t) = |s-t|, and Y=RY = \mathbb{R} with the same metric. The load-bearing fact is that a compact subset of Q\mathbb{Q} has empty interior in Q\mathbb{Q}: it is closed in R\mathbb{R}, and a subset of Q\mathbb{Q} closed in R\mathbb{R} that contained a Q\mathbb{Q}-ball would contain a whole real interval, which is uncountable while Q\mathbb{Q} is not.

What the true theorem on this page requires is therefore not decoration. Continuity of the evaluation map is proved here under the hypothesis that XX is locally compact (Locally compact metric space: every point has a compact neighbourhood, If XX is a locally compact metric space then the evaluation map is continuous for the compact-open topology), and Q\mathbb{Q} is a metric space that is locally compact at no point, exactly because of the fact just named.

No choice principle is used.

Facts & Assumptions

Given: The rationals Q\mathbb{Q} inside R\mathbb{R} with the metric d(s,t)=std(s,t) = |s-t| (The absolute value makes R\mathbb{R} a metric space: d(x,y)=xyd(x,y) = |x-y| is a metric, its open balls are the intervals (xr,x+r)(x-r, x+r), and it is unbounded, Isometry, isometric embedding, and the subspace metric on a subset), the target R\mathbb{R} with the same metric, the constant function z:QRz : \mathbb{Q} \to \mathbb{R} with value 00, and the open interval V:=(1,1)V := (-1,1) (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

[L2]

A union of two closed subsets of a metric space is closed, its complement being an intersection of two open sets; iterating covers any finite list, and \varnothing is closed (Arbitrary unions and finite intersections of open sets are open, open balls are open and closed balls are closed, 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).

[L3]

Strictly between any two reals lies a rational (The rationals embed densely in the reals).

[L4]

For nonempty AA the closure is A={x:d(x,A)=0}\overline{A} = \{\, x : d(x,A) = 0 \,\}, a closed set equals its closure and contains it, and d(x,A)0d(x,A) \ge 0 with d(x,A)d(x,a)d(x,A) \le d(x,a) for every aAa \in A; d(x,A)=0d(x,A) = 0 when xAx \in A (The closure of a nonempty AA is {x:d(x,A)=0}\{x : d(x,A) = 0\}, equals AA together with its limit points, and is the smallest closed superset, Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Greatest lower bound (infimum)).

[L5]

Every nondegenerate open interval of R\mathbb{R} is uncountable, Q\mathbb{Q} is at most countable, and a subset of an at most countable set is at most countable (Every nondegenerate interval of R\mathbb{R} is uncountable, Q\mathbb{Q} is countably infinite, Every subset of an at most countable set is at most countable, Finite, countably infinite, countable, uncountable).

[L9]

The minimum of a two-element set of reals exists, is one of them, and is at most each of them (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

Refutation

technique · contradiction
1.1

Suppose the claim holds; in particular, with X:=QX := \mathbb{Q} and Y:=RY := \mathbb{R}, the evaluation map e:C(Q,R)×QRe : C(\mathbb{Q},\mathbb{R}) \times \mathbb{Q} \to \mathbb{R} is continuous.

assume-contra
1.2

The constant function zz is continuous, and e(z,0)=0Ve(z,0) = 0 \in V with VV open in R\mathbb{R}.

givenL6L8
2.1

Continuity of ee at the point (z,0)(z,0) gives, by the two bases of [L7], a natural nn, compact sets K0,,Kn1QK_0, \dots, K_{n-1} \subseteq \mathbb{Q}, open sets V0,,Vn1RV_0, \dots, V_{n-1} \subseteq \mathbb{R} and an open UQU \subseteq \mathbb{Q} with 0U0 \in U, such that zO:=S(K0,V0)S(Kn1,Vn1)z \in O := S(K_0,V_0) \cap \dots \cap S(K_{n-1},V_{n-1}) and e[O×U]Ve[O \times U] \subseteq V.

step 1.1step 1.2L7choose
3.1

Fix a real ε>0\varepsilon > 0 with BQ(0,ε)UB_{\mathbb{Q}}(0,\varepsilon) \subseteq U.

step 2.1L8choose
3.2

Put K:=K0Kn1K := K_0 \cup \dots \cup K_{n-1}, with K:=K := \varnothing when n=0n = 0; each KjK_j is a compact subset of R\mathbb{R} and hence closed in R\mathbb{R}, so KK is a subset of Q\mathbb{Q} closed in R\mathbb{R}.

step 2.1L1L2
4.1

BQ(0,ε)⊈KB_{\mathbb{Q}}(0,\varepsilon) \not\subseteq K: otherwise (ε,ε)QK(-\varepsilon,\varepsilon) \cap \mathbb{Q} \subseteq K, and this set is nonempty since it contains 00; every t(ε,ε)t \in (-\varepsilon,\varepsilon) then satisfies d(t,(ε,ε)Q)=0d(t, (-\varepsilon,\varepsilon) \cap \mathbb{Q}) = 0, because for a real s>0s > 0 the set (max{ts,ε}, min{t+s,ε})(\max\{t-s,-\varepsilon\},\ \min\{t+s,\varepsilon\}) is a nondegenerate open interval and so contains a rational within ss of tt; hence tt lies in the closure of that set, which the closed KK contains, so (ε,ε)KQ(-\varepsilon,\varepsilon) \subseteq K \subseteq \mathbb{Q}, making the uncountable interval (ε,ε)(-\varepsilon,\varepsilon) at most countable, which is false.

step 3.2L3L4L5L8L9
5.1

Fix qBQ(0,ε)q \in B_{\mathbb{Q}}(0,\varepsilon) with qKq \notin K.

step 4.1choose
6.1

Put η:=min{d(q,K), 1}\eta := \min\{d(q,K),\ 1\} when KK \ne \varnothing and η:=1\eta := 1 when K=K = \varnothing; then 0<η10 < \eta \le 1, because KK closed in R\mathbb{R} and qKq \notin K give qKq \notin \overline{K} and hence d(q,K)0d(q,K) \ne 0, while d(q,K)0d(q,K) \ge 0; and qtd(q,K)η|q - t| \ge d(q,K) \ge \eta for every tKt \in K.

step 3.2step 5.1L4L9
6.2

qUq \in U, since q0<ε|q - 0| < \varepsilon puts qq in BQ(0,ε)UB_{\mathbb{Q}}(0,\varepsilon) \subseteq U.

step 3.1step 5.1
7.1

Put A:={sQ:sqη}A := \{\, s \in \mathbb{Q} : |s - q| \ge \eta \,\}, which is nonempty because q+1Qq + 1 \in \mathbb{Q} and (q+1)q=1η|(q+1) - q| = 1 \ge \eta, and define g:QRg : \mathbb{Q} \to \mathbb{R} by g(s):=(2/η)d(s,A)g(s) := (2/\eta)\, d(s,A).

step 6.1constructL4
8.1

gg is Lipschitz with constant 2/η2/\eta, hence continuous, so gC(Q,R)g \in C(\mathbb{Q},\mathbb{R}).

step 7.1L6
8.2

gg vanishes on KK: every tKt \in K lies in Q\mathbb{Q} and satisfies tqη|t - q| \ge \eta by step 6.1, so tAt \in A and d(t,A)=0d(t,A) = 0.

step 6.1step 7.1L4
8.3

g(q)2g(q) \ge 2: every sAs \in A satisfies qsη|q - s| \ge \eta, so η\eta is a lower bound of the distances from qq to the members of AA and d(q,A)ηd(q,A) \ge \eta, whence g(q)=(2/η)d(q,A)2g(q) = (2/\eta)\,d(q,A) \ge 2.

step 7.1L4
9.1

gOg \in O: for each j<nj < n with KjK_j \ne \varnothing we have zS(Kj,Vj)z \in S(K_j,V_j), so 0Vj0 \in V_j, and g[Kj]{0}Vjg[K_j] \subseteq \{0\} \subseteq V_j by step 8.2 since KjKK_j \subseteq K; for Kj=K_j = \varnothing the condition is vacuous; and for n=0n = 0 the set OO is the whole of C(Q,R)C(\mathbb{Q},\mathbb{R}).

step 2.1step 3.2step 8.1step 8.2
10.1

Hence (g,q)O×U(g,q) \in O \times U while e(g,q)=g(q)2e(g,q) = g(q) \ge 2, so e(g,q)(1,1)=Ve(g,q) \notin (-1,1) = V, contradicting e[O×U]Ve[O \times U] \subseteq V of step 2.1; the assumption of step 1.1 is therefore false, and the claim fails for X=QX = \mathbb{Q} and Y=RY = \mathbb{R}.

step 2.1step 8.3step 9.1step 6.2discharge-contradiction

Remarks

Sources