Alphabeta Math
TheoremStatement: AI-adaptedProof: 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 0≤ak≤bk eventually, convergence of ∑bk gives convergence of ∑ak, and divergence of ∑ak gives divergence of ∑bk

Statement

Let (ak) and (bk) be sequences of reals and suppose there is K∈N with

0  ≤  ak  ≤  bkfor all k≥K.

Then:

  1. if ∑bk converges then ∑ak converges (Series, partial sums, convergence and the sum, divergence, and the tail series);
  2. if ∑ak diverges then ∑bk diverges.

The same statement holds verbatim for series with a general starting index m, 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 (ak) from that index on.

Facts & Assumptions

Given: Sequences (ak), (bk) of reals and K∈N with 0≤ak≤bk for all k≥K; the partial sums αj=∑i<jaK+i and βj=∑i<jbK+i of the K-th tail series (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion).

[L1]

Monotonicity of finite sums: if xi≤yi for all i<j then ∑i<jxi≤∑i<jyi (Laws of finite sums and finite products).

[L2]
[L3]

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

technique · direct
1.1

For every i∈N the index K+i is at least K, so 0≤aK+i≤bK+i; in particular both tail series have nonnegative terms.

given
1.2

Assume ∑bk converges. Then its K-th tail series ∑k≥Kbk converges.

givenL2
2.1

By monotonicity of finite sums, αj≤βj for every j∈N.

step 1.1L1
2.2

That tail series has nonnegative terms, so its partial sums satisfy βj≤B for every j, where B is its sum.

step 1.2step 1.1L3
3.1

Hence αj≤βj≤B for every j, so the range of (αj) is bounded above by B.

step 2.1step 2.2
4.1

The tail series ∑k≥Kak has nonnegative terms and partial sums bounded above, so it converges.

step 3.1step 1.1L3
5.1

Therefore ∑ak converges, which is claim 1.

step 4.1L2
6.1

Claim 2 is the contrapositive of claim 1: if ∑ak diverges then ∑bk cannot converge.

step 5.1∎

Remarks

  • Both nonnegativity hypotheses are used, and in different places. ak≥0 is what lets convergence of ∑k≥Kak be read off from boundedness of its partial sums, and bk≥ak≥0 is what makes the sum of ∑k≥Kbk an upper bound for the partial sums βj. Drop the sign hypothesis and the theorem is false, not merely unproved; the companion page exhibits a pair with ak≤bk for every k, ∑bk convergent and ∑ak divergent.

  • The comparison is with a series, not with a limit. No quotient ak/bk appears and no bk is required to be nonzero, which is what distinguishes this test from the limit comparison test proved next.

Depends on

Used by

Dependency tree · two levels

30 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