We've already seen an example of this sort of thing, in the Cauchy Product Formula. There we were, essentially, studying
and the key ingredient was interchanging the order of summation. We shall look at the Cauchy Product formula in those terms again in a little while. First, let us think in more detail about what is meant by
We shall see that there is no one answer that is clearly right.
Equally well, we could choose to sum the terms along the rows first, and then add the results of that. That would amount to fixing n, and forming the series obtained by summing along n.
These two methods of summation need not always give the same answer. In fact, one may converge,
while the terms of the other do not even exist:
For a third approach, we could sum all (m,n) with m and
n less than k and take the limit as k goes to
infinity.
This would have the advantage that only one limit is being computed, instead of infinitely many. Of
course this would still be true if we took any finite collection of terms and let the collection
grow so as to include all pairs (m,n). Put more precisely:
Note that the inner sum in this formulation runs from 1 to k-1. In our original statement of the Cauchy Product Formula the sum ran from 0 to k. This is simply because our absolutely convergent series in the original case started at zero (because they were modelled on power series) while now, our series start at 1.