Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

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.

Depends on

Used by

Dependency tree · next 3 levels

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

Sources