Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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.

Abel summation by parts: with An=k<nakA_n = \sum_{k<n} a_k one has k<nakbk=Anbn1k<n1Ak+1(bk+1bk)\sum_{k<n} a_k b_k = A_n b_{n-1} - \sum_{k < n-1} A_{k+1}\,(b_{k+1} - b_k) for every n1n \ge 1

Statement

Let (ak)(a_k) and (bk)(b_k) be sequences of reals and let

An  :=  k<nak(nN)A_n \;:=\; \sum_{k<n} a_k \qquad (n \in \mathbb{N})

be the partial sums of ak\sum a_k (Series, partial sums, convergence and the sum, divergence, and the tail series, Finite sums and finite products, by recursion), so that A0=0A_0 = 0 and ak=Ak+1Aka_k = A_{k+1} - A_k for every kk. Then for every natural number n1n \ge 1

k<nakbk  =  Anbn1    k<n1Ak+1(bk+1bk).\sum_{k<n} a_k b_k \;=\; A_n\, b_{n-1} \;-\; \sum_{k<n-1} A_{k+1}\,(b_{k+1} - b_k) .

Both sides are finite sums in the sense of Finite sums and finite products, by recursion; at n=1n = 1 the right-hand sum is empty and the identity reads a0b0=A1b0a_0 b_0 = A_1 b_0.

The hypothesis n1n \ge 1 is what makes the statement legitimate, not merely convenient: the index n1n-1 occurs on the right, and n1n-1 is a natural number exactly when n1n \ge 1. At n=0n = 0 there is nothing to state, both the left-hand side and A0A_0 being 00.

Facts & Assumptions

Given: Sequences (ak)(a_k) and (bk)(b_k) of reals and the partial sums An=k<nakA_n = \sum_{k<n} a_k (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L1]

Finite sums are defined by the recursion k<0xk=0\sum_{k<0} x_k = 0 and k<n+1xk=k<nxk+xn\sum_{k<n+1} x_k = \sum_{k<n} x_k + x_n (Finite sums and finite products, by recursion).

[L2]

The partial sums satisfy A0=0A_0 = 0 and An+1=An+anA_{n+1} = A_n + a_n for every nn, those being the two clauses of [L1] applied to (ak)(a_k) (Series, partial sums, convergence and the sum, divergence, and the tail series).

[L3]

Finite sums are additive and may be split at any intermediate index (Laws of finite sums and finite products).

[L4]

The principle of induction on N\mathbb{N} (The principle of mathematical induction).

Proof

technique · induction
1.1

The claim to be proved by induction is the statement P(m)P(m): the displayed identity holds at n=m+1n = m+1, that is k<m+1akbk=Am+1bmk<mAk+1(bk+1bk)\sum_{k<m+1} a_k b_k = A_{m+1} b_m - \sum_{k<m} A_{k+1}(b_{k+1} - b_k). Every n1n \ge 1 is m+1m+1 for exactly one mNm \in \mathbb{N}, so proving P(m)P(m) for all mm proves the lemma.

L4
1.2

P(0)P(0) holds: the left-hand side is k<1akbk=a0b0\sum_{k<1} a_k b_k = a_0 b_0 by [L1], while A1=A0+a0=a0A_1 = A_0 + a_0 = a_0 by [L2] and k<0Ak+1(bk+1bk)=0\sum_{k<0} A_{k+1}(b_{k+1}-b_k) = 0 by [L1], so the right-hand side is a0b00a_0 b_0 - 0.

L1L2base
1.3

Assume P(m)P(m) for a fixed mNm \in \mathbb{N}.

ih
1.4

By [L1], k<m+2akbk=k<m+1akbk+am+1bm+1\sum_{k<m+2} a_k b_k = \sum_{k<m+1} a_k b_k + a_{m+1} b_{m+1}.

L1
1.5

By [L1], k<m+1Ak+1(bk+1bk)=k<mAk+1(bk+1bk)+Am+1(bm+1bm)\sum_{k<m+1} A_{k+1}(b_{k+1} - b_k) = \sum_{k<m} A_{k+1}(b_{k+1} - b_k) + A_{m+1}(b_{m+1} - b_m).

L1L3
1.6

By [L2], Am+2=Am+1+am+1A_{m+2} = A_{m+1} + a_{m+1}, so am+1=Am+2Am+1a_{m+1} = A_{m+2} - A_{m+1}.

L2
2.1

Substituting the induction hypothesis into step 1.4 gives k<m+2akbk=Am+1bmk<mAk+1(bk+1bk)+am+1bm+1\sum_{k<m+2} a_k b_k = A_{m+1} b_m - \sum_{k<m} A_{k+1}(b_{k+1}-b_k) + a_{m+1} b_{m+1}.

step 1.3step 1.4
2.2

Using step 1.6, Am+1bm+am+1bm+1=Am+1bm+Am+2bm+1Am+1bm+1=Am+2bm+1Am+1(bm+1bm)A_{m+1} b_m + a_{m+1} b_{m+1} = A_{m+1} b_m + A_{m+2} b_{m+1} - A_{m+1} b_{m+1} = A_{m+2} b_{m+1} - A_{m+1}(b_{m+1} - b_m).

step 1.6algebra
3.1

Combining step 2.1 and step 2.2 and then step 1.5 gives k<m+2akbk=Am+2bm+1Am+1(bm+1bm)k<mAk+1(bk+1bk)=Am+2bm+1k<m+1Ak+1(bk+1bk)\sum_{k<m+2} a_k b_k = A_{m+2} b_{m+1} - A_{m+1}(b_{m+1}-b_m) - \sum_{k<m} A_{k+1}(b_{k+1}-b_k) = A_{m+2} b_{m+1} - \sum_{k<m+1} A_{k+1}(b_{k+1}-b_k), which is P(m+1)P(m+1).

step 2.1step 2.2step 1.5algebra
4.1

By [L4] applied to step 1.2 and step 3.1, P(m)P(m) holds for every mNm \in \mathbb{N}, that is, the displayed identity holds for every n1n \ge 1.

step 1.2step 3.1L4discharge-induction

Remarks

  • What the identity is for. It converts a series akbk\sum a_k b_k, about which nothing is assumed, into a boundary term Anbn1A_n b_{n-1} and a series Ak+1(bk+1bk)\sum A_{k+1}(b_{k+1} - b_k) whose terms carry the differences of (bk)(b_k). If (An)(A_n) is bounded and (bk)(b_k) is monotone, those differences have one sign and telescope, which is exactly the situation of Dirichlet's test: if the partial sums of ak\sum a_k are bounded and (bk)(b_k) is nonincreasing with bk0b_k \to 0, then akbk\sum a_k b_k 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 1Mn1 \le M \le n, subtracting the identity at MM from the identity at nn gives k=Mn1akbk=Anbn1AMbM1k=M1n2Ak+1(bk+1bk)\sum_{k=M}^{n-1} a_k b_k = A_n b_{n-1} - A_M b_{M-1} - \sum_{k=M-1}^{n-2} A_{k+1}(b_{k+1}-b_k), 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. AnA_n sums the nn terms a0,,an1a_0, \dots, a_{n-1}, so A0=0A_0 = 0 and ak=Ak+1Aka_k = A_{k+1} - A_k with no shift (Series, partial sums, convergence and the sum, divergence, and the tail series); and the empty sum is 00 (Finite sums and finite products, by recursion), which is what makes n=1n = 1 a genuine instance of the identity rather than a case to be excluded.

Depends on

Used by

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