Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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 ∑∣ak∣ converges then ∑ak converges

Statement

Let (ak) be a sequence of reals. If the series ∑∣ak∣ converges (Series, partial sums, convergence and the sum, divergence, and the tail series) then the series ∑ak converges.

A series with the property that ∑∣ak∣ converges is called absolutely convergent; the lemma says that absolute convergence implies convergence.

The same statement holds for a family from a general starting index m, being this statement applied to the shifted sequence j↦aj+m (Series, partial sums, convergence and the sum, divergence, and the tail series).

The converse is false, and the standard witness is the alternating harmonic series. That witness is not available on this page: its convergence is the alternating series test, which is not proved here. Nothing below asserts a converse, and no item on this page uses one.

Facts & Assumptions

Given: A sequence (ak) of reals such that the series ∑∣ak∣ converges, with partial sums as in Series, partial sums, convergence and the sum, divergence, and the tail series and finite sums as in Finite sums and finite products, by recursion.

[L1]

The Cauchy criterion for series: ∑dk converges if and only if for every real ε>0 there is N∈N with ∣∑k=p+1ndk∣<ε for all n>p≥N (A series converges iff for every ε>0 there is N with ∣am+1+⋯+an∣<ε for all n>m≥N, Series, partial sums, convergence and the sum, divergence, and the tail series).

[L2]

Triangle inequality for finite sums: ∣∑k<duk∣≤∑k<d∣uk∣ (Triangle inequality for finite sums); the block ∑k=p+1nuk is by definition the finite sum ∑t<n−pup+1+t (Finite sums and finite products, by recursion), so applying the inequality to the shifted sequence t↦up+1+t gives ∣∑k=p+1nuk∣≤∑k=p+1n∣uk∣ for all naturals n>p.

[L3]

Monotonicity of finite sums: if xt≥0 for all t<d then ∑t<dxt≥0 (Laws of finite sums and finite products).

[L4]

Absolute value: ∣u∣≥0 for every real u, and ∣u∣=u whenever u≥0 (Basic properties of the absolute value).

[L5]

Convergence of a real sequence, and the fact that the real and rational formulations of a tolerance agree (Limits and Cauchy sequences of reals).

Proof

technique · direct
1.1

Let ε>0 be an arbitrary real; since ∑∣ak∣ converges, the Cauchy criterion applied to the sequence (∣ak∣) supplies N∈N with ∣∑k=p+1n∣ak∣∣<ε for all n>p≥N.

L1L5choose
1.2

For all naturals n>p the block ∑k=p+1n∣ak∣ is a finite sum of nonnegative terms, hence nonnegative, hence equal to its own absolute value.

L2L3L4
2.1

So for all n>p≥N one has ∣∑k=p+1nak∣≤∑k=p+1n∣ak∣=∣∑k=p+1n∣ak∣∣<ε.

step 1.1step 1.2L2
3.1

As ε>0 was arbitrary, the sequence (ak) satisfies the Cauchy criterion, so ∑ak converges.

step 2.1L1∎

Remarks

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