Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

The Cauchy product of two series: cn=∑k=0nakbn−k

Definition

Let (ak) and (bk) be sequences of reals (Series, partial sums, convergence and the sum, divergence, and the tail series). The Cauchy product of ∑ak and ∑bk is the series ∑cn of the sequence

cn  :=  ∑k=0nak bn−k(n∈N),

a finite sum of n+1 terms in the sense of Finite sums and finite products, by recursion. Each index n−k occurring here is a natural number, because k runs over 0,…,n; and c0=a0b0.

The definition uses only the two sequences of terms. No convergence is assumed and none is asserted: ∑cn is a series formed from (ak) and (bk), and whether it converges, and to what, is the subject of Mertens' theorem: if ∑ak converges absolutely to A and ∑bk converges to B, their Cauchy product converges to AB and If ∑ak and ∑bk both converge absolutely then their Cauchy product converges absolutely, with sum AB, while FALSE: the Cauchy product of two convergent series converges shows that convergence of both factors is not enough.

Why these coefficients. Reading ∑akxk and ∑bkxk as formal power series and multiplying them term by term, the coefficient of xn collects exactly the products akbn−k with k+(n−k)=n. So cn is the coefficient one is forced to write down if the product of two series is to behave like the product of two polynomials, and the results on this page say when that formal operation computes the product of the two sums.

Remarks

  • Only the two sequences of terms enter. The construction is a rule on sequences, and every result below is stated for the sequence (cn) it produces. The Cauchy product of ∑bk with ∑ak is formed by the same rule with the roles exchanged, giving ∑k=0nbkan−k; that this is the same number as cn is the reversal invariance of a finite sum, which is not among the laws of Laws of finite sums and finite products and is not used anywhere on this page. Each statement below therefore says which factor carries which hypothesis, rather than appealing to symmetry.

  • The definition is stated for series indexed from 0, as every series on this page is (Series, partial sums, convergence and the sum, divergence, and the tail series). For families from a general starting index the Cauchy product is formed after shifting both families to N, as Series, partial sums, convergence and the sum, divergence, and the tail series prescribes; the shift changes which products appear in cn, so the starting indices have to be said, and they are said wherever this construction is used below.

  • Nothing here is a product of sums. The symbol ∑cn names a new series built from the terms, not the number (∑k=0∞ak)(∑k=0∞bk), which may not even be defined. Identifying the two is a theorem with hypotheses.

Depends on

Used by

Dependency tree · two levels

20 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