Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passverified 2026-08-02 (claude-opus-5)
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.

On (0,)(0,\infty) the metrics xy|x-y| and 1/x1/y|1/x - 1/y| have the same topology and are not uniformly equivalent

Statement refuted

Refuted claim: topologically equivalent metrics are uniformly equivalent; equivalently, the implication "uniformly equivalent implies topologically equivalent" of Lipschitz equivalence implies uniform equivalence implies topological equivalence reverses.

Let X:=(0,)={tR:t>0}X := (0,\infty) = \{t \in \mathbb{R} : t > 0\} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) carry the metric d(x,y):=xyd(x,y) := |x-y| inherited from the real line (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 put

ρ(x,y):=1x1y(x,yX).\rho(x,y) := \Big|\tfrac{1}{x} - \tfrac{1}{y}\Big| \qquad (x, y \in X).

Then ρ\rho is a metric on XX, the two metrics are topologically equivalent, and they are not uniformly equivalent (Topologically, uniformly and Lipschitz equivalent metrics on a set). So the second implication of the hierarchy is strict.

Facts & Assumptions

Given: The set X=(0,)X = (0,\infty), the metrics dd and ρ\rho above, the map ι:XX\iota : X \to X with ι(x):=x1\iota(x) := x^{-1}, a point aXa \in X, a real ε>0\varepsilon > 0, and a real δ>0\delta > 0.

[L2]

Inverses: u>0u > 0 gives u1>0u^{-1} > 0 and (u1)1=u(u^{-1})^{-1} = u; and 0<u<v0 < u < v gives 0<v1<u10 < v^{-1} < u^{-1} (Inverses of positives are positive, and reciprocation reverses order, Field).

[L3]

Absolute value: uv=uv|uv| = |u||v|, u0|u| \ge 0, u=0|u| = 0 exactly when u=0u = 0, u=u|-u| = |u|, and u<c|u| < c is equivalent to c<u<c-c < u < c for c>0c > 0 (Basic properties of the absolute value, Absolute value in an ordered field).

[L4]

Order arithmetic: scaling a strict inequality by a positive element (Sign rules for products and monotonicity of multiplication), adding a constant to an inequality (Order is preserved by adding a constant and by adding inequalities), transitivity and trichotomy (Ordered field, Complete ordered field (least-upper-bound property)); 0<10 < 1 (The multiplicative identity is positive); halving a positive real; and the minimum of a two-element set of reals, which is one of the two (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L5]

Reciprocal Archimedean property: for every real t>0t > 0 there is a natural n1n \ge 1 with 1/n<t1/n < t (For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Every complete ordered field is Archimedean); and n1R>0n \cdot 1_{\mathbb{R}} > 0 for n1n \ge 1 (Canonical naturals are positive and strictly increasing, The natural numbers N\mathbb{N} (von Neumann)).

Counterexample

technique · direct
1.1

The map ι\iota is a well defined bijection of XX onto itself with ιι=idX\iota \circ \iota = \mathrm{id}_X, since x>0x > 0 gives x1>0x^{-1} > 0 and (x1)1=x(x^{-1})^{-1} = x; and for x,yXx, y \in X one has ρ(x,y)=d(ιx,ιy)\rho(x,y) = d(\iota x, \iota y) together with the identity ρ(x,y)=xy(xy)1\rho(x,y) = |x - y| \,(xy)^{-1}, because x1y1=(yx)(xy)1x^{-1} - y^{-1} = (y - x)(xy)^{-1} and yx=xy|y-x| = |x-y|.

L2L3L4
2.1

ρ\rho is a metric on XX: it inherits symmetry and the triangle inequality from dd through ι\iota, and ρ(x,y)=0\rho(x,y) = 0 gives d(ιx,ιy)=0d(\iota x, \iota y) = 0, hence ιx=ιy\iota x = \iota y and, ι\iota being injective, x=yx = y; conversely ρ(x,x)=0\rho(x,x) = 0.

step 1.1L1L2L3
2.2

Estimate A: put δA:=min{a/2, εa2/2}>0\delta_A := \min\{\, a/2,\ \varepsilon a^2/2 \,\} > 0. If xXx \in X and xa<δA|x - a| < \delta_A then x>aδAaa/2=a/2>0x > a - \delta_A \ge a - a/2 = a/2 > 0, so xa>a2/2>0xa > a^2/2 > 0 and (xa)1<2a2(xa)^{-1} < 2a^{-2}; hence ρ(x,a)=xa(xa)1<δA(xa)1<2δAa2ε\rho(x,a) = |x-a|(xa)^{-1} < \delta_A (xa)^{-1} < 2\delta_A a^{-2} \le \varepsilon when xax \ne a, and ρ(a,a)=0<ε\rho(a,a) = 0 < \varepsilon otherwise. So Bd(a,δA)Bρ(a,ε)B_d(a,\delta_A) \subseteq B_\rho(a,\varepsilon).

step 1.1L2L3L4
2.3

Uniform equivalence fails: suppose some δ>0\delta > 0 satisfied d(x,y)<δρ(x,y)<1d(x,y) < \delta \Rightarrow \rho(x,y) < 1 for all x,yXx, y \in X. Choose a natural n1n \ge 1 with 1/n<δ1/n < \delta and put x:=1/nx := 1/n, y:=1/(n+1)y := 1/(n+1), both in XX. Then d(x,y)=1/n1/(n+1)<1/n<δd(x,y) = |1/n - 1/(n+1)| < 1/n < \delta, because 0<1/(n+1)<1/n0 < 1/(n+1) < 1/n; but ρ(x,y)=n(n+1)=1=1\rho(x,y) = |n - (n+1)| = |-1| = 1, so ρ(x,y)<1\rho(x,y) < 1 fails. Hence no such δ\delta exists, and the pair d,ρd, \rho is not uniformly equivalent.

step 1.1L2L3L4L5L6
3.1

Estimate B: apply estimate A at the point ι(a)=a1X\iota(a) = a^{-1} \in X to get δB>0\delta_B > 0 with ua1<δBρ(u,a1)<ε|u - a^{-1}| < \delta_B \Rightarrow \rho(u, a^{-1}) < \varepsilon for uXu \in X; substituting u:=ι(x)=x1u := \iota(x) = x^{-1}, which runs over XX as xx does, and using ιι=idX\iota \circ \iota = \mathrm{id}_X, this reads ρ(x,a)<δBd(x,a)<ε\rho(x,a) < \delta_B \Rightarrow d(x,a) < \varepsilon, that is Bρ(a,δB)Bd(a,ε)B_\rho(a,\delta_B) \subseteq B_d(a,\varepsilon).

step 1.1step 2.2L2L3
4.1

Topological equivalence: if UU is ρ\rho-open and aUa \in U, take ε>0\varepsilon > 0 with Bρ(a,ε)UB_\rho(a,\varepsilon) \subseteq U and then δA\delta_A from step 2.2, so Bd(a,δA)UB_d(a,\delta_A) \subseteq U and UU is dd-open; if UU is dd-open and aUa \in U, take ε>0\varepsilon > 0 with Bd(a,ε)UB_d(a,\varepsilon) \subseteq U and then δB\delta_B from step 3.1, so Bρ(a,δB)UB_\rho(a,\delta_B) \subseteq U and UU is ρ\rho-open. Hence the two metric topologies coincide.

step 2.2step 3.1L6
5.1

So dd and ρ\rho are topologically equivalent metrics on XX that are not uniformly equivalent, which refutes the claim and shows that the implication from uniform to topological equivalence in Lipschitz equivalence implies uniform equivalence implies topological equivalence does not reverse.

step 2.1step 2.3step 4.1

Remarks

  • Why the failure is at the origin end. The pairs 1/n1/n and 1/(n+1)1/(n+1) get arbitrarily close in dd while their images nn and n+1n+1 under ι\iota stay a fixed distance apart. Uniform equivalence would have to control this with a single δ\delta, and no single δ\delta can, because ι\iota stretches by the unbounded factor (xy)1(xy)^{-1} near 00.
  • The two metrics are isometric copies of each other, via ι\iota: the map ι:(X,ρ)(X,d)\iota : (X,\rho) \to (X,d) satisfies d(ιx,ιy)=ρ(x,y)d(\iota x, \iota y) = \rho(x,y) by step 1.1, so the two spaces are isometric (Isometry, isometric embedding, and the subspace metric on a subset). Being isometric as spaces says nothing about the identity map being uniformly bicontinuous, and that is exactly the distinction this example draws.
  • Completeness is the usual casualty. Uniform equivalence preserves Cauchy sequences and topological equivalence does not; here the sequence 1/n1/n is Cauchy for dd and not for ρ\rho, since ρ(1/n,1/m)=nm\rho(1/n, 1/m) = |n - m|. Cauchy sequences in a metric space are defined on a later page and are not available here, so that comparison is orientation only and belongs to the completeness page.

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: 72 results over 24 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