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

FALSE: every Cauchy sequence in a metric space converges

Statement

The following statement is FALSE.

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 let (xk)(x_k) be a Cauchy sequence in it (Cauchy sequence in a metric space). Then (xk)(x_k) converges to a point of XX (Convergence of a sequence in a metric space: xkxx_k \to x iff d(xk,x)0d(x_k, x) \to 0 in R\mathbb{R}).

Equivalently: every metric space is complete (Complete metric space: every Cauchy sequence converges in the space), so that the word complete is redundant.

This is the error that the whole page exists to guard against. It is encouraged by the Cauchy criterion on the real line (The Cauchy criterion from the least-upper-bound property: in a complete ordered field every Cauchy sequence converges), which is a theorem about R\mathbb{R} and not about metric spaces.

Facts & Assumptions

Given: The open interval X:=(0,1)RX := (0,1) \subseteq \mathbb{R} (Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length) with the metric d(x,y):=xyd(x,y) := |x-y| inherited from R\mathbb{R}; the sequence xk:=1/(k+2)x_k := 1/(k+2) for kNk \in \mathbb{N}; a real ε>0\varepsilon > 0.

[A1]

The false claim: every Cauchy sequence in every metric space converges in that space.

[L2]

For every real η>0\eta > 0 there is a natural N1N \ge 1 with 1/N<η1/N < \eta; and 0<a<b0 < a < b gives 0<1/b<1/a0 < 1/b < 1/a (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, Inverses of positives are positive, and reciprocation reverses order).

[L4]

Limits in a metric space are unique (A sequence in a metric space has at most one limit).

Refutation

technique · direct
1.1

Every term lies in XX: k+22>0k + 2 \ge 2 > 0 gives xk=1/(k+2)>0x_k = 1/(k+2) > 0, and k+22k+2 \ge 2 gives xk1/2<1x_k \le 1/2 < 1. So (xk)(x_k) is a sequence in XX, and dd is a metric on XX.

L1L2
1.2

xk0x_k \to 0 in (R,)(\mathbb{R}, |\cdot|): given a real ε>0\varepsilon > 0, [L2] supplies N1N \ge 1 with 1/N<ε1/N < \varepsilon, and for kNk \ge N we have k+2>Nk + 2 > N, hence xk0=1/(k+2)<1/N<ε|x_k - 0| = 1/(k+2) < 1/N < \varepsilon.

L1L2L3
2.1

Hence (xk)(x_k) is Cauchy in (R,)(\mathbb{R}, |\cdot|), and since dd is the restriction of the metric of R\mathbb{R} and all terms lie in XX, the same indices witness that (xk)(x_k) is Cauchy in (X,d)(X,d).

step 1.1step 1.2L1L3
2.2

Suppose (xk)(x_k) converged in (X,d)(X,d) to some pXp \in X. Distances in (X,d)(X,d) are distances in R\mathbb{R}, so xkpx_k \to p in (R,)(\mathbb{R},|\cdot|) as well; with step 1.2 and uniqueness of limits in R\mathbb{R} this forces p=0p = 0.

step 1.2L1L4
3.1

But 0X0 \notin X, since X=(0,1)X = (0,1) contains only reals >0> 0. So (xk)(x_k) has no limit in (X,d)(X,d).

step 1.1step 2.2
4.1

Therefore (X,d)(X,d) is a metric space carrying a Cauchy sequence that does not converge in it, which refutes [A1]; the displayed statement is false, and (0,1)(0,1) is not complete.

step 2.1step 3.1A1

Remarks

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 122 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