# Cauchy product

In mathematics, more specifically in mathematical analysis, the Cauchy product is the discrete convolution of two infinite series. It is named after the French mathematician Augustin-Louis Cauchy.

## Definitions

The Cauchy product may apply to infinite series or power series. When people apply it to finite sequences or finite series, that can be seen merely as a particular case of a product of series with a finite number of non-zero coefficients (see discrete convolution).
Convergence issues are discussed in the next section.

### Cauchy product of two infinite series

Let ∑$_{i=0}$$^∞$a$_i${\textstyle \sum _{i=0}^{\infty }a_{i}} and ∑$_{j=0}$$^∞$b$_j${\textstyle \sum _{j=0}^{\infty }b_{j}} be two infinite series with complex terms. The Cauchy product of these two infinite series is defined by a discrete convolution as follows:
    $\left(\sum _{i=0}^{\infty }a_{i}\right)\cdot \left(\sum _{j=0}^{\infty }b_{j}\right)=\sum _{k=0}^{\infty }c_{k}$  where  $c_{k}=\sum _{l=0}^{k}a_{l}b_{k-l}$.

### Cauchy product of two power series

Consider the following two power series
    $\sum _{i=0}^{\infty }a_{i}x^{i}$  and  $\sum _{j=0}^{\infty }b_{j}x^{j}$
with complex coefficients $\{a_{i}\}$ and $\{b_{j}\}$. The Cauchy product of these two power series is defined by a discrete convolution as follows:
    $\left(\sum _{i=0}^{\infty }a_{i}x^{i}\right)\cdot \left(\sum _{j=0}^{\infty }b_{j}x^{j}\right)=\sum _{k=0}^{\infty }c_{k}x^{k}$  where  $c_{k}=\sum _{l=0}^{k}a_{l}b_{k-l}$.

## Convergence and Mertens' theorem

Let (a$_n$)$_{n≥0}$ and (b$_n$)$_{n≥0}$ be real or complex sequences. It was proved by Franz Mertens that, if the series ∑$_{n=0}$$^∞$a$_n${\textstyle \sum _{n=0}^{\infty }a_{n}} converges to A and ∑$_{n=0}$$^∞$b$_n${\textstyle \sum _{n=0}^{\infty }b_{n}} converges to B, and at least one of them converges absolutely, then their Cauchy product converges to AB. The theorem is still valid in a Banach algebra (see first line of the following proof).
It is not sufficient for both series to be convergent; if both sequences are conditionally convergent, the Cauchy product does not have to converge towards the product of the two series, as the following example shows:

### Example

Consider the two alternating series with
$a_{n}=b_{n}={\frac {(-1)^{n}}{\sqrt {n+1}}}\,,$
which are only conditionally convergent (the divergence of the series of the absolute values follows from the direct comparison test and the divergence of the harmonic series). The terms of their Cauchy product are given by
$c_{n}=\sum _{k=0}^{n}{\frac {(-1)^{k}}{\sqrt {k+1}}}\cdot {\frac {(-1)^{n-k}}{\sqrt {n-k+1}}}=(-1)^{n}\sum _{k=0}^{n}{\frac {1}{\sqrt {(k+1)(n-k+1)}}}$
for every integer n ≥ 0. Since for every k ∈ {0, 1, ..., n} we have the inequalities k + 1 ≤ n + 1 and n – k + 1 ≤ n + 1, it follows for the square root in the denominator that √(k + 1)(n − k + 1) ≤ n +1, hence, because there are n + 1 summands,
$|c_{n}|\geq \sum _{k=0}^{n}{\frac {1}{n+1}}=1$
for every integer n ≥ 0. Therefore, c$_n$ does not converge to zero as n → ∞, hence the series of the (c$_n$)$_{n≥0}$ diverges by the term test.

### Proof of Mertens' theorem

For simplicity, we will prove it for complex numbers. However, the proof we are about to give is formally identical for an arbitrary Banach algebra (not even commutativity or associativity is required).
Assume without loss of generality that the series ∑$_{n=0}$$^∞$a$_n${\textstyle \sum _{n=0}^{\infty }a_{n}} converges absolutely. Define the partial sums
$A_{n}=\sum _{i=0}^{n}a_{i},\quad B_{n}=\sum _{i=0}^{n}b_{i}\quad {\text{and}}\quad C_{n}=\sum _{i=0}^{n}c_{i}$
with
$c_{i}=\sum _{k=0}^{i}a_{k}b_{i-k}\,.$
Then
$C_{n}=\sum _{i=0}^{n}a_{n-i}B_{i}$
by rearrangement, hence
Fix ε > 0. Since ∑$_{k∈N}$|a$_k$|<∞{\textstyle \sum _{k\in \mathbb {N} }|a_{k}|<\infty } by absolute convergence, and since B$_n$ converges to B as n → ∞, there exists an integer N such that, for all integers n ≥ N,
(this is the only place where the absolute convergence is used). Since the series of the (a$_n$)$_{n≥0}$ converges, the individual a$_n$ must converge to 0 by the term test. Hence there exists an integer M such that, for all integers n ≥ M,
Also, since A$_n$ converges to A as n → ∞, there exists an integer L such that, for all integers n ≥ L,
Then, for all integers n ≥ max{L, M + N}, use the representation (1) for C$_n$, split the sum in two parts, use the triangle inequality for the absolute value, and finally use the three estimates (2), (3) and (4) to show that
${\begin{aligned}|C_{n}-AB|&={\biggl |}(A_{n}-A)B+\sum _{i=0}^{n}a_{n-i}(B_{i}-B){\biggr |}\\&\leq\underbrace {|A_{n}-A|\,|B|} _{\leq \,\varepsilon /3{\text{ by (4)}}}+\sum _{i=0}^{N-1}\underbrace {|a_{\underbrace {\scriptstyle n-i} _{\scriptscriptstyle \geq M}}|\,|B_{i}-B|} _{\leq \,\varepsilon /3{\text{ by (3)}}}+\underbrace {\sum _{i=N}^{n}|a_{n-i}|\,|B_{i}-B|} _{\leq \,\varepsilon /3{\text{ by (2)}}}\leq \varepsilon \,.\end{aligned}}$
By the definition of convergence of a series, C$_n$ → AB as required.

## Cesàro's theorem

In cases where the two sequences are convergent but not absolutely convergent, the Cauchy product is still Cesàro summable. Specifically:
If (a$_n$)$_{n≥0}${\textstyle (a_{n})_{n\geq 0}}, (b$_n$)$_{n≥0}${\textstyle (b_{n})_{n\geq 0}} are real sequences with ∑a$_n$→A{\textstyle \sum a_{n}\to A} and ∑b$_n$→B{\textstyle \sum b_{n}\to B} then
${\frac {1}{N}}\left(\sum _{n=1}^{N}\sum _{i=1}^{n}\sum _{k=0}^{i}a_{k}b_{i-k}\right)\to AB.$
This can be generalised to the case where the two sequences are not convergent but just Cesàro summable:

### Theorem

For r>−1{\textstyle r>-1} and s>−1{\textstyle s>-1}, suppose the sequence (a$_n$)$_{n≥0}${\textstyle (a_{n})_{n\geq 0}} is (C, r){\textstyle (C, \;r)} summable with sum A and (b$_n$)$_{n≥0}${\textstyle (b_{n})_{n\geq 0}} is (C, s){\textstyle (C, \;s)} summable with sum B. Then their Cauchy product is (C, r+s+1){\textstyle (C, \;r+s+1)} summable with sum AB.

## Examples

* For some x, y∈R{\textstyle x, y\in \mathbb {R} }, let a$_n$=x$^n$/n!{\textstyle a_{n}=x^{n}/n!} and b$_n$=y$^n$/n!{\textstyle b_{n}=y^{n}/n!}. Then $c_{n}=\sum _{i=0}^{n}{\frac {x^{i}}{i!}}{\frac {y^{n-i}}{(n-i)!}}={\frac {1}{n!}}\sum _{i=0}^{n}{\binom {n}{i}}x^{i}y^{n-i}={\frac {(x+y)^{n}}{n!}}$ by definition and the binomial formula. Since, formally, exp⁡(x)=∑a$_n${\textstyle \exp(x)=\sum a_{n}} and exp⁡(y)=∑b$_n${\textstyle \exp(y)=\sum b_{n}}, we have shown that exp⁡(x+y)=∑c$_n${\textstyle \exp(x+y)=\sum c_{n}}. Since the limit of the Cauchy product of two absolutely convergent series is equal to the product of the limits of those series, we have proven the formula exp⁡(x+y)=exp⁡(x)exp⁡(y){\textstyle \exp(x+y)=\exp(x)\exp(y)} for all x, y∈R{\textstyle x, y\in \mathbb {R} }.
* As a second example, let a$_n$=b$_n$=1{\textstyle a_{n}=b_{n}=1} for all n∈N{\textstyle n\in \mathbb {N} }. Then c$_n$=n+1{\textstyle c_{n}=n+1} for all $n\in \mathbb {N}$ so the Cauchy product $\sum c_{n}=(1,1+2,1+2+3,1+2+3+4,\dots )$ does not converge.

## Generalizations

All of the foregoing applies to sequences in C{\textstyle \mathbb {C} } (complex numbers). The Cauchy product can be defined for series in the R$^n${\textstyle \mathbb {R} ^{n}} spaces (Euclidean spaces) where multiplication is the inner product. In this case, we have the result that if two series converge absolutely then their Cauchy product converges absolutely to the inner product of the limits.

### Products of finitely many infinite series

Let $n\in \mathbb {N}$ such that $n\geq 2$ (actually the following is also true for $n=1$ but the statement becomes trivial in that case) and let ∑$_{k1=0}$$^∞$a$_{1, k1}$, …, ∑$_{kn=0}$$^∞$a$_{n, kn}${\textstyle \sum _{k_{1}=0}^{\infty }a_{1, k_{1}}, \ldots , \sum _{k_{n}=0}^{\infty }a_{n, k_{n}}} be infinite series with complex coefficients, from which all except the $n$th one converge absolutely, and the $n$th one converges. Then the limit $\lim _{N\to \infty }\sum _{k_{1}+\ldots +k_{n}\leq N}a_{1,k_{1}}\cdots a_{n,k_{n}}$ exists and we have: $\prod _{j=1}^{n}\left(\sum _{k_{j}=0}^{\infty }a_{j,k_{j}}\right)=\lim _{N\to \infty }\sum _{k_{1}+\ldots +k_{n}\leq N}a_{1,k_{1}}\cdots a_{n,k_{n}}$

### Proof

Because $\forall N\in \mathbb {N} :\sum _{k_{1}+\ldots +k_{n}\leq N}a_{1,k_{1}}\cdots a_{n,k_{n}}=\sum _{k_{1}=0}^{N}\sum _{k_{2}=0}^{k_{1}}\cdots \sum _{k_{n}=0}^{k_{n-1}}a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}$ the statement can be proven by induction over $n$: The case for $n=2$ is identical to the claim about the Cauchy product. This is our induction base.
The induction step goes as follows: Let the claim be true for an $n\in \mathbb {N}$ such that $n\geq 2$, and let ∑$_{k1=0}$$^∞$a$_{1, k1}$, …, ∑$_{kn+1=0}$$^∞$a$_{n+1, kn+1}${\textstyle \sum _{k_{1}=0}^{\infty }a_{1, k_{1}}, \ldots , \sum _{k_{n+1}=0}^{\infty }a_{n+1, k_{n+1}}} be infinite series with complex coefficients, from which all except the $n+1$th one converge absolutely, and the $n+1$-th one converges. We first apply the induction hypothesis to the series ∑$_{k1=0}$$^∞$|a$_{1, k1}$|, …, ∑$_{kn=0}$$^∞$|a$_{n, kn}$|{\textstyle \sum _{k_{1}=0}^{\infty }|a_{1, k_{1}}|, \ldots , \sum _{k_{n}=0}^{\infty }|a_{n, k_{n}}|}. We obtain that the series $\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}\cdots \sum _{k_{n}=0}^{k_{n-1}}|a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}|$ converges, and hence, by the triangle inequality and the sandwich criterion, the series $\sum _{k_{1}=0}^{\infty }\left|\sum _{k_{2}=0}^{k_{1}}\cdots \sum _{k_{n}=0}^{k_{n-1}}a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}\right|$ converges, and hence the series $\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}\cdots \sum _{k_{n}=0}^{k_{n-1}}a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}$ converges absolutely. Therefore, by the induction hypothesis, by what Mertens proved, and by renaming of variables, we have: ${\begin{aligned}\prod _{j=1}^{n+1}\left(\sum _{k_{j}=0}^{\infty }a_{j,k_{j}}\right)&=\left(\sum _{k_{n+1}=0}^{\infty }\overbrace {a_{n+1,k_{n+1}}} ^{=:a_{k_{n+1}}}\right)\left(\sum _{k_{1}=0}^{\infty }\overbrace {\sum _{k_{2}=0}^{k_{1}}\cdots \sum _{k_{n}=0}^{k_{n-1}}a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}} ^{=:b_{k_{1}}}\right)\\&=\left(\sum _{k_{1}=0}^{\infty }\overbrace {\sum _{k_{2}=0}^{k_{1}}\sum _{k_{3}=0}^{k_{2}}\cdots \sum _{k_{n}=0}^{k_{n-1}}a_{1,k_{n}}a_{2,k_{n-1}-k_{n}}\cdots a_{n,k_{1}-k_{2}}} ^{=:a_{k_{1}}}\right)\left(\sum _{k_{n+1}=0}^{\infty }\overbrace {a_{n+1,k_{n+1}}} ^{=:b_{k_{n+1}}}\right)\\&=\left(\sum _{k_{1}=0}^{\infty }\overbrace {\sum _{k_{3}=0}^{k_{1}}\sum _{k_{4}=0}^{k_{3}}\cdots \sum _{k_{n}+1=0}^{k_{n}}a_{1,k_{n+1}}a_{2,k_{n}-k_{n+1}}\cdots a_{n,k_{1}-k_{3}}} ^{=:a_{k_{1}}}\right)\left(\sum _{k_{2}=0}^{\infty }\overbrace {a_{n+1,k_{2}}} ^{=:b_{n+1,k_{2}}=:b_{k_{2}}}\right)\\&=\left(\sum _{k_{1}=0}^{\infty }a_{k_{1}}\right)\left(\sum _{k_{2}=0}^{\infty }b_{k_{2}}\right)\\&=\left(\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}a_{k_{2}}b_{k_{1}-k_{2}}\right)\\&=\left(\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}\left(\overbrace {\sum _{k_{3}=0}^{k_{2}}\cdots \sum _{k_{n}+1=0}^{k_{n}}a_{1,k_{n+1}}a_{2,k_{n}-k_{n+1}}\cdots a_{n,k_{2}-k_{3}}} ^{=:a_{k_{2}}}\right)\left(\overbrace {a_{n+1,k_{1}-k_{2}}} ^{=:b_{k_{1}-k_{2}}}\right)\right)\\&=\left(\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}\overbrace {\sum _{k_{3}=0}^{k_{2}}\cdots \sum _{k_{n}+1=0}^{k_{n}}a_{1,k_{n+1}}a_{2,k_{n}-k_{n+1}}\cdots a_{n,k_{2}-k_{3}}} ^{=:a_{k_{2}}}\overbrace {a_{n+1,k_{1}-k_{2}}} ^{=:b_{k_{1}-k_{2}}}\right)\\&=\sum _{k_{1}=0}^{\infty }\sum _{k_{2}=0}^{k_{1}}a_{n+1,k_{1}-k_{2}}\sum _{k_{3}=0}^{k_{2}}\cdots \sum _{k_{n+1}=0}^{k_{n}}a_{1,k_{n+1}}a_{2,k_{n}-k_{n+1}}\cdots a_{n,k_{2}-k_{3}}\end{aligned}}$ Therefore, the formula also holds for $n+1$.

## Relation to convolution of functions

A finite sequence can be viewed as an infinite sequence with only finitely many nonzero terms, or in other words as a function $f:\mathbb {N} \to \mathbb {C}$ with finite support. For any complex-valued functions f, g on $\mathbb {N}$ with finite support, one can take their convolution: $(f*g)(n)=\sum _{i+j=n}f(i)g(j).$ Then ∑(f∗g)(n){\textstyle \sum (f*g)(n)} is the same thing as the Cauchy product of ∑f(n){\textstyle \sum f(n)} and ∑g(n){\textstyle \sum g(n)}.
More generally, given a monoid S, one can form the semigroup algebra $\mathbb {C} [S]$ of S, with the multiplication given by convolution. If one takes, for example, $S=\mathbb {N} ^{d}$, then the multiplication on $\mathbb {C} [S]$ is a generalization of the Cauchy product to higher dimension.