Alphabeta Math
CounterexampleConstruction: AI-adaptedVerification: AI-generatedprecheck 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 ∣m−n∣ and ∣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:={ n∈N:n≥1 } be the positive integers, regarded inside R through the canonical embedding, and put

d(m,n):=∣m−n∣,d′(m,n):=∣1m−1n∣(m,n∈P).

Then both are metrics on P, both induce the discrete topology, so Td=Td′; (P,d) is complete and (P,d′) is not; and consequently d and d′ are not uniformly equivalent either (Topologically, uniformly and Lipschitz equivalent metrics on a set).

Facts & Assumptions

Given: The set P of positive integers inside R; the functions d and d′ above; the sequence ak:=k+1 in P; a real ε>0.

[L2]

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

[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 δ serving every point, A uniformly continuous map sends Cauchy sequences to Cauchy sequences).

Counterexample

technique · direct
1.1L1L2

d is a metric on P, being the restriction of the usual metric of R; and d′ is a metric on P, since it is the pullback of that metric along the injective map m↦1/m.

2.1step 1.1L3L5

The d-topology is discrete: Bd(m,1/2)={m} for every m∈P, because d(m,n)=∣m−n∣≥1>1/2 for n≠m; so every subset of P is a union of open balls, hence open.

2.2step 1.1L2L5

The d′-topology is discrete as well. Fix m∈P and put r:=1/m−1/(m+1)=1/(m(m+1))>0. If n>m then 1/n≤1/(m+1), so d′(m,n)=1/m−1/n≥r; if n<m then m≥2 and 1/n≥1/(m−1), so d′(m,n)=1/n−1/m≥1/(m−1)−1/m=1/(m(m−1))>r. Hence Bd′(m,r)={m} and every subset of P is d′-open.

2.3step 1.1L3L5

(P,d) is complete: a d-Cauchy sequence tested at ε=1 has an index K with ∣xk−xl∣<1 for all k,l≥K, which by [L3] forces xk=xl; so the sequence is constant from K on and converges in P.

2.4step 1.1L2L4L5

The sequence ak=k+1 is d′-Cauchy: given a real ε>0, take N≥1 with 1/N<ε/2; for k,l≥N we have k+1>N and l+1>N, so d′(ak,al)≤1/(k+1)+1/(l+1)<2/N<ε.

3.1step 2.1step 2.2L5

Therefore Td=Td′: both are the collection of all subsets of P, so d and d′ are topologically equivalent.

3.2step 2.4L2L4L5

It has no d′-limit in P: if p∈P then 1/p>0, and taking N≥1 with 1/N<1/(2p) gives, for every k≥N, 1/(k+1)<1/N<1/(2p) and hence d′(ak,p)=∣1/(k+1)−1/p∣≥1/p−1/(k+1)>1/(2p)>0; so from no index on is d′(ak,p) below 1/(2p), and ak↛p. Hence (P,d′) is not complete.

3.3step 2.4L3L6

The same sequence is not d-Cauchy, since d(aK,aK+1)=1 for every K; so if d and d′ were uniformly equivalent, the identity map (P,d′)→(P,d) would be uniformly continuous and would carry the d′-Cauchy sequence (ak) to a d-Cauchy sequence, which it is not. Hence d and d′ are not uniformly equivalent.

4.1step 3.1step 2.3step 3.2step 3.3∎

So d and d′ 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.

Remarks

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

63 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources