Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passverified 2026-08-09 (gpt-5.6-terra-codex-subscription)
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.

For ak,bk>0a_k, b_k > 0 with ak/bkLa_k/b_k \to L: if L(0,)L \in (0,\infty) the two series share their behaviour, while L=0L = 0 and L=L = \infty give one implication each

Statement

Let (ak)(a_k) and (bk)(b_k) be sequences of reals with ak>0a_k > 0 and bk>0b_k > 0 for every kNk \in \mathbb{N}, and put qk:=ak/bkq_k := a_k / b_k. Then:

  1. if (qk)(q_k) converges with limkqk=L\lim_k q_k = L for a real L>0L > 0 (Limits and Cauchy sequences of reals), then ak\sum a_k converges if and only if bk\sum b_k converges;
  2. if (qk)(q_k) converges with limkqk=0\lim_k q_k = 0, then convergence of bk\sum b_k implies convergence of ak\sum a_k; equivalently, divergence of ak\sum a_k implies divergence of bk\sum b_k;
  3. if (qk)(q_k) diverges to ++\infty (Divergence to ++\infty and to -\infty), then convergence of ak\sum a_k implies convergence of bk\sum b_k; equivalently, divergence of bk\sum b_k implies divergence of ak\sum a_k.

In each clause the convergence of (qk)(q_k), or its divergence to ++\infty, is part of the hypothesis, so the symbol limkqk\lim_k q_k denotes wherever it is written (A sequence has at most one limit).

Neither implication in claim 2 can be reversed, and by symmetry neither can the one in claim 3; the companion page exhibits a pair with limkqk=0\lim_k q_k = 0, ak\sum a_k convergent and bk\sum b_k divergent.

For families from a general starting index mm the statement is the same, applied to the shifted sequences jaj+mj \mapsto a_{j+m} and jbj+mj \mapsto b_{j+m} (Series, partial sums, convergence and the sum, divergence, and the tail series).

On the third regime. "L=L = \infty" is written here as divergence of (qk)(q_k) to ++\infty in the sense of Divergence to ++\infty and to -\infty, and never as a limit equation with an infinite right-hand side. A sequence diverging to ++\infty has no limit in R\mathbb{R}, and this library does not write limqk=+\lim q_k = +\infty.

Facts & Assumptions

Given: Sequences (ak)(a_k), (bk)(b_k) of reals with ak>0a_k > 0 and bk>0b_k > 0 for every kk, the quotients qk=ak/bkq_k = a_k/b_k, and the assumption that one of the three regimes of the Statement holds: (qk)(q_k) converges with limkqk=L\lim_k q_k = L for some real L>0L > 0; or (qk)(q_k) converges with limkqk=0\lim_k q_k = 0; or (qk)(q_k) diverges to ++\infty (A sequence has at most one limit).

[L1]

Convergence to xx means: for every rational ε>0\varepsilon > 0 there is KK with xkx<ε|x_k - x| < \varepsilon for all kKk \ge K; and the same holds for every real ε>0\varepsilon > 0, since every real ε>0\varepsilon > 0 exceeds some rational 1/n1/n with n1n \ge 1 natural (Limits and Cauchy sequences of reals, For every ε>0\varepsilon > 0 in a complete ordered field there is a natural n1n \ge 1 with 1/n<ε1/n < \varepsilon, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L2]

qk+q_k \to +\infty means: for every real MM there is KK with qk>Mq_k > M for all kKk \ge K (Divergence to ++\infty and to -\infty).

[L3]

Direct comparison: if 0xkyk0 \le x_k \le y_k for all kk from some index on, then convergence of yk\sum y_k gives convergence of xk\sum x_k (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).

[L4]

For c0c \ne 0: cxk\sum c\,x_k converges if and only if xk\sum x_k converges (Convergent series add and scale termwise).

[L5]

Since qk=ak/bkq_k=a_k/b_k and bk>0b_k>0, the field laws give ak=qkbka_k=q_kb_k. Multiplication by a positive scalar preserves strict inequalities; the non-strict form follows by adjoining the equality case (Field, Sign rules for products and monotonicity of multiplication).

Proof

technique · cases
1.1

Assume (qk)(q_k) converges with limkqk=L\lim_k q_k = L for a real L>0L > 0.

assume-case pos
1.2

Assume instead (qk)(q_k) converges with limkqk=0\lim_k q_k = 0.

assume-case zero
1.3

Assume instead (qk)(q_k) diverges to ++\infty.

assume-case inf
2.1

In the case limkqk=L>0\lim_k q_k = L > 0, apply [L1] with the real tolerance L/2>0L/2 > 0: there is KK with qkL<L/2|q_k - L| < L/2, hence L/2<qk<3L/2L/2 < q_k < 3L/2, for all kKk \ge K.

step 1.1L1choose
2.2

In the case limkqk=0\lim_k q_k = 0, apply [L1] with the rational tolerance 11: there is KK with qk<1|q_k| < 1, hence qk<1q_k < 1, for all kKk \ge K.

step 1.2L1choose
2.3

In the case qk+q_k \to +\infty, apply [L2] with M=1M = 1: there is KK with qk>1q_k > 1 for all kKk \ge K.

step 1.3L2choose
3.1

In the case limkqk=L>0\lim_k q_k = L > 0, multiplying by bk>0b_k > 0 turns step 2.1 into (L/2)bk<ak<(3L/2)bk(L/2)\,b_k < a_k < (3L/2)\,b_k for all kKk \ge K, and all three quantities are positive.

step 2.1L5algebra
3.2

In the case limkqk=0\lim_k q_k = 0, multiplying by bk>0b_k > 0 turns step 2.2 into 0<ak<bk0 < a_k < b_k for all kKk \ge K.

step 2.2L5algebra
3.3

In the case qk+q_k \to +\infty, multiplying by bk>0b_k > 0 turns step 2.3 into 0<bk<ak0 < b_k < a_k for all kKk \ge K.

step 2.3L5algebra
4.1

In the case L>0L > 0: if bk\sum b_k converges then so does (3L/2)bk\sum (3L/2)b_k, and 0ak(3L/2)bk0 \le a_k \le (3L/2) b_k for kKk \ge K, so ak\sum a_k converges.

step 3.1L3L4
4.2

In the case L>0L > 0: if ak\sum a_k converges then, since 0(L/2)bkak0 \le (L/2)b_k \le a_k for kKk \ge K, the series (L/2)bk\sum (L/2) b_k converges, and L/20L/2 \ne 0 gives convergence of bk\sum b_k.

step 3.1L3L4
4.3

In the case limkqk=0\lim_k q_k = 0: 0akbk0 \le a_k \le b_k for kKk \ge K, so convergence of bk\sum b_k gives convergence of ak\sum a_k, and the contrapositive is the divergence form.

step 3.2L3
4.4

In the case qk+q_k \to +\infty: 0bkak0 \le b_k \le a_k for kKk \ge K, so convergence of ak\sum a_k gives convergence of bk\sum b_k, and the contrapositive is the divergence form.

step 3.3L3
5.1

The two implications in the case L>0L > 0 are the two directions of claim 1, and the remaining two cases give claims 2 and 3. The three assumed regimes are the cases of the disjunction in the Given, and they exhaust it, so every instance of the theorem is covered: outside those three regimes each of the three implications is vacuous, its hypothesis being false.

step 4.1step 4.2step 4.3step 4.4cases-exhaustive

Remarks

  • Why the three regimes are treated as one proof. The Statement is a conjunction of three implications, each with its own hypothesis on (qk)(q_k). Fixing the two sequences and arguing by cases on which regime holds proves all three at once, and costs nothing: if none of the regimes holds, every one of the three implications is vacuously true.

  • Positivity of (bk)(b_k) is needed twice. It is what makes qkq_k defined at all, and it is what lets an inequality between the qkq_k be multiplied through to an inequality between the aka_k and the bkb_k without reversing. Positivity of (ak)(a_k) is what supplies the lower bound 00 that the direct comparison test requires.

  • The limit is only used through an eventual two-sided estimate. No step needs the exact value of LL, only that qkq_k is eventually trapped strictly between two positive multiples of it. That is why the test still works when the quotients merely stay between two positive constants, and why the hypothesis limkqk=L\lim_k q_k = L is stronger than what the proof consumes.

Depends on

Used by

Dependency tree · next 3 levels

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