Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-27
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 uniformly continuous map from a dense subspace into a complete metric space extends uniquely to a uniformly continuous map on the whole space

Statement

Let (X,dX)(X,d_X) 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), let AXA \subseteq X be dense in XX (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) and carry the subspace metric (Isometry, isometric embedding, and the subspace metric on a subset), let (Y,dY)(Y,d_Y) be a complete metric space (Complete metric space: every Cauchy sequence converges in the space), and let f:AYf : A \to Y be uniformly continuous (Uniform continuity of a map of metric spaces: one δ\delta serving every point). Then:

  1. There is a uniformly continuous g:XYg : X \to Y with g(a)=f(a)g(a) = f(a) for every aAa \in A.
  2. gg is the only continuous map XYX \to Y extending ff (Continuity of a map between metric spaces, at a point and globally, in the ε\varepsilon-δ\delta form).

The map gg is constructed explicitly below, as the unique point common to the closures of the images of the shrinking balls around xx; no value of gg is selected, each is determined.

Facts & Assumptions

Given: A metric space (X,dX)(X,d_X), a dense AXA \subseteq X, a complete metric space (Y,dY)(Y,d_Y), a uniformly continuous f:AYf : A \to Y, and a real ε>0\varepsilon > 0. For xXx \in X and nNn \in \mathbb{N} write Un(x):=BX(x,1/(n+1))AU_n(x) := B_X\big(x, 1/(n+1)\big) \cap A, Sn(x):=f[Un(x)]S_n(x) := f[U_n(x)] and Tn(x):=Sn(x)T_n(x) := \overline{S_n(x)}, the closure taken in YY.

[A1]

Density: A=X\overline{A} = X, so BX(x,r)AB_X(x,r) \cap A \ne \emptyset for every xXx \in X and every real r>0r > 0 (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space, Open ball, closed ball and sphere in a metric space).

[A2]

Uniform continuity of ff: for every real ε>0\varepsilon > 0 there is a real δ>0\delta > 0 with dY(f(a),f(a))<εd_Y(f(a),f(a')) < \varepsilon for all a,aAa,a' \in A with dX(a,a)<δd_X(a,a') < \delta; distances inside AA are those of XX (Uniform continuity of a map of metric spaces: one δ\delta serving every point, Isometry, isometric embedding, and the subspace metric on a subset).

[A3]
[L1]

Cantor's intersection theorem in a complete space: a sequence of nonempty closed bounded sets, nested and with diameters tending to 00, has exactly one common point (In a complete metric space nested nonempty closed sets whose diameters tend to 00 meet in exactly one point, and this property characterises completeness).

[L3]

Diameter: for nonempty bounded SS, diam(S)=sup{d(u,v):u,vS}\operatorname{diam}(S) = \sup\{d(u,v) : u,v \in S\}, so any upper bound of those distances dominates the diameter; a nonempty set all of whose pairwise distances are below a real β\beta lies in a ball of radius β+1\beta + 1 around any of its points, hence is bounded (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Complete ordered field (least-upper-bound property), Open ball, closed ball and sphere in a metric space).

[L4]

Reciprocals of naturals: 1/(n+1)1/(n+1) is a positive real, decreasing in nn, and below every positive real from some index on (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Inverses of positives are positive, and reciprocation reverses order).

Proof

technique · constructive
1.1

For every xXx \in X and nNn \in \mathbb{N} the set Un(x)U_n(x) is nonempty by [A1], so Sn(x)S_n(x) is nonempty and Tn(x)T_n(x) is a nonempty closed subset of YY.

A1L2construct
1.2

The radii decrease, so Un+1(x)Un(x)U_{n+1}(x) \subseteq U_n(x) and Sn+1(x)Sn(x)S_{n+1}(x) \subseteq S_n(x); since Tn(x)T_n(x) is a closed superset of Sn+1(x)S_{n+1}(x), minimality of the closure gives Tn+1(x)Tn(x)T_{n+1}(x) \subseteq T_n(x).

L2L4
1.3

Fix a real ε>0\varepsilon > 0, let δ>0\delta > 0 be as in [A2] for ε/3\varepsilon/3, and let NN be a natural with 2/(N+1)<δ2/(N+1) < \delta; note that NN depends on ε\varepsilon alone and not on xx.

A2L4choose
1.4

Towards uniform continuity, let ε>0\varepsilon > 0 be real, let δ>0\delta > 0 be as in [A2] for ε/3\varepsilon/3, and put δ:=δ/3>0\delta' := \delta/3 > 0. Fix a natural mm with 1/(m+1)<δ/31/(m+1) < \delta/3.

A2L4choose
1.5

For claim 2, let h:XYh : X \to Y be continuous with h(a)=f(a)h(a) = f(a) for all aAa \in A, and let xXx \in X. Since A=X\overline{A} = X there is a sequence (ak)(a_k) in AA with akxa_k \to x in XX.

A1L5
2.1

Let nNn \ge N and a,aUn(x)a, a' \in U_n(x). Then dX(a,a)dX(a,x)+dX(x,a)<2/(n+1)2/(N+1)<δd_X(a,a') \le d_X(a,x) + d_X(x,a') < 2/(n+1) \le 2/(N+1) < \delta, so dY(f(a),f(a))<ε/3d_Y(f(a),f(a')) < \varepsilon/3. Hence all pairwise distances in Sn(x)S_n(x) are below ε/3\varepsilon/3, so Sn(x)S_n(x) is bounded and diam(Sn(x))ε/3\operatorname{diam}(S_n(x)) \le \varepsilon/3.

step 1.3A2L3L4L7
3.1

Let nNn \ge N, let u,vTn(x)u,v \in T_n(x) and let η>0\eta > 0 be real. The balls BY(u,η)B_Y(u,\eta) and BY(v,η)B_Y(v,\eta) meet Sn(x)S_n(x), so there are s,sSn(x)s,s' \in S_n(x) with dY(u,s)<ηd_Y(u,s) < \eta and dY(v,s)<ηd_Y(v,s') < \eta, whence dY(u,v)dY(u,s)+dY(s,s)+dY(s,v)<ε/3+2ηd_Y(u,v) \le d_Y(u,s) + d_Y(s,s') + d_Y(s',v) < \varepsilon/3 + 2\eta. As η>0\eta > 0 was arbitrary, dY(u,v)ε/3d_Y(u,v) \le \varepsilon/3: were dY(u,v)>ε/3d_Y(u,v) > \varepsilon/3, the value η:=(dY(u,v)ε/3)/3\eta := (d_Y(u,v) - \varepsilon/3)/3 would be positive and would give dY(u,v)<dY(u,v)d_Y(u,v) < d_Y(u,v).

step 2.1L2L3L7
4.1

So for nNn \ge N the set Tn(x)T_n(x) is nonempty, closed and bounded with diam(Tn(x))ε/3<ε\operatorname{diam}(T_n(x)) \le \varepsilon/3 < \varepsilon.

step 1.1step 3.1L3
5.1

Apply steps 1.3 to 4.1 with ε=1\varepsilon = 1 to get a natural N1N_1 such that Tn(x)T_n(x) is nonempty, closed and bounded for every nN1n \ge N_1 and every xXx \in X. Then (TN1+j(x))jN\big(T_{N_1+j}(x)\big)_{j \in \mathbb{N}} is nested by step 1.2, and its diameters tend to 00: given a real ε>0\varepsilon > 0, the NN of step 1.3 satisfies diam(TN1+j(x))<ε\operatorname{diam}(T_{N_1+j}(x)) < \varepsilon for every jNj \ge N, since then N1+jNN_1 + j \ge N.

step 1.2step 4.1
6.1

By [L1] and [A3] the intersection jNTN1+j(x)\bigcap_{j \in \mathbb{N}} T_{N_1+j}(x) has exactly one element; and because the family (Tn(x))n(T_n(x))_n is nested this intersection equals nNTn(x)\bigcap_{n \in \mathbb{N}} T_n(x), a set defined without reference to N1N_1. Define g(x)g(x) to be its unique element; this determines a function g:XYg : X \to Y, and no choice is made, since the value is unique.

step 1.2step 5.1A3L1construct
7.1

gg extends ff: for aAa \in A and every nn we have aUn(a)a \in U_n(a), so f(a)Sn(a)Tn(a)f(a) \in S_n(a) \subseteq T_n(a); hence f(a)nTn(a)f(a) \in \bigcap_n T_n(a), and by uniqueness g(a)=f(a)g(a) = f(a).

step 6.1L2
7.2

Let x,xXx,x' \in X with dX(x,x)<δd_X(x,x') < \delta'. Since g(x)Tm(x)=Sm(x)g(x) \in T_m(x) = \overline{S_m(x)}, the ball BY(g(x),ε/3)B_Y(g(x), \varepsilon/3) meets Sm(x)S_m(x), so there is aUm(x)a \in U_m(x) with dY(g(x),f(a))<ε/3d_Y(g(x), f(a)) < \varepsilon/3; likewise there is aUm(x)a' \in U_m(x') with dY(g(x),f(a))<ε/3d_Y(g(x'), f(a')) < \varepsilon/3.

step 6.1step 1.4L2
8.1

Then dX(a,a)dX(a,x)+dX(x,x)+dX(x,a)<δ/3+δ/3+δ/3=δd_X(a,a') \le d_X(a,x) + d_X(x,x') + d_X(x',a') < \delta/3 + \delta/3 + \delta/3 = \delta, so dY(f(a),f(a))<ε/3d_Y(f(a),f(a')) < \varepsilon/3, and therefore dY(g(x),g(x))dY(g(x),f(a))+dY(f(a),f(a))+dY(f(a),g(x))<εd_Y(g(x),g(x')) \le d_Y(g(x),f(a)) + d_Y(f(a),f(a')) + d_Y(f(a'),g(x')) < \varepsilon.

step 1.4step 7.2A2L7
9.1

The real δ\delta' depended on ε\varepsilon alone, so gg is uniformly continuous; together with step 7.1 this establishes claim 1.

step 7.1step 1.4step 8.1
10.1

The map gg is continuous, being uniformly continuous, so g(ak)g(x)g(a_k) \to g(x) and h(ak)h(x)h(a_k) \to h(x); but g(ak)=f(ak)=h(ak)g(a_k) = f(a_k) = h(a_k) for every kk, so one sequence in YY converges to both g(x)g(x) and h(x)h(x), whence g(x)=h(x)g(x) = h(x) by uniqueness of limits. As xx was arbitrary, h=gh = g.

step 7.1step 9.1step 1.5L6
11.1

The map gg of step 6.1 is a uniformly continuous extension of ff and is the only continuous one, which is claims 1 and 2.

step 9.1step 10.1discharge-construct

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 119 results over 17 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