Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-08-11
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.

Integral test as an equivalence with an improper integral

Statement

Let f:[1,∞)→[0,∞) be nonincreasing and Riemann integrable on every compact interval. Then ∑n=1∞f(n)converges if and only if∫1∞f(x) dxconverges.

Changing finitely many initial terms or moving the finite lower integration endpoint does not affect this equivalence.

Facts & Assumptions

Given: A nonnegative nonincreasing locally integrable f.

[L2]

Nonnegative partial sums and integer truncation integrals are nondecreasing, hence converge exactly when bounded (A monotone sequence converges if and only if it is bounded).

[L3]

Every real truncation is bracketed between two integer truncations (Every complete ordered field is Archimedean).

Proof

technique · direct
1.1

For every integer k≥1, monotonicity of f and [L1, L2] give f(k+1)≤∫kk+1f(x) dx≤f(k). Adding these inequalities and using interval additivity yields ∑k=2N+1f(k)≤∫1N+1f(x) dx≤∑k=1Nf(k). Thus the series partial sums are bounded exactly when the integer truncation integrals are bounded. By [L2], this is exactly convergence of the corresponding two monotone sequences.

L1L2
2.1

Suppose the integer truncations converge to I. Given a sufficiently large integer N and any real R≥N, [L3] supplies an integer M>R. Nonnegativity gives ∫1Nf≤∫1Rf≤∫1Mf, and both integer bounds tend to I; hence the full real-parameter limit is I. The reverse implication is immediate by restriction to integer truncations. Tail invariance handles finite changes.

L3∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

42 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