Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

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

Statement

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) and define, for x,yXx, y \in X,

d(x,y):=min{d(x,y), 1},d(x,y):=d(x,y)1+d(x,y).d'(x,y) := \min\{\, d(x,y),\ 1 \,\}, \qquad d''(x,y) := \frac{d(x,y)}{1 + d(x,y)} .

Both are well defined: d(x,y)0d(x,y) \ge 0 (Nonnegativity of a metric is a consequence of the other axioms, not an axiom), so 1+d(x,y)>01 + d(x,y) > 0 and is invertible, and the minimum of a two-element set of reals exists (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set). Then:

  1. dd' and dd'' are metrics on XX.
  2. d(x,y)1d'(x,y) \le 1 and d(x,y)<1d''(x,y) < 1 for all x,yx,y; hence (X,d)(X,d') and (X,d)(X,d'') are bounded metric spaces (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space), and if XX \ne \emptyset then diam(X)1\operatorname{diam}(X) \le 1 for both.
  3. dd' and dd'' are each uniformly equivalent to dd, hence topologically equivalent to it (Topologically, uniformly and Lipschitz equivalent metrics on a set, Lipschitz equivalence implies uniform equivalence implies topological equivalence).

Consequently every metric space carries a bounded metric with exactly the same topology, so boundedness cannot be read off the topology alone.

Facts & Assumptions

Given: A metric space (X,d)(X,d), points x,y,zXx, y, z \in X, a real ε>0\varepsilon > 0, and the two functions φ1(t):=min{t,1}\varphi_1(t) := \min\{t, 1\} and φ2(t):=t(1+t)1\varphi_2(t) := t(1+t)^{-1}, defined for reals t0t \ge 0, so that d=φ1dd' = \varphi_1 \circ d and d=φ2dd'' = \varphi_2 \circ d.

[L2]

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

[L3]

0<10 < 1 (The multiplicative identity is positive); a sum of positives is positive and inequalities may be added, 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, in the nonstrict form (Ordered field, Complete ordered field (least-upper-bound property)).

[L4]

Inverses and order: u>0u > 0 gives u1>0u^{-1} > 0, and 0<u<v0 < u < v gives 0<v1<u10 < v^{-1} < u^{-1} (Inverses of positives are positive, and reciprocation reverses order); Inverses of positives are positive, and reciprocation reverses order states only those strict forms, so the nonstrict version used below, that 0<uv0 < u \le v gives 0<v1u10 < v^{-1} \le u^{-1}, is that statement together with the case u=vu = v, in which the two inverses are equal, the order being total (Ordered field, Complete ordered field (least-upper-bound property)). Multiplying an inequality by a positive preserves it, in the strict form of Sign rules for products and monotonicity of multiplication and, with the same equality case, in the nonstrict form; and uu1=1u u^{-1} = 1 (Field).

[L5]

Bounded subset and diameter: AA is bounded when it lies in some ball, and for nonempty bounded AA the diameter is the least upper bound of the distances, so any upper bound of those distances bounds the diameter (Bounded subset, diameter, distance from a point to a set, and distance between two sets in a metric space, Open ball, closed ball and sphere in a metric space, Suprema and infima are unique).

Proof

technique · direct
1.1

Properties of φ1\varphi_1 on t0t \ge 0: it is one of tt and 11, so 0φ1(t)t0 \le \varphi_1(t) \le t and φ1(t)1\varphi_1(t) \le 1; φ1(t)=0\varphi_1(t) = 0 exactly when t=0t = 0, since 101 \ne 0; it is nondecreasing, because for 0st0 \le s \le t the value φ1(s)\varphi_1(s) is sts \le t or 11, and in both cases it is a lower bound of {t,1}\{t,1\}, hence at most φ1(t)\varphi_1(t); and it is subadditive, since for s,t0s, t \ge 0 either one of s,ts, t is 1\ge 1, and then φ1(s)+φ1(t)1φ1(s+t)\varphi_1(s) + \varphi_1(t) \ge 1 \ge \varphi_1(s+t), or both are <1< 1, and then φ1(s)+φ1(t)=s+tφ1(s+t)\varphi_1(s) + \varphi_1(t) = s + t \ge \varphi_1(s+t).

L2L3
1.2

Properties of φ2\varphi_2 on t0t \ge 0: here 1+t1>01 + t \ge 1 > 0, so (1+t)1>0(1+t)^{-1} > 0 and (1+t)11(1+t)^{-1} \le 1, whence 0φ2(t)t0 \le \varphi_2(t) \le t; also t<1+tt < 1 + t gives φ2(t)<(1+t)(1+t)1=1\varphi_2(t) < (1+t)(1+t)^{-1} = 1; φ2(t)=0\varphi_2(t) = 0 exactly when t=0t = 0; φ2\varphi_2 is strictly increasing, because φ2(t)=1(1+t)1\varphi_2(t) = 1 - (1+t)^{-1} and 0s<t0 \le s < t gives 0<1+s<1+t0 < 1+s < 1+t, hence (1+t)1<(1+s)1(1+t)^{-1} < (1+s)^{-1}; and it is subadditive, since for s,t0s,t \ge 0 one has 0<1+s1+s+t0 < 1+s \le 1+s+t and 0<1+t1+s+t0 < 1+t \le 1+s+t, so φ2(s+t)=s(1+s+t)1+t(1+s+t)1s(1+s)1+t(1+t)1=φ2(s)+φ2(t)\varphi_2(s+t) = s(1+s+t)^{-1} + t(1+s+t)^{-1} \le s(1+s)^{-1} + t(1+t)^{-1} = \varphi_2(s) + \varphi_2(t).

L3L4
1.3

Both dd' and dd'' are symmetric, being φi\varphi_i applied to the symmetric function dd, and both vanish exactly on the diagonal, since φi(t)=0\varphi_i(t) = 0 exactly when t=0t = 0 and d(x,y)=0d(x,y) = 0 exactly when x=yx = y.

L1
2.1

dd' is a metric: (M1) and (M2) are step 1.3, and (M3) follows because d(x,z)d(x,y)+d(y,z)d(x,z) \le d(x,y) + d(y,z) with φ1\varphi_1 nondecreasing and subadditive on nonnegatives gives d(x,z)=φ1(d(x,z))φ1(d(x,y)+d(y,z))φ1(d(x,y))+φ1(d(y,z))=d(x,y)+d(y,z)d'(x,z) = \varphi_1(d(x,z)) \le \varphi_1(d(x,y) + d(y,z)) \le \varphi_1(d(x,y)) + \varphi_1(d(y,z)) = d'(x,y) + d'(y,z).

step 1.1step 1.3L1
2.2

dd'' is a metric: identically, using that φ2\varphi_2 is increasing and subadditive on nonnegatives, d(x,z)φ2(d(x,y)+d(y,z))d(x,y)+d(y,z)d''(x,z) \le \varphi_2(d(x,y) + d(y,z)) \le d''(x,y) + d''(y,z).

step 1.2step 1.3L1
2.3

Boundedness: d(x,y)1<2d'(x,y) \le 1 < 2 and d(x,y)<1<2d''(x,y) < 1 < 2 for all x,yx,y, so if XX \ne \emptyset then fixing any x0Xx_0 \in X gives XBd(x0,2)X \subseteq B_{d'}(x_0,2) and XBd(x0,2)X \subseteq B_{d''}(x_0,2), while X=X = \emptyset is bounded outright; and 11 is an upper bound of all the distances, so diam(X)1\operatorname{diam}(X) \le 1 in both metrics when XX \ne \emptyset. This is claim 2.

step 1.1step 1.2L3L5
3.1

dd' is uniformly equivalent to dd: given ε>0\varepsilon > 0, take δ:=ε\delta := \varepsilon, so that d(x,y)<δd(x,y) < \delta gives d(x,y)d(x,y)<εd'(x,y) \le d(x,y) < \varepsilon; and take δ:=min{ε,1}>0\delta' := \min\{\varepsilon, 1\} > 0, so that d(x,y)<δ1d'(x,y) < \delta' \le 1 forces φ1(d(x,y))1\varphi_1(d(x,y)) \ne 1, hence d(x,y)=d(x,y)d'(x,y) = d(x,y) by [L2], hence d(x,y)<δεd(x,y) < \delta' \le \varepsilon.

step 1.1step 2.1L2L3
3.2

dd'' is uniformly equivalent to dd: given ε>0\varepsilon > 0, take δ:=ε\delta := \varepsilon, so that d(x,y)<δd(x,y) < \delta gives d(x,y)d(x,y)<εd''(x,y) \le d(x,y) < \varepsilon; and take δ:=φ2(ε)>0\delta' := \varphi_2(\varepsilon) > 0, so that d(x,y)<δd''(x,y) < \delta' forces d(x,y)<εd(x,y) < \varepsilon, since d(x,y)εd(x,y) \ge \varepsilon would give φ2(d(x,y))φ2(ε)=δ\varphi_2(d(x,y)) \ge \varphi_2(\varepsilon) = \delta' by monotonicity.

step 1.2step 2.2L4
4.1

Uniform equivalence implies topological equivalence, so dd' and dd'' have exactly the metric topology of dd; this completes claim 3.

step 3.1step 3.2L6
5.1

Claims 1, 2 and 3 hold by steps 2.1 and 2.2, step 2.3, and steps 3.1, 3.2 and 4.1; hence every metric space carries a bounded metric inducing the same topology.

step 2.1step 2.2step 2.3step 4.1

Remarks

  • Two constructions rather than one, on purpose. min{d,1}\min\{d,1\} is the shorter argument and is the one used by the counterexamples on the companion page; d/(1+d)d/(1+d) is strictly less than 11 everywhere and is strictly increasing in dd, which makes it the better behaved of the two when the value of the metric is to be compared, and it is the form that generalises to countable products.
  • Neither is Lipschitz equivalent to dd when dd is unbounded. A Lipschitz bound αdd\alpha d \le d' with α>0\alpha > 0 would force dα1d \le \alpha^{-1} everywhere, which fails as soon as dd takes arbitrarily large values; the real line is the witness (On R\mathbb{R} the metrics xy|x-y| and min(xy,1)\min(|x-y|,1) are uniformly but not Lipschitz equivalent ).
  • Boundedness is therefore not a topological property, which is recorded as FALSE: boundedness of a metric space is determined by its topology with the real line as witness.
  • The bound diam(X)1\operatorname{diam}(X) \le 1 need not be an equality, and the two constructions differ on when it is. For a one-point space both new metrics are identically 00. For d=min{d,1}d' = \min\{d,1\} the bound is attained as soon as dd takes some value 1\ge 1, since then dd' takes the value 11 itself, and the companion page computes one such case. For d=d/(1+d)d'' = d/(1+d) the value 11 is never taken at all, by claim 2, so on a space where dd is bounded the diameter in dd'' is strictly below 11: for instance on a two-point space with d=1d = 1 the new distance is 1/21/2.

Depends on

Used by

Dependency tree · next 3 levels

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