Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

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.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · next 3 levels

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

Sources