Alphabeta Math
ExampleConstruction: 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.

C([0,1],R)C([0,1], \mathbb{R}) is complete, and on it the uniform metric and the supremum metric induce the same topology

Example

Let I:=[0,1]I := [0,1] carry 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) and let R\mathbb{R} carry the same metric. Write C(I,R)C(I,\mathbb{R}) for the continuous real functions on II, ρˉ\bar\rho for the uniform metric 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} and dd_\infty for 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. Then:

  1. every fC(I,R)f \in C(I,\mathbb{R}) is bounded, so dd_\infty is defined on C(I,R)C(I,\mathbb{R});
  2. ρˉ\bar\rho and dd_\infty are uniformly equivalent on C(I,R)C(I,\mathbb{R}), hence induce the same topology there (Topologically, uniformly and Lipschitz equivalent metrics on a set, Lipschitz equivalence implies uniform equivalence implies topological equivalence);
  3. (C(I,R),ρˉ)\big(C(I,\mathbb{R}), \bar\rho\big) is a complete metric space (Complete metric space: every Cauchy sequence converges in the space).

Claim 2 is this page's guarantee that no second notion of convergence has been created. 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 a metric on YXY^{X} that is not the published supremum metric — it truncates distances at 11 and needs no boundedness hypothesis — and a reader who has met dd_\infty first is entitled to ask whether "uniform convergence" now means two things. On the set where both are defined it does not: the two metrics take different values but have the same open sets, so they have the same convergent sequences, the same continuous functions and the same closed sets.

Facts & Assumptions

Given: I=[0,1]I = [0,1] with d(s,t)=std(s,t) = |s-t|, the target R\mathbb{R} with the same metric, C(I,R)C(I,\mathbb{R}), the truncated metric dˉ=min{d,1}\bar d = \min\{d,1\} on R\mathbb{R}, the uniform metric ρˉ\bar\rho and, once claim 1 is available, the supremum metric d(f,g)=suptIf(t)g(t)d_\infty(f,g) = \sup_{t \in I} |f(t)-g(t)|.

[L2]

A continuous real function on a nonempty compact metric space is bounded and attains a greatest and a least value (A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value, Lower bound, bounded below, bounded set).

[L3]

d(f,g)=sup{f(t)g(t):tI}d_\infty(f,g) = \sup\{\, |f(t)-g(t)| : t \in I \,\} is a metric on the bounded real functions on a nonempty set, and the supremum is an upper bound of its set and the least one (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, Complete ordered field (least-upper-bound property), Suprema and infima are unique).

[L4]

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); ρˉ(f,g)=sup{dˉ(f(t),g(t)):tI}\bar\rho(f,g) = \sup\{\, \bar d(f(t),g(t)) : t \in I \,\} is an upper bound of that set and the least one (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).

[L5]

Uniform equivalence of two metrics on one set, and the implication uniform \Rightarrow topological (Topologically, uniformly and Lipschitz equivalent metrics on a set, Lipschitz equivalence implies uniform equivalence implies topological equivalence, claim 2).

Verification

technique · direct
1.1

II is nonempty and compact, and every fC(I,R)f \in C(I,\mathbb{R}) is continuous on it, hence bounded; so C(I,R)C(I,\mathbb{R}) is a subset of the bounded real functions on II and dd_\infty is defined on it, which is claim 1.

L1L2L3
2.1

For all f,gC(I,R)f, g \in C(I,\mathbb{R}) and every tIt \in I: dˉ(f(t),g(t))f(t)g(t)d(f,g)\bar d(f(t),g(t)) \le |f(t)-g(t)| \le d_\infty(f,g), so d(f,g)d_\infty(f,g) bounds the set whose supremum is ρˉ(f,g)\bar\rho(f,g) and therefore ρˉ(f,g)d(f,g)\bar\rho(f,g) \le d_\infty(f,g).

step 1.1L3L4
3.1

Let ε>0\varepsilon > 0 be real and put δ:=min{ε,1}/2\delta := \min\{\varepsilon, 1\}/2, a real with 0<δ1/2<10 < \delta \le 1/2 < 1 and δ<ε\delta < \varepsilon; if ρˉ(f,g)<δ\bar\rho(f,g) < \delta then for every tIt \in I we have dˉ(f(t),g(t))ρˉ(f,g)<δ<1\bar d(f(t),g(t)) \le \bar\rho(f,g) < \delta < 1, hence f(t)g(t)=dˉ(f(t),g(t))<δ|f(t)-g(t)| = \bar d(f(t),g(t)) < \delta, so δ\delta bounds the set whose supremum is d(f,g)d_\infty(f,g) and d(f,g)δ<εd_\infty(f,g) \le \delta < \varepsilon.

step 2.1L3L4
4.1

Steps 2.1 and 3.1 give uniform equivalence: for a real ε>0\varepsilon > 0 the choice δ:=ε\delta' := \varepsilon makes d(f,g)<δd_\infty(f,g) < \delta' imply ρˉ(f,g)<ε\bar\rho(f,g) < \varepsilon, and the δ\delta of step 3.1 makes ρˉ(f,g)<δ\bar\rho(f,g) < \delta imply d(f,g)<εd_\infty(f,g) < \varepsilon; hence the two metrics are uniformly equivalent on C(I,R)C(I,\mathbb{R}) and therefore topologically equivalent, which is claim 2.

step 2.1step 3.1L5
5.1

(R,d)(\mathbb{R},d) is complete and II is a nonempty topological space, so C(I,R)C(I,\mathbb{R}) with the restriction of ρˉ\bar\rho is a complete metric space, which is claim 3.

step 1.1L1L6

Remarks

  • The two metrics really are different functions. Take ff constant 00 and gg constant 22: then d(f,g)=2d_\infty(f,g) = 2 while ρˉ(f,g)=1\bar\rho(f,g) = 1. What claim 2 says is that this difference is invisible to the topology, not that it does not exist. In particular an assertion about the value of the distance — a diameter, a Lipschitz constant, a radius — must name which metric it means.

  • Completeness is inherited from R\mathbb{R} and from closedness, in that order. R\mathbb{R} is complete, so all the real functions on II are complete in the uniform metric; the continuous ones form a closed subset by the uniform limit theorem (A uniform limit of continuous functions is continuous, so C(X,Y)C(X,Y) is closed in YXY^{X} under the uniform metric); and a closed subset of a complete space is complete. Completeness in dd_\infty follows as well, since uniformly equivalent metrics have the same Cauchy sequences and the same convergent sequences, both conditions being expressed with ε\varepsilon and δ\delta alone.

  • Compactness of II is used only for claim 1. Boundedness of every continuous function is what makes dd_\infty defined at all, and that is the extreme value theorem. On a non-compact domain the supremum metric is unavailable on all of C(X,R)C(X,\mathbb{R}), while the uniform metric ρˉ\bar\rho remains defined; that is the whole reason this page mints the truncated metric.

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: 168 results over 33 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