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 converges then converges
Statement
Let be a sequence of reals. If the series converges (Series, partial sums, convergence and the sum, divergence, and the tail series) then the series converges.
A series with the property that 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 , being this statement applied to the shifted sequence (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 of reals such that the series 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.
The Cauchy criterion for series: converges if and only if for every real there is with for all (A series converges iff for every there is with for all , Series, partial sums, convergence and the sum, divergence, and the tail series).
Triangle inequality for finite sums: (Triangle inequality for finite sums); the block is by definition the finite sum (Finite sums and finite products, by recursion), so applying the inequality to the shifted sequence gives for all naturals .
Monotonicity of finite sums: if for all then (Laws of finite sums and finite products).
Absolute value: for every real , and whenever (Basic properties of the absolute value).
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
Let be an arbitrary real; since converges, the Cauchy criterion applied to the sequence supplies with for all .
For all naturals the block is a finite sum of nonnegative terms, hence nonnegative, hence equal to its own absolute value.
So for all one has .
As was arbitrary, the sequence satisfies the Cauchy criterion, so converges.
Remarks
-
Nothing here identifies the two sums, and they are in general different. What is proved is that the second series converges, not that it converges to the same value; the bound is true and is not needed anywhere on this page, so it is not proved here.
-
Why the Cauchy criterion is the right instrument. The terms have no sign, so A series of nonnegative terms converges iff its partial sums are bounded, and then the sum is their supremum does not apply to and boundedness of its partial sums would prove nothing. The Cauchy criterion is the one convergence test on this page that never names a candidate sum and never asks for a sign, and the whole proof is the observation that its hypothesis for implies its hypothesis for , term by term, through one application of the finite triangle inequality.
-
What this unlocks on this page. The root test (Root test: gives absolute convergence and hence convergence, gives divergence, and decides nothing) and the ratio test (Ratio test: gives absolute convergence and hence convergence, and gives divergence) each produce convergence of directly, by comparison with a geometric series; with this lemma both reach their standard conclusion, the convergence of itself. Without it their convergence halves would be strictly weaker than the classical statements.
-
The systematic theory is elsewhere. Rearrangement, the Riemann series theorem, conditional convergence and products of series all belong with absolute convergence and are developed on a later page of this track. This lemma is only the one implication those two tests need.
Depends on
- Series, partial sums, convergence and the sum, divergence, and the tail series
- A series converges iff for every $\varepsilon > 0$ there is $N$ with $|a_{m+1} + \dots + a_n| < \varepsilon$ for all $n > m \ge N$
- Triangle inequality for finite sums
- Laws of finite sums and finite products
- Finite sums and finite products, by recursion
- Basic properties of the absolute value
- Limits and Cauchy sequences of reals
Used by
- If ∑ aₖ and ∑ bₖ both converge absolutely then their Cauchy product converges absolutely, with sum AB Corollary
- Absolutely convergent and conditionally convergent series, and the general starting index Definition
- FALSE: every convergent series converges absolutely False statement
- If for every ε > 0 some continuous g : X → ℝ satisfies | f(x) - g(x)| < ε for all x, then f is continuous; in particular a uniformly convergent series of continuous real functions has a continuous sum Lemma
- The exponential series converges absolutely for every real argument Lemma
- How the nonnegative tests are ordered by strength, and which of them this page cannot state without the logarithm Remark
- A countable pure-step integrator evaluates a continuous integrand as the absolutely convergent weighted sum of its values at the jumps Theorem
- An absolutely convergent series in ℝⁿ converges, and every rearrangement converges to the same sum Theorem
- Dirichlet's rearrangement theorem: an absolutely convergent series converges unconditionally, and every rearrangement of it has the same sum Theorem
- Dirichlet's test: if the partial sums of ∑ aₖ are bounded and (bₖ) is nonincreasing with bₖ → 0, then ∑ aₖ bₖ converges Theorem
- Fubini for double series: if ∑ᵢ ∑ⱼ |aᵢⱼ| converges then both iterated sums and the sum along every bijection ℕ → ℕ × ℕ converge to one and the same value Theorem
- Mertens' theorem: if ∑ aₖ converges absolutely to A and ∑ bₖ converges to B, their Cauchy product converges to AB Theorem
- Ratio test: limsup |aₖ₊₁/aₖ| < 1 gives absolute convergence and hence convergence, and liminf |aₖ₊₁/aₖ| > 1 gives divergence Theorem
- Root test: limsup |aₖ|^1/k < 1 gives absolute convergence and hence convergence, > 1 gives divergence, and = 1 decides nothing Theorem
- Under square summability, the signed product of (1+pₙ) converges iff the series of pₙ converges Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 52 results over 12 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
- Absolute convergence (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (3.45) (standard reference, not scraped)
- T. Tao, Analysis I, 3rd ed., §7.2 (standard reference, not scraped)
- John K. Hunter, An Introduction to Real Analysis (standard reference, not scraped)
- Stephen Semmes, Elements of Analysis (standard reference, not scraped)