Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (z-ai/glm-5.2)audited 2026-07-29
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.

The integral test: for f0f \ge 0 nonincreasing on [0,)[0,\infty), kf(k)\sum_k f(k) converges if and only if the sequence (0Nf)N\bigl(\int_0^N f\bigr)_N is bounded, with 0Nfk<Nf(k)f(0)+0Nf\int_0^N f \le \sum_{k<N} f(k) \le f(0) + \int_0^N f

Statement

Let f:[0,)Rf : [0,\infty) \to \mathbb{R} be nonincreasing (Nondecreasing, increasing (strictly increasing), nonincreasing, decreasing, monotone and strictly monotone real functions on a subset of R\mathbb{R}, with the dictionary to monotone sequences) with f(t)0f(t) \ge 0 for every t0t \ge 0. For NNN \in \mathbb{N} write

JN  :=  0Nf,J_N \;:=\; \int_0^{N} f ,

which is defined for every NN: for N1N \ge 1 the restriction of ff to [0,N][0,N] is monotone, hence bounded and integrable (A monotone function on [a,b][a,b] is Riemann integrable: for the uniform partition into NN parts the upper minus lower sum telescopes to f(b)f(a)(ba)/ι(N)|f(b) - f(a)|\,(b-a)/\iota(N)), and J0=00f=0J_0 = \int_0^0 f = 0 (The integral with oriented limits: aaf:=0\int_a^a f := 0 and baf:=abf\int_b^a f := -\int_a^b f). Here NN inside the integral means the canonical natural ι(N)R\iota(N) \in \mathbb{R} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field), as everywhere in this library. Let sN:=k<Nf(k)s_N := \sum_{k<N} f(k) be the partial sums of kf(k)\sum_k f(k) (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion), the index kk ranging over N\mathbb{N}, which contains 00. Then:

  1. The bracket. For every NNN \in \mathbb{N}, JN    sN    f(0)+JN.J_N \;\le\; s_N \;\le\; f(0) + J_N .
  2. The test. (JN)NN(J_N)_{N\in\mathbb{N}} is nondecreasing, and kf(k)\sum_k f(k) converges if and only if the set {JN:NN}\{\,J_N : N \in \mathbb{N}\,\} is bounded above (Lower bound, bounded below, bounded set).

The conclusion is about a sequence of proper integrals, and that is deliberate. This library has not defined 0f\int_0^{\infty} f at this point in the reading order — improper integrals are developed on a later page — so the statement that a reader may expect, "kf(k)\sum_k f(k) converges if and only if 0f\int_0^{\infty} f converges", is not available and is not made. What is proved is the statement above, which is what that one abbreviates; the later page is where the two are identified.

The index starts at 00. Both the sum and the integral begin at 00, because N\mathbb{N} contains 00 and a sequence is a function on N\mathbb{N} (Sequences of reals: bounded, eventually, frequently, tails, subsequences). The classical statement, which starts at 11, is the statement about the first tail of kf(k)\sum_k f(k) and is not the statement above.

Facts & Assumptions

Given: A nonincreasing f:[0,)Rf : [0,\infty) \to \mathbb{R} with f0f \ge 0, and the notation JN=0NfJ_N = \int_0^N f, sN=k<Nf(k)s_N = \sum_{k<N} f(k) for NNN \in \mathbb{N}.

[L4]

Finite sums: telescoping k<n(ck+1ck)=cnc0\sum_{k<n}(c_{k+1}-c_k) = c_n - c_0, splitting, additivity, and monotonicity in the terms (Finite sums and finite products, by recursion, Laws of finite sums and finite products).

[L5]

For a sequence (ak)(a_k) of nonnegative reals, the partial sums are nondecreasing and ak\sum a_k converges if and only if the set of partial sums is bounded above (A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum, Series, partial sums, convergence and the sum, divergence, and the tail series, Sequences of reals: bounded, eventually, frequently, tails, subsequences).

[L6]

ι(0)=0\iota(0) = 0, ι(N+1)=ι(N)+1\iota(N+1) = \iota(N)+1, and ι\iota is nondecreasing on N\mathbb{N} (The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field, Canonical naturals are positive and strictly increasing).

[L7]

Ordered-field arithmetic: the order is total and transitive, and adding constants preserves inequalities (Ordered field, Complete ordered field (least-upper-bound property), Intervals of R\mathbb{R}: the nine order-convex forms, nondegeneracy, and length).

Proof

technique · direct
1.1

For kNk \in \mathbb{N} the interval [ι(k),ι(k+1)][\iota(k), \iota(k+1)] is nondegenerate of length 11 by [L6], ff is integrable on it by [L1], and f(k+1)f(t)f(k)f(k+1) \le f(t) \le f(k) for every tt in it, ff being nonincreasing.

givenL1L6
1.2

By [L3] and [L4], JN=0Nf=k<Nkk+1fJ_N = \int_0^N f = \sum_{k<N}\int_k^{k+1} f for every NNN \in \mathbb{N}: writing Φ(x):=0xf\Phi(x) := \int_0^x f, each summand is Φ(k+1)Φ(k)\Phi(k+1)-\Phi(k) and the sum telescopes to Φ(N)Φ(0)=JN\Phi(N) - \Phi(0) = J_N.

L1L3L4L6
1.3

By [L4], k<Nf(k+1)=sN+1f(0)\sum_{k<N}f(k+1) = s_{N+1} - f(0), since splitting sN+1=k<N+1f(k)s_{N+1} = \sum_{k<N+1}f(k) at index 11 gives f(0)+j<Nf(1+j)f(0) + \sum_{j<N}f(1+j).

L4
2.1

Hence f(k+1)kk+1ff(k)f(k+1) \le \int_{k}^{k+1} f \le f(k) for every kNk \in \mathbb{N}, by [L2] with qp=1q - p = 1.

step 1.1L2
3.1

Summing step 2.1 over k<Nk < N with [L4] gives k<Nf(k+1)    JN    k<Nf(k)  =  sN\sum_{k<N} f(k+1) \;\le\; J_N \;\le\; \sum_{k<N} f(k) \;=\; s_N, which is the left half of claim 1.

step 2.1step 1.2L4
3.2

(JN)(J_N) is nondecreasing: JN+1JN=NN+1f0J_{N+1} - J_N = \int_N^{N+1} f \ge 0 by step 1.2 and [L2], since f0f \ge 0.

step 2.1step 1.2givenL2L7
4.1

So sN+1f(0)+JNs_{N+1} \le f(0) + J_N by step 3.1 and step 1.3; and sNsN+1s_N \le s_{N+1} because f(N)0f(N) \ge 0, so sNf(0)+JNs_N \le f(0) + J_N, which is the right half of claim 1.

step 3.1step 1.3givenL4L7
4.2

If kf(k)\sum_k f(k) converges, then by [L5] the partial sums are bounded above, say sNSs_N \le S for every NN, and step 3.1 gives JNsNSJ_N \le s_N \le S; so the set of JNJ_N is bounded above.

step 3.1givenL5L7
5.1

If the set of JNJ_N is bounded above, say by a real BB, then sNf(0)+Bs_N \le f(0) + B for every NN by step 4.1, so the partial sums are bounded above and kf(k)\sum_k f(k) converges by [L5], the terms f(k)f(k) being nonnegative.

step 4.1givenL5L7
6.1

Steps 5.1 and 4.2 are the two implications of claim 2, and step 3.2 is its first clause; claim 1 is steps 3.1 and 4.1.

step 3.1step 4.1step 3.2step 5.1step 4.2

Remarks

Depends on

Used by

Dependency tree · next 3 levels

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