Cauchy product
From Wikipedia, the free encyclopedia
In mathematics, the Cauchy product, named in honor of Augustin Louis Cauchy, of two strictly formal (not necessarily convergent) series
usually, of real or complex numbers, is defined by a discrete convolution as follows. The Cauchy product is
for n = 0, 1, 2, ...
"Formal" means we are manipulating series in disregard of any questions of convergence. These need not be convergent series. See in particular formal power series.
One hopes, by analogy with finite sums, that in cases in which the two series do actually converge, the sum of the infinite series
is equal to the product
just as would work when each of the two sums being multiplied has only finitely many terms.
In sufficiently well-behaved cases, this works. But—and this is an important point—the Cauchy product of two sequences exists even when either or both of the corresponding infinite series fails to converge.
Contents |
[edit] Examples
[edit] Finite series
xi = 0 for all i > n and yi = 0 for all i > m. Here the Cauchy product of and is readily verified to be . Therefore, for finite series (which are finite sums), Cauchy multiplication is direct multiplication of those series.
[edit] Infinite series
- For some , let and . Then
by definition and the binomial formula. Since, formally, and , we have shown that . Since the limit of the Cauchy product of two absolutely convergent series is equal to the product of the limits of those series (see below), we have proven the formula exp(a + b) = exp(a)exp(b) for all .
- As a second example, let x(n) = 1 for all . Then C(x,x)(n) = n + 1 for all so the Cauchy product and it does not converge.
[edit] Convergence and Mertens' theorems
Let x, y be real sequences. It was proved by Franz Mertens that if the series converges to Y and the series converges absolutely to X then their Cauchy product converges to XY. It is not sufficient for both series to be conditionally convergent. For example, the sequence xn = ( − 1)n / n generates a conditionally convergent series but the sequence C(x,x) does not converge to 0. Here is a proof.
[edit] Proof of Mertens' theorem
Let , and . Then by rearangement. So . Fix ε > 0. Since is absolutely convergent and is convergent then there exists an integer N such that for all and an integer M such that for all (since the series converges, the sequence must converge to 0). Also, there exists an integer L such that if then . Therefore,
for all integers n larger than N, M, and L. By the definition of convergence of a series .
[edit] Cesàro's theorem
If x and y are real sequences and and then
[edit] Generalizations
All of the foregoing applies to sequences in (complex numbers). The Cauchy product can be defined for series in the 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.