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 eventually, convergence of gives convergence of , and divergence of gives divergence of
Statement
Let and be sequences of reals and suppose there is with
Then:
- if converges then converges (Series, partial sums, convergence and the sum, divergence, and the tail series);
- if diverges then diverges.
The same statement holds verbatim for series with a general starting index , applied to the shifted sequences of Series, partial sums, convergence and the sum, divergence, and the tail series.
The hypothesis is on the terms from some index on, not on all of them: finitely many terms of either sequence may violate it, or be negative, without affecting the conclusion. What may not be dropped is nonnegativity of from that index on.
Facts & Assumptions
Given: Sequences , of reals and with for all ; the partial sums and of the -th tail series (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).
Monotonicity of finite sums: if for all then (Laws of finite sums and finite products).
A series converges if and only if its -th tail series converges (A series converges iff each of its tail series converges, and the sum splits as plus the -th tail).
For a series of nonnegative terms: it converges if and only if the range of its partial sums is bounded above, and in the convergent case every partial sum is at most the sum (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Lower bound, bounded below, bounded set).
Proof
For every the index is at least , so ; in particular both tail series have nonnegative terms.
Assume converges. Then its -th tail series converges.
By monotonicity of finite sums, for every .
That tail series has nonnegative terms, so its partial sums satisfy for every , where is its sum.
Hence for every , so the range of is bounded above by .
The tail series has nonnegative terms and partial sums bounded above, so it converges.
Therefore converges, which is claim 1.
Claim 2 is the contrapositive of claim 1: if diverges then cannot converge.
Remarks
-
Both nonnegativity hypotheses are used, and in different places. is what lets convergence of be read off from boundedness of its partial sums, and is what makes the sum of an upper bound for the partial sums . Drop the sign hypothesis and the theorem is false, not merely unproved; the companion page exhibits a pair with for every , convergent and divergent.
-
The comparison is with a series, not with a limit. No quotient appears and no is required to be nonzero, which is what distinguishes this test from the limit comparison test proved next.
Depends on
A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum
A series converges iff each of its tail series converges, and the sum splits as plus the -th tail
Series, partial sums, convergence and the sum, divergence, and the tail series
Laws of finite sums and finite products
Lower bound, bounded below, bounded set
Finite sums and finite products, by recursion