Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: 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.

On the positive integers the metrics mn|m-n| and 1/m1/n|1/m - 1/n| both induce the discrete topology, and only the first is complete

Statement refuted

Refuted claim: completeness is determined by the topology, so topologically equivalent metrics are either both complete or both incomplete (FALSE: completeness of a metric space is determined by its topology, Topologically, uniformly and Lipschitz equivalent metrics on a set).

Let P:={nN:n1}P := \{\, n \in \mathbb{N} : n \ge 1 \,\} be the positive integers, regarded inside R\mathbb{R} through the canonical embedding, and put

d(m,n):=mn,d(m,n):=1m1n(m,nP).d(m,n) := |m - n|, \qquad d'(m,n) := \Big|\tfrac{1}{m} - \tfrac{1}{n}\Big| \qquad (m,n \in P).

Then both are metrics on PP, both induce the discrete topology, so Td=Td\mathcal{T}_d = \mathcal{T}_{d'}; (P,d)(P,d) is complete and (P,d)(P,d') is not; and consequently dd and dd' are not uniformly equivalent either (Topologically, uniformly and Lipschitz equivalent metrics on a set).

Facts & Assumptions

Given: The set PP of positive integers inside R\mathbb{R}; the functions dd and dd' above; the sequence ak:=k+1a_k := k+1 in PP; a real ε>0\varepsilon > 0.

[L2]

Reciprocation is strictly decreasing on the positive reals, hence injective there (Inverses of positives are positive, and reciprocation reverses order).

[L3]
[L6]

Uniform equivalence of two metrics says exactly that both identity maps are uniformly continuous, and a uniformly continuous map sends Cauchy sequences to Cauchy sequences (Topologically, uniformly and Lipschitz equivalent metrics on a set, Uniform continuity of a map of metric spaces: one δ\delta serving every point, A uniformly continuous map sends Cauchy sequences to Cauchy sequences).

Counterexample

technique · direct
1.1

dd is a metric on PP, being the restriction of the usual metric of R\mathbb{R}; and dd' is a metric on PP, since it is the pullback of that metric along the injective map m1/mm \mapsto 1/m.

L1L2
2.1

The dd-topology is discrete: Bd(m,1/2)={m}B_d(m,1/2) = \{m\} for every mPm \in P, because d(m,n)=mn1>1/2d(m,n) = |m-n| \ge 1 > 1/2 for nmn \ne m; so every subset of PP is a union of open balls, hence open.

step 1.1L3L5
2.2

The dd'-topology is discrete as well. Fix mPm \in P and put r:=1/m1/(m+1)=1/(m(m+1))>0r := 1/m - 1/(m+1) = 1/(m(m+1)) > 0. If n>mn > m then 1/n1/(m+1)1/n \le 1/(m+1), so d(m,n)=1/m1/nrd'(m,n) = 1/m - 1/n \ge r; if n<mn < m then m2m \ge 2 and 1/n1/(m1)1/n \ge 1/(m-1), so d(m,n)=1/n1/m1/(m1)1/m=1/(m(m1))>rd'(m,n) = 1/n - 1/m \ge 1/(m-1) - 1/m = 1/(m(m-1)) > r. Hence Bd(m,r)={m}B_{d'}(m,r) = \{m\} and every subset of PP is dd'-open.

step 1.1L2L5
2.3

(P,d)(P,d) is complete: a dd-Cauchy sequence tested at ε=1\varepsilon = 1 has an index KK with xkxl<1|x_k - x_l| < 1 for all k,lKk,l \ge K, which by [L3] forces xk=xlx_k = x_l; so the sequence is constant from KK on and converges in PP.

step 1.1L3L5
2.4

The sequence ak=k+1a_k = k+1 is dd'-Cauchy: given a real ε>0\varepsilon > 0, take N1N \ge 1 with 1/N<ε/21/N < \varepsilon/2; for k,lNk,l \ge N we have k+1>Nk+1 > N and l+1>Nl+1 > N, so d(ak,al)1/(k+1)+1/(l+1)<2/N<εd'(a_k,a_l) \le 1/(k+1) + 1/(l+1) < 2/N < \varepsilon.

step 1.1L2L4L5
3.1

Therefore Td=Td\mathcal{T}_d = \mathcal{T}_{d'}: both are the collection of all subsets of PP, so dd and dd' are topologically equivalent.

step 2.1step 2.2L5
3.2

It has no dd'-limit in PP: if pPp \in P then 1/p>01/p > 0, and taking N1N \ge 1 with 1/N<1/(2p)1/N < 1/(2p) gives, for every kNk \ge N, 1/(k+1)<1/N<1/(2p)1/(k+1) < 1/N < 1/(2p) and hence d(ak,p)=1/(k+1)1/p1/p1/(k+1)>1/(2p)>0d'(a_k,p) = |1/(k+1) - 1/p| \ge 1/p - 1/(k+1) > 1/(2p) > 0; so from no index on is d(ak,p)d'(a_k,p) below 1/(2p)1/(2p), and ak↛pa_k \not\to p. Hence (P,d)(P,d') is not complete.

step 2.4L2L4L5
3.3

The same sequence is not dd-Cauchy, since d(aK,aK+1)=1d(a_K, a_{K+1}) = 1 for every KK; so if dd and dd' were uniformly equivalent, the identity map (P,d)(P,d)(P,d') \to (P,d) would be uniformly continuous and would carry the dd'-Cauchy sequence (ak)(a_k) to a dd-Cauchy sequence, which it is not. Hence dd and dd' are not uniformly equivalent.

step 2.4L3L6
4.1

So dd and dd' are topologically equivalent metrics on one set of which exactly one is complete, which refutes the claim above; and step 3.3 locates the reason, namely that topological equivalence is strictly weaker than uniform equivalence.

step 3.1step 2.3step 3.2step 3.3

Remarks

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: 104 results over 31 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