Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-06 (claude-sonnet-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.

FALSE: if xk+1xk0|x_{k+1} - x_k| \to 0 then (xk)(x_k) is Cauchy

Statement

False claim: if (xk)(x_k) is a sequence of reals whose consecutive differences tend to 00, that is xk+1xk0|x_{k+1} - x_k| \to 0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals), then (xk)(x_k) is Cauchy.

The claim is the tempting misreading of the Cauchy condition. Being Cauchy requires xmxk|x_m - x_k| to be small for all large mm and kk; the hypothesis above controls only the case m=k+1m = k+1, and finitely many small steps still accumulate without bound.

The witness is xk=kx_k = \sqrt k, refuted below and recorded separately as the named counterexample of the companion page. Its consecutive differences are k+1k=1/(k+1+k)\sqrt{k+1} - \sqrt k = 1/(\sqrt{k+1} + \sqrt k), which tend to 00, while the sequence itself is unbounded and so cannot be Cauchy (Every Cauchy sequence of reals is bounded).

What is true in this direction is Every contractive sequence is Cauchy, hence converges, with error bound xxkck1x2x1/(1c)|x - x_k| \le c^{k-1}|x_2 - x_1|/(1-c) for k1k \ge 1: if the differences shrink geometrically, with a single ratio c<1c < 1 working at every index (Contractive sequence: xk+2xk+1cxk+1xk|x_{k+2} - x_{k+1}| \le c\,|x_{k+1} - x_k| for a fixed 0<c<10 < c < 1), then the sequence is Cauchy. The gap between the two hypotheses is exactly the uniform ratio.

Facts & Assumptions

Given: The sequence (xk)(x_k) of reals with xk:=kx_k := \sqrt{k}, where kk denotes the canonical natural k1Rk \cdot 1_{\mathbb{R}} and \sqrt{\cdot} the nonnegative square root (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L1]

Square roots: every a0a \ge 0 has a unique s0s \ge 0 with s2=as^2 = a, written a\sqrt a (Square roots exist: a unique a0\sqrt{a} \ge 0 with (a)2=a(\sqrt{a})^2 = a; the positives are {x2:x0}\{x^2 : x \neq 0\}, Integer powers ama^m).

[L2]

Powers and order: for a,b0a, b \ge 0 and n1n \ge 1, a<ba < b exactly when an<bna^n < b^n, and aba \le b exactly when anbna^n \le b^n; and a0a \ge 0 gives an0a^n \ge 0 (Monotonicity of xxnx \mapsto x^n and of nann \mapsto a^n).

[L3]

Factorisation at n=2n = 2: b2a2=(ba)(b+a)b^2 - a^2 = (b-a)(b+a) (Factorisation of bnanb^n - a^n, and the resulting Lipschitz estimate); and (uv)n=unvn(uv)^n = u^n v^n, so (1/t)2=1/t2(1/t)^2 = 1/t^2 for t0t \ne 0 (Laws of integer exponents).

[L4]

Canonical naturals: n1R>0n \cdot 1_{\mathbb{R}} > 0 for n1n \ge 1, 01R=00 \cdot 1_{\mathbb{R}} = 0, and mm1Rm \mapsto m \cdot 1_{\mathbb{R}} is strictly increasing (Canonical naturals are positive and strictly increasing).

[L5]

Reciprocals: a>0a > 0 gives 1/a>01/a > 0, and 0<a<b0 < a < b gives 0<1/b<1/a0 < 1/b < 1/a (Inverses of positives are positive, and reciprocation reverses order).

[L6]

Archimedean property, in both forms: for every real xx there is a natural n1n \ge 1 with x<nx < n, and for every real ε>0\varepsilon > 0 there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon (Every complete ordered field is Archimedean, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon).

[L7]

Absolute value: t0|t| \ge 0, tt|t| \ge t, and t=t|t| = t for t0t \ge 0 (Basic properties of the absolute value).

[L8]

Every Cauchy sequence of reals is bounded (Every Cauchy sequence of reals is bounded).

[L9]

Convergence to 00, boundedness, and the Cauchy condition; it suffices to test a real ε>0\varepsilon > 0 (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L10]

Trichotomy of the order on R\mathbb{R} (Complete ordered field (least-upper-bound property), Ordered field).

[L11]

The refuted claim: a sequence of reals whose consecutive differences tend to 00 is Cauchy.

Refutation

technique · direct
1.1

Each xk=kx_k = \sqrt k is defined and 0\ge 0, since the canonical natural kk satisfies k0k \ge 0; and xk+1>0x_{k+1} > 0 for every kk, since k+11k+1 \ge 1 gives k+1>0k + 1 > 0 and hence k+1>0\sqrt{k+1} > 0.

givenL1L2L4
1.2

(xk)(x_k) is not bounded. Let MRM \in \mathbb{R} and put M:=MMM' := |M| \ge M, so M0M' \ge 0. By [L6] fix a natural n1n \ge 1 with (M)2<n(M')^2 < n. Then (xn)2=n>(M)2(x_n)^2 = n > (M')^2 with xn0x_n \ge 0 and M0M' \ge 0, so xn>MMx_n > M' \ge M, and xn=xn>M|x_n| = x_n > M.

givenL1L2L4L6L7
2.1

For every kk: (k+1k)(k+1+k)=(k+1)2(k)2=(k+1)k=1(\sqrt{k+1} - \sqrt k)(\sqrt{k+1} + \sqrt k) = (\sqrt{k+1})^2 - (\sqrt k)^2 = (k+1) - k = 1, and k+1+kk+1>0\sqrt{k+1} + \sqrt k \ge \sqrt{k+1} > 0, so k+1k=1/(k+1+k)>0\sqrt{k+1} - \sqrt k = 1/(\sqrt{k+1} + \sqrt k) > 0.

step 1.1L1L3L5
2.2

A Cauchy sequence of reals is bounded, so an unbounded sequence is not Cauchy; by step 1.2 no real MM bounds (xk)(|x_k|), so (xk)(x_k) is not Cauchy.

step 1.2L8L9L10
3.1

Hence xk+1xk=k+1k=1/(k+1+k)1/k+1|x_{k+1} - x_k| = \sqrt{k+1} - \sqrt{k} = 1/(\sqrt{k+1}+\sqrt k) \le 1/\sqrt{k+1}, the last inequality because 0<k+1k+1+k0 < \sqrt{k+1} \le \sqrt{k+1} + \sqrt k.

step 2.1L5L7
4.1

Let ε>0\varepsilon > 0 be real. By [L6] fix a natural n1n \ge 1 with 1/n<ε21/n < \varepsilon^2. For every knk \ge n we have k+1>n>0k + 1 > n > 0, so 1/(k+1)<1/n<ε21/(k+1) < 1/n < \varepsilon^2.

step 3.1L4L5L6choose
5.1

Taking square roots in step 4.1: (1/k+1)2=1/(k+1)<ε2\big(1/\sqrt{k+1}\big)^2 = 1/(k+1) < \varepsilon^2 with both 1/k+101/\sqrt{k+1} \ge 0 and ε>0\varepsilon > 0, so 1/k+1<ε1/\sqrt{k+1} < \varepsilon, and therefore xk+1xk<ε|x_{k+1} - x_k| < \varepsilon for every knk \ge n.

step 3.1step 4.1L2L3L5
6.1

The real ε>0\varepsilon > 0 was arbitrary, so the consecutive differences of (xk)(x_k) tend to 00: the sequence satisfies the hypothesis of the claim.

step 5.1L9L11
7.1

The sequence xk=kx_k = \sqrt k therefore has consecutive differences tending to 00 and is not Cauchy: the claim is false.

step 6.1step 2.2L11

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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