Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

If a series converges then its terms tend to 0

Statement

Let (ak) be a sequence of reals. If the series ∑ak converges (Series, partial sums, convergence and the sum, divergence, and the tail series) then the sequence (ak) converges (Limits and Cauchy sequences of reals), with

lim⁡kak  =  0.

Equivalently, in the contrapositive form in which the lemma is almost always used: if (ak) does not converge to 0 then ∑ak diverges.

The same statement holds for a series ∑k≥mak with a general starting index, with the conclusion that (aj+m)j∈N converges to 0: that series is by definition the series of the sequence bj=aj+m (Series, partial sums, convergence and the sum, divergence, and the tail series), so it is the statement above applied to (bj).

The converse is false; it is refuted by FALSE: if ak→0 then ∑ak converges.

Facts & Assumptions

Given: A sequence (ak) of reals whose series converges, with partial sums sn=∑k<nak (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).

[L1]

The recursion clause of the finite sum: sn+1=sn+an for every n∈N (Finite sums and finite products, by recursion, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L2]

Convergence depends only on the tail: if (xn) converges to x then so does its 1-st tail (xn+1)n (Convergence depends only on the tail, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L3]

Algebra of limits: if xn→x and yn→y then xn−yn→x−y (Algebra of limits: sums, scalar multiples, products and quotients).

Proof

technique · direct
1.1

The sequence (sn+1)n∈N is the 1-st tail of (sn), and it converges to S.

A1L2
1.2

From the recursion clause, an=sn+1−sn for every n∈N.

L1algebra
2.1

Hence (an) is the difference of two sequences converging to S, so it converges to S−S=0.

step 1.1step 1.2A1L3
3.1

That is the claim, and its contrapositive is the assertion that a series whose terms do not tend to 0 diverges.

step 2.1∎

Remarks

  • This is a necessary condition and never a sufficient one. It rules a series out; it never rules one in. The harmonic series has terms tending to 0 and diverges, which is exactly the content of FALSE: if ak→0 then ∑ak converges.

  • What the proof actually uses. Only that the partial sums converge and that consecutive partial sums differ by a term. No sign hypothesis is placed on (ak), and none is available at this point on the page.

Depends on

Used by

Dependency tree · two levels

35 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