Alphabeta Math
False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck 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+1−xk∣→0 then (xk) is Cauchy

Statement

False claim: if (xk) is a sequence of reals whose consecutive differences tend to 0, that is ∣xk+1−xk∣→0 (Sequences of reals: bounded, eventually, frequently, tails, subsequences, Limits and Cauchy sequences of reals), then (xk) is Cauchy.

The claim is the tempting misreading of the Cauchy condition. Being Cauchy requires ∣xm−xk∣ to be small for all large m and k; the hypothesis above controls only the case m=k+1, and finitely many small steps still accumulate without bound.

The witness is xk=k, refuted below and recorded separately as the named counterexample of the companion page. Its consecutive differences are k+1−k=1/(k+1+k), which tend to 0, 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 ∣x−xk∣≤ck−1∣x2−x1∣/(1−c) for k≥1: if the differences shrink geometrically, with a single ratio c<1 working at every index (Contractive sequence: ∣xk+2−xk+1∣≤c ∣xk+1−xk∣ for a fixed 0<c<1), then the sequence is Cauchy. The gap between the two hypotheses is exactly the uniform ratio.

Facts & Assumptions

Given: The sequence (xk) of reals with xk:=k, where k denotes the canonical natural k⋅1R and ⋅ the nonnegative square root (Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L1]

Square roots: every a≥0 has a unique s≥0 with s2=a, written a (Square roots exist: a unique a≥0 with (a)2=a; the positives are {x2:x≠0}, Integer powers am).

[L2]

Powers and order: for a,b≥0 and n≥1, a<b exactly when an<bn, and a≤b exactly when an≤bn; and a≥0 gives an≥0 (Monotonicity of x↦xn and of n↦an).

[L3]

Factorisation at n=2: b2−a2=(b−a)(b+a) (Factorisation of bn−an, and the resulting Lipschitz estimate); and (uv)n=unvn, so (1/t)2=1/t2 for t≠0 (Laws of integer exponents).

[L4]

Canonical naturals: n⋅1R>0 for n≥1, 0⋅1R=0, and m↦m⋅1R is strictly increasing (Canonical naturals are positive and strictly increasing).

[L5]

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

[L6]

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

[L7]

Absolute value: ∣t∣≥0, ∣t∣≥t, and ∣t∣=t for t≥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 0, boundedness, and the Cauchy condition; it suffices to test a real ε>0 (Limits and Cauchy sequences of reals, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L11]

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

Refutation

technique · direct
1.1

Each xk=k is defined and ≥0, since the canonical natural k satisfies k≥0; and xk+1>0 for every k, since k+1≥1 gives k+1>0 and hence k+1>0.

givenL1L2L4
1.2

(xk) is not bounded. Let M∈R and put M′:=∣M∣≥M, so M′≥0. By [L6] fix a natural n≥1 with (M′)2<n. Then (xn)2=n>(M′)2 with xn≥0 and M′≥0, so xn>M′≥M, and ∣xn∣=xn>M.

givenL1L2L4L6L7
2.1

For every k: (k+1−k)(k+1+k)=(k+1)2−(k)2=(k+1)−k=1, and k+1+k≥k+1>0, so k+1−k=1/(k+1+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 M bounds (∣xk∣), so (xk) is not Cauchy.

step 1.2L8L9L10
3.1

Hence ∣xk+1−xk∣=k+1−k=1/(k+1+k)≤1/k+1, the last inequality because 0<k+1≤k+1+k.

step 2.1L5L7
4.1

Let ε>0 be real. By [L6] fix a natural n≥1 with 1/n<ε2. For every k≥n we have k+1>n>0, so 1/(k+1)<1/n<ε2.

step 3.1L4L5L6choose
5.1

Taking square roots in step 4.1: (1/k+1)2=1/(k+1)<ε2 with both 1/k+1≥0 and ε>0, so 1/k+1<ε, and therefore ∣xk+1−xk∣<ε for every k≥n.

step 3.1step 4.1L2L3L5
6.1

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

step 5.1L9L11
7.1

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

step 6.1step 2.2L11∎

Remarks

Depends on

Used by

Dependency tree · two levels

56 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