Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 0akbk0 \le a_k \le b_k eventually, convergence of bk\sum b_k gives convergence of ak\sum a_k, and divergence of ak\sum a_k gives divergence of bk\sum b_k

Statement

Let (ak)(a_k) and (bk)(b_k) be sequences of reals and suppose there is KNK \in \mathbb{N} with

0    ak    bkfor all kK.0 \;\le\; a_k \;\le\; b_k \qquad \text{for all } k \ge K .

Then:

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

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

Facts & Assumptions

Given: Sequences (ak)(a_k), (bk)(b_k) of reals and KNK \in \mathbb{N} with 0akbk0 \le a_k \le b_k for all kKk \ge K; the partial sums αj=i<jaK+i\alpha_j = \sum_{i<j} a_{K+i} and βj=i<jbK+i\beta_j = \sum_{i<j} b_{K+i} of the KK-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 xiyix_i \le y_i for all i<ji < j then i<jxii<jyi\sum_{i<j} x_i \le \sum_{i<j} y_i (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 iNi \in \mathbb{N} the index K+iK + i is at least KK, so 0aK+ibK+i0 \le a_{K+i} \le b_{K+i}; in particular both tail series have nonnegative terms.

given
1.2

Assume bk\sum b_k converges. Then its KK-th tail series kKbk\sum_{k \ge K} b_k converges.

givenL2
2.1

By monotonicity of finite sums, αjβj\alpha_j \le \beta_j for every jNj \in \mathbb{N}.

step 1.1L1
2.2

That tail series has nonnegative terms, so its partial sums satisfy βjB\beta_j \le B for every jj, where BB is its sum.

step 1.2step 1.1L3
3.1

Hence αjβjB\alpha_j \le \beta_j \le B for every jj, so the range of (αj)(\alpha_j) is bounded above by BB.

step 2.1step 2.2
4.1

The tail series kKak\sum_{k \ge K} a_k has nonnegative terms and partial sums bounded above, so it converges.

step 3.1step 1.1L3
5.1

Therefore ak\sum a_k converges, which is claim 1.

step 4.1L2
6.1

Claim 2 is the contrapositive of claim 1: if ak\sum a_k diverges then bk\sum b_k cannot converge.

step 5.1

Remarks

  • Both nonnegativity hypotheses are used, and in different places. ak0a_k \ge 0 is what lets convergence of kKak\sum_{k \ge K} a_k be read off from boundedness of its partial sums, and bkak0b_k \ge a_k \ge 0 is what makes the sum of kKbk\sum_{k \ge K} b_k an upper bound for the partial sums βj\beta_j. Drop the sign hypothesis and the theorem is false, not merely unproved; the companion page exhibits a pair with akbka_k \le b_k for every kk, bk\sum b_k convergent and ak\sum a_k divergent.

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

Depends on

Used by

Dependency tree · next 3 levels

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