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.
Abel summation by parts: with one has for every
Statement
Let and be sequences of reals and let
be the partial sums of (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion), so that and for every . Then for every natural number
Both sides are finite sums in the sense of Finite sums and finite products, by recursion; at the right-hand sum is empty and the identity reads .
The hypothesis is what makes the statement legitimate, not merely convenient: the index occurs on the right, and is a natural number exactly when . At there is nothing to state, both the left-hand side and being .
Facts & Assumptions
Given: Sequences and of reals and the partial sums (Series, partial sums, convergence and the sum, divergence, and the tail series).
Finite sums are defined by the recursion and (Finite sums and finite products, by recursion).
The partial sums satisfy and for every , those being the two clauses of [L1] applied to (Series, partial sums, convergence and the sum, divergence, and the tail series).
Finite sums are additive and may be split at any intermediate index (Laws of finite sums and finite products).
The principle of induction on (The principle of mathematical induction).
Proof
The claim to be proved by induction is the statement : the displayed identity holds at , that is . Every is for exactly one , so proving for all proves the lemma.
holds: the left-hand side is by [L1], while by [L2] and by [L1], so the right-hand side is .
Assume for a fixed .
By [L1], .
By [L1], .
By [L2], , so .
Substituting the induction hypothesis into step 1.4 gives .
Using step 1.6, .
Combining step 2.1 and step 2.2 and then step 1.5 gives , which is .
By [L4] applied to step 1.2 and step 3.1, holds for every , that is, the displayed identity holds for every .
Remarks
-
What the identity is for. It converts a series , about which nothing is assumed, into a boundary term and a series whose terms carry the differences of . If is bounded and is monotone, those differences have one sign and telescope, which is exactly the situation of Dirichlet's test: if the partial sums of are bounded and is nonincreasing with , then converges. The transformation is the discrete analogue of integration by parts, and the boundary term is the analogue of the boundary term there.
-
The block form needs no separate proof. For , subtracting the identity at from the identity at gives , using only splitting of finite sums (Laws of finite sums and finite products). Nothing on this page needs that form, so it is recorded here rather than stated as a result.
-
Two conventions are doing work. sums the terms , so and with no shift (Series, partial sums, convergence and the sum, divergence, and the tail series); and the empty sum is (Finite sums and finite products, by recursion), which is what makes a genuine instance of the identity rather than a case to be excluded.
Depends on
Used by
- Abel's limit theorem: if a real series converges to s, then its power series tends to s as x↑1 Theorem
- Bonnet's second mean value theorem: for f monotone and g integrable on [a,b] there is ξ∈[a,b] with ∫ₐᵇ fg = f(a)∫ₐ^ξ g + f(b)∫_ξᵇ g Theorem
- Dirichlet's test: if the partial sums of ∑ aₖ are bounded and (bₖ) is nonincreasing with bₖ → 0, then ∑ aₖ bₖ converges Theorem
- Riemann–Stieltjes integration by parts Theorem
- Uniform Abel test: a uniformly convergent function series times a uniformly bounded pointwise monotone family gives a uniformly convergent product series Theorem
- Uniform Dirichlet test: uniformly bounded partial sums times a uniformly decreasing null family give a uniformly convergent function series Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 44 results over 13 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
- Summation by parts (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 3 (standard reference, not scraped)
- Thomson, Bruckner, and Bruckner, Elementary Real Analysis (standard reference, not scraped)